Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...
We consider the question of what performance metric to maximize when designing ad-hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism which tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks ...
Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism that tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks. ...
The secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the Mobile Ad hoc Networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The pr ...
In this paper, we propose to apply Contention-Based Forwarding (CBF) to Vehicular Ad Hoc Networks (VANETs). CBF is a greedy position-based forwarding algorithm that does not require proactive transmission of beacon messages. CBF performance is analyzed usi ...
Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS-driven services. A promising technique for addressing this problem is to use ...
Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous ...
