FRANC: A Lightweight Java Framework for Wireless Multihop Communication
Related publications (32)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Wireless communication today supports heterogeneous wireless devices with a number of different wireless network interfaces (WNICs). A large fraction of communication is infrastructure based, so the wireless access points and hotspot servers have become mo ...
In this paper, we propose resource allocation strategies for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that relates to their dista ...
So far, the problem of positioning in wireless networks has been mainly studied in a non-adversarial setting. In this work, we analyze the resistance of positioning techniques to position and distance spoofing attacks. We propose a mechanism for secure pos ...
Energy efficiency, i.e., the amount of battery energy consumed to transmit bits across a wireless link, is a critical design parameter for wireless ad-hoc networks. We examine the problem of broadcasting information to all nodes in an ad-hoc network, when ...
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packet forwarding in order to save its own resources. Some researchers have propose ...
Ad hoc networks are expected to be used in a number of very different situations. But a common characteristic is that the nodes have to cooperate with each other. This problem is particularly crucial, if each node is its own authority. Reckoning the releva ...
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packet forwarding in order to save its own resources. Some researchers have propose ...
There is a fundamental tradeoff between power consumption, data transmission rates, and congestion levels in a wireless network. These three elements influence the performance of rate and power control strategies, and they need to be coordinated judiciousl ...
We propose a probabilistic routing algorithm for wireless ad-hoc networks. The focus is on applications that can tolerate end-to-end delays and those for which the final destination for the packets is a small region. The nodes are assumed stationary and es ...