A new framework for loop-free on-demand routing using destination sequence numbers

Abstract

A generalized framework for loop-free routing based entirely on destination sequence numbers is presented. The framework eliminates the counting-to-infinity problem found in AODV and other on-demand routing protocols based on destination sequence numbers. The sequence-number window routing (SWR) protocol is presented as an example of this framework. SWR is compared via simulations with DSR, AODV and OLSR using networks of 50 and 100 mobile nodes; the results indicate that SWR is as efficient as AODV without incurring counting to infinity.