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, 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.