Publication

Hierarchical location service for mobile ad-hoc networks

Related publications (37)

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.

GPS-free Positioning in Mobile Ad-Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

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 ...

2002

Malice, Selfishness, and Slander in Mobile Ad-hoc Networks.

Jean-Yves Le Boudec, Sonja Buchegger

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 ...

2002

Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks

Martin Vetterli, Matthias Grossglauser

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 ...

2002

Anchored Path Discovery in Terminode Routing

Jean-Yves Le Boudec, Ljubica Blazevic

Terminode routing, defined for potentially very large mobile ad hoc networks, forwards packets along anchored paths. An anchored path is a list of fixed geographic points, called anchors. Given that geographic points do not move, the advantage to tradition ...

2002

GPS-free Positioning in Mobile Ad-Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

In this paper we consider the problem of node positioning in ad-hoc networks. We propose a distributed, infrastructure-free positioning algorithm that does not rely on Global Positioning System (GPS). The algorithm uses the distances between the nodes to b ...

2001

Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Levente Buttyan

In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node ...

2001

Self Organized Terminode Routing Simulation

Jean-Yves Le Boudec, Ljubica Blazevic

In this paper we simulated terminode routing. This routing scheme is designed for wide area networks, where a large part or all the nodes are mobile. Terminode routing is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Rem ...

2001