By Topic

NARD: Neighbor-Assisted Route Discovery in Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Gomez, J. ; Nat. Autonomous Univ. of Mexico, Mexico City ; Cervantes, J.M. ; Rangel, V. ; Atahualpa, R.
more authors

Routing protocols for mobile ad hoc networks usually discover routes by flooding the entire network with control packets; this technique is known as blind flooding. This paper presents NARD, a neighbor-assisted route discovery protocol for wireless ad hoc networks. In NARD, a source node floods a limited portion of the network looking not only for the destination node, but also for routing information of other nodes (called neighbors) that were known to be near the destination node recently. Neighbor nodes can be used as anchor points where a second limited flooding takes place in search for the destination node. Because only a limited portion of the network is flooded by control packets near the source and destination nodes, NARD can significantly reduce the signaling overhead of route discovery compared with blind flooding techniques. Simulations with NS2 were undertaken to verify the validity of our approach.

Published in:

Mobile Adhoc and Sensor Systems, 2007. MASS 2007. IEEE International Conference on

Date of Conference:

8-11 Oct. 2007