Making on-demand routing protocols based on destination sequence numbers robust
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, de facto partitions, and counting to infinity in th epresence of link or node failures in ad hoc networks using unreliable medium access control protocols like the IEEE 802.11 DCF. 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 ADOV that eliminates the use of delete periods for destination-based sequence numbers, and show with simulation experiments that the new approach performs the same or better than AODV.
Rangarajan, H. and Garcia-Luna-Aceves, J. J. Making on-demand routing protocols based on destination sequence numbers robust. IEEE International Conference on Communications (ICC 2005); 2005 May 16-20; Seoul; Korea.