Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks
Related publications (102)
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.
We consider the Gaussian N-relay diamond net- work, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the ...
Continuously tunable, optically-controlled variable delay line based on dynamic Brillouin grating is exploited for automated synchronization of switching signals in a network node, enabling asynchronous contention resolution with packet priorization. ...
Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
This thesis evaluates the potential of Ultra Wideband Impulse Radio for wireless sensor network applications. Wireless sensor networks are collections of small electronic devices composed of one or more sensors to acquire information on their environment, ...
A close look at many existing systems reveals their two- or multi-layer nature, where a number of coexisting networks interact and depend on each other. For instance, in the Internet, any application-level graph (such as a peer-to-peer network) is mapped o ...
In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...
In a bandwidth-flooding attack, compromised sources send high-volume traffic to the target with the purpose of causing congestion in its tail circuit and disrupting its legitimate communications. In this paper, we present Active Internet Traffic Filtering ...
In this work we consider route planning for valuable delivery in an urban environment under the threat of ambushes in which a vehicle, starting from a depot, has to serve a set of predetermined destinations during the day. We provide a method to plan for h ...
This paper presents COMBINE, a directory-based consistency protocol for shared objects, designed for large-scale distributed systems with unreliable links. Directory-based consistency protocols support move requests, allowing to write the object locally, a ...
The focus of this thesis is on communication over cooperative information networks. In the first half of the thesis, we consider lossy source coding problems where a relay assists in the communication of a source stream between two terminals. The following ...