Efficient use of route requests for loop-free on-demand routing in ad hoc networks

Authors:
Hari Rangarajan;J. J. Garcia-Luna-Aceves
Affiliations:
Computer Engineering Dept., University of Of California at Santa Cruz, Santa Cruz, CA;Computer Engineering Dept., University of Of California at Santa Cruz, Santa Cruz, CA
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 1
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new loop-free on-demand routing protocol for ad-hoc networks, the Labeled Successor Routing (LSR) protocol, which identifies loop-free successors to a destination using route-request labels (RRL). Each route request (RREQ) used during the on-demand destination search process is identified uniquely by a sequence number associated with the issuing source address. Route replies (RREP), which traverse loop-free paths created by RREQs, carry the associated RRL that is stored by nodes along the created successor path to the destination. Without requiring an additional mechanism for loop-freedom (e.g., per destination-sequence numbers or source-routing) LSR allows neighbors of a source to reply to RREQs, avoiding the destination being the only node capable of replying. Simulations results for scenarios consisting of networks of 50 and 100 mobile nodes show that LSR performs comparably or better than the Dynamic Source Routing (DSR) protocol, AODV, and the Optimized Link State Routing (OLSR) protocol.