Indirect routing using distributed location information

Viana, Aline Carneiro; Amorim, Marcelo Dias de; Fdida, Serge; Rezende, José Ferreira de

doi:10.1109/percom.2003.1192745

Cited by 22 publications

(22 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As well described by works found in the literature [2,3,4,5,6,7], the indirect service model is instantiated as a rendezvous-based communication abstraction. Nodes called rendezvous nodes are responsible for storing the location information of others nodes in the topology.…”

Section: Indirect Routing Strategymentioning

confidence: 99%

“…Tribe [7] is a rendezvous-based routing protocol for self-organizing networks. By managing regions of a logical addressing space, Tribe nodes route in a hopby-hop basis with small amount of information and communication cost.…”

Section: Related Workmentioning

confidence: 99%

“…The resilience of existent proposals and, consequently, the performance of the routing protocols are strongly related to the complexity of the deployed addressing structure. On the one hand, tree-like structures (e.g., L+ [5], Tribe [7], and PeerNet [6]) lead to simple manageable spaces. Nevertheless, they have low route selection flexibility, which results in low routing performance and poor resilience to failures/mobility.…”

Section: Increasing the Number Of Paths Connectionsmentioning

confidence: 99%

“…The functionalities of decoupling identification from location, and of providing a general mapping between them, have made the DHT abstraction an interesting principle to be integrated at network layer -this technique is called indirect routing. The main advantage of such systems is that they offer powerful and flexible rendezvous-based communication abstraction [2,3,4,5,6,7].…”

Section: Introductionmentioning

confidence: 99%

“…This model describes a coherent sharing of the addressing space among the nodes, which determines the consistency of the routing protocol. Tribe [7], PeerNet [6,12], Landmark [13,14], and L+ [5] are examples of such protocols.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

DHT-based Functionalities Using Hypercubes

Alvarez-Hamelin¹,

Viana²,

Amorim³

2006

Ad-Hoc Networking

View full text Add to dashboard Cite

Abstract. Decoupling the permanent identifier of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network.

show abstract

Section: Indirect Routing Strategymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Increasing the Number Of Paths Connectionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

DHT-based Functionalities Using Hypercubes

Alvarez-Hamelin¹,

Viana²,

Amorim³

2006

Ad-Hoc Networking

View full text Add to dashboard Cite

show abstract

M‐DART: multi‐path dynamic address routing

Caleffi¹,

Paura²

2011

Wireless Communications

View full text Add to dashboard Cite

The paper proposes a Distributed Hash Table (DHT)-based multi-path routing protocol for scalable ad hoc networks. Specifically, we propose a multipath-based improvement to a recently proposed DHT-based shortest-path routing protocol, namely the Dynamic Address RouTing (DART). The resulting protocol, referred to as multi-path DART (M-DART), guarantees multi-path forwarding without introducing any additional communication or coordination overhead with respect to DART. The performances of M-DART have been evaluated by means of numerical simulations across a wide range of environments and workloads. The results show that M-DART performs the best or at least comparable with respect to widely adopted routing protocols in all the considered scenarios. Moreover, unlike these protocols, it is able to assure satisfactory performances for large networks by reducing the packet loss by up to 75%.

show abstract

ELIP: Embedded Location Information Protocol

Benbadis

Amorim

Fdida

2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

It has been recently shown that mobility in ad hoc networks can be an advantage instead of an inconvenience. Nevertheless, one class of mobile elements has been neglected up-to-date: data packets. In this paper, we propose to take advantage of the inherent mobility of data packets to disseminate location information throughout the network. We focus on the age-and-position based (APB) routing case. Knowing its own geographic or virtual coordinates is not enough since a source needs to discover the position of the destination before establishing a communication. This is the role of a location service, which depends, in turn, on an efficient location distribution/publishing system. Our proposal, Embedded Location Information Protocol (ELIP), allows nodes to piggyback their coordinates in existing data packets in order to efficiently disseminate their positions in the network. Contrary to traditional approaches that depend on encounters between nodes, ELIP converges much faster and does not require permanent node mobility.

show abstract

Indirect routing using distributed location information

Cited by 22 publications

References 8 publications

DHT-based Functionalities Using Hypercubes

DHT-based Functionalities Using Hypercubes

M‐DART: multi‐path dynamic address routing

ELIP: Embedded Location Information Protocol

Contact Info

Product

Resources

About