Optimal energy reverse reactive routing protocol (OERRRP): A new reverse reactive routing protocol for the route discovery in Ad Hoc networks

Abstract

An ad-hoc network is a self-sufficient collection of mobile nodes that occur to exist within a close nearness in an interval of time. In this paper, a new optimal energy conserving reverse reactive routing protocol has been proposed that computes the shortest path in between any source-destination pair on demand. The approach, unlike other energy conserving reactive protocols, finds loop-free, increases in power consumption and optimal path between the end nodes. The optimal energy reverse reactive routing protocol (OERRRP) uses the Dijkstra's optimal path routing algorithm. It works on their demand on the whole bandwidth available is significantly less and better energy conservation for the proposed protocol. It has been recognized that OERRRP combines the improvement procedure of the routing protocols while reducing the limitations of the changed approaches which seeks to incorporate the metric “residual energy” in the process route selection, indeed the residual energy of mobile nodes were considered when making routing decisions.