An Efficient Route Discovery in Manets with Improved Route Lifetime

Ad hoc Networks consist of mobile nodes with limited battery power. The critical issue for routing in mobile ad hoc network is how to select a stable path with longer lifetime since mobility and power drain of a node causes frequent path failure. This path failure causes frequent route discovery which affects the performance of the routing protocol. The path failure also increases computational overhead of the nodes. Hence, in this paper, we propose three algorithms to estimate the stability of the route by considering the energy drain of the nodes and the rate of mobility. Finally we implement our proposed algorithms in AODV and the performance is evaluated against the original AODV. Our protocol improves the network performance and reduces the computation overhead by avoiding frequent route discovery since we select a stable path with longest life time. With the help of network simulator we substantiate that our proposed protocol performs better than the existing stability-based routing protocols with improved packet delivery ratio and reduced routing overhead.