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.
In this paper we present the main challenges in mobile ad-hoc wide area networks (MAWANs). A MAWAN is a wide area, large, (potentially) entirely wireless networks. We describe the Terminodes Project (a 10-year-long research program (2000-2010) in MAWANs, s ...
There is an important trend toward personal mobile communications. People use more and more handheld devices to keep in touch with friends or business partners. One possible way to connect these devices is provided by wireless radio technologies. The emerg ...
In mobile ad-hoc networks nodes need to cooperate to communicate, but there are many reasons for non-cooperation. Saving power or preventing other nodes from obstructing a service are merely selfish reasons for non-cooperation, whereas nodes may also activ ...
Ad-hoc networks are a key in the evolution of wireless networks. Ad-hoc networks are typically composed of equal nodes, which communicate over wireless links without any central control. Ad-hoc wireless networks inherit the traditional problems of wireless ...
We consider the problem of node positioning in ad hoc networks. We propose a distributed, infrastructure- free positioning algorithm that does not rely on GPS (Global Positioning System). Instead, the algorithm uses the distances between the nodes to build ...
Applications running on a mobile wireless device most be able to adapt gracefully to limited and fluctuating network resources. When multiple applications run on the same device, control over bandwidth scheduling becomes fundamental in order to coordinate ...
We determine the capacity of a particular large Gaussian relay network in the limit as the number of relays tends to infinity. The upper bounds follow from a cut-set argument, and the lower bound follows from an argument involving uncoded transmission. We ...
In mobile ad hoc networks, it is usually assumed that all the nodes belong to the same authority; therefore, they are expected to cooperate in order to support the basic functions of the network such as routing. In this paper, we consider the case in which ...
