A new approach to on-demand loop-free routing in ad hoc networks

Authors:
J. J. Garcia-Luna-Aceves;Marc Mosko;Charles E. Perkins
Affiliations:
University of California, Santa Cruz, CA;University of California, Santa Cruz, CA;Nokia Research Center, Mountain View, CA
Venue:
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Year:
2003

Citing 6
Cited 6

Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
A path-finding algorithm for loop-free routing

IEEE/ACM Transactions on Networking (TON)
A simple approximation to minimum-delay routing

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Neighborhood aware source routing

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Source-Tree Routing in Wireless Networks

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols

Using labeled paths for loop-free on-demand routing in ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance

IEEE Transactions on Mobile Computing
A new approach to on-demand loop-free routing in networks using sequence numbers

Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
A belt-zone method for decreasing control messages in ad hoc networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A robust routing protocol by a substitute local path in ad hoc networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A fast and reliable routing technique for wireless mesh networks

Wireless Communications & Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new protocol is presented for on-demand loop-free routing in ad hoc networks. The new protocol, called labeled distance routing (LDR) protocol, uses a distance invariant to establish an ordering criterion and per-destination sequence numbers to reset the invariant resulting in loop-freedom at every instant. The distance invariant allows nodes to change their next hops or distances to destinations without creating routing-table loops. The destination sequence number, which only the destination may increment, permits nodes to reset the values of their distance invariants. The performance of LDR is compared against the performance of three other protocols that are representative of the state-of-the art, namely AODV, DSR and OLSR.