By Topic

Making on-demand routing protocols based on destination sequence numbers robust

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
$31 $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

2 Author(s)
Hari Rangarajan ; Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA ; Garcia-Luna-Aceves, J.J.

We show that the way in which the ad-hoc on-demand distance vector (AODV) protocol handles destination-based sequence numbers can lead to looping of data packets, defacto network partitions, and counting to infinity in the presence of link or node failures in ad hoc networks using an unreliable medium access control (MAC) protocol like the IEEE 802.11 DCF (distributed coordination function). The source of AODV's problems with sequence numbers is the use of a delete period after which nodes are allowed to forget invalid routes to destinations. We present a new approach for the handling of sequence numbers in AODV that eliminates the use of delete periods for destination-based sequence numbers, and show, with simulation experiments, that the new approach performs the same as or better than AODV.

Published in:

Communications, 2005. ICC 2005. 2005 IEEE International Conference on  (Volume:5 )

Date of Conference:

16-20 May 2005