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.
An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...
NOVELTY - At least some of wireless terminals can communicate over wireless links (2) in one or several hops with at least some of the other wireless terminals. The distances (dij) to one-hop neighbors may be measured in a number of the wireless terminals ...
We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...
We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage ...
This paper presents an application of heuristic methods to the restoration of distribution networks after disturbances. The heuristic approach is proposed since the problem needs more reasoning than pure calculation. Due to the combinatorial aspect of the ...
The aim of the present invention is to provide a method to detect misbehavior use of the IEEE 802.11 standard without modifying the standard itself. This aim is reached according to a method for detecting misbehavior in a contention based communication net ...
