Locating Nodes with EASE: Mobility Diffusion of Last Encounters 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 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 ...
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 ...
The focus of this paper is routing in a wide area mo-bile ad hoc network referred to as a Terminode Network. Our routing scheme is a combination of two protocols: Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TRR is used for rem ote des ...
We designed the terminode routing protoc ol with the objective to scale in large mobile ad hoc networks where the topology, or node distribution, is irregular. Our routing protocol is a combination of two protocols: Terminode Local Routing (TLR - to reach ...
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 ...
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 ...
In this paper, we introduce a framework to estimate the power consumption on switch fabrics in network routers. We propose different modeling methodologies for node switches, internal buffers and interconnect wires inside switch fabric architectures. A sim ...