More stable Ad-hoc on-demand distance vector routing protocol

Unicast routing, which discovers a path between a source-destination pair, is a challenging problem for wireless ad-hoc networks. Mobility demands additional requirements to be fulfilled during path selections. A neighbor v of a node u, is called ldquostablerdquo if v's relative movement with respect to u is very low. A path between a source-destination pair is called ldquostablerdquo if it consists of most stable neighbors at each intermediate hops. Certainly it is always desirable that any routing protocol picks up more stable paths. In this paper, we propose a modified version of popular AODV routing protocol which discovers its route for sending packets based on the stability of the path. Using simulation we show that our protocol is smart enough to cope with the mobility of the network. Finally, we discuss some special scenarios in which our proposed protocol performs much better.