Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages
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.
The focus of this thesis is on the study of decentralized wireless multi-hop networks. We are particularly interested in establishing bounds on the traffic-carrying capabilities of wireless ad hoc networks and conditions on the scalability of such networks ...
So far, the problem of positioning in wireless networks has been studied mainly in a nonadversarial setting. In this paper, we analyze the resistance of positioning techniques to position and distance spoofing attacks. We propose a mechanism for secure pos ...
Multi-hop ad-hoc networks consist of nodes which cooperate by forwarding packets for each other to allow communication beyond the power range of each node. In pure ad-hoc networks, no additional infrastructure is required to allow the nodes to communicate. ...
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 ...
We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source nod ...
In this paper, we propose a power control strategy for distributed wireless networks by using a quadratic state-space control design. Simulation results show the effectiveness of the proposed power control algorithm. ...
Reasoning about the success of distributed computations in the face of node and communication failures is an ever hard issue. This is particularly true in highly dynamic ad hoc networks where communication between two nodes can often take place only via in ...
In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simp ...
Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coord ...
Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to prese ...
