A route discovery approach to find an optimal path in MANET using reverse reactive routing protocol

In mobile Ad-hoc networks, during the transmission of data, there is a chance of route failure, so that the route rediscovery should be done. Reactive routing protocol determines a route to a specific destination when a particular packet is going to send. Here we propose a reverse reactive routing protocol, based on new route discovery approach, which is used to find an optimal route to the destination with lower overhead, than the flooding based reverse route discovery. The reverse route discovery approach is obtained through three steps; those are Reverse route Computation in Route Request (RREQ), Reverse route Computation in Route Reply (RREP) and Route Error (RERR). In this approach, each source and destination pair establishes various paths in the route discovery and they are stored in their route collections. As the nodes often have a finite capacity path reserve, it may not be possible to store all paths in routing table. In case of route failure in the primary route, a recovery node which is an overhearing neighbor (next hops) discovers it and establishes a link recovery pathway with maximum bandwidth from its route supply. By simulation results, we show that the proposed approach improves network performance better than the other reactive routing protocol (AODV). The projected route recovery management technique can prevent the repeated collision and degradation in the network performance.