Dynamic Path Adaptation Routing Protocol for Mobile Ad Hoc Networks

In this paper, we present a reactive routing protocol for mobile ad hoc networks. The proposed routing scheme is called dynamic path adaption routing (DPA) which maintains a single path and updates the path locally as topology changes. Our motivation behind DPA is that due to the mobility the topology does not change drastically at the short time period. The local recovery and route updates enhance the route reliability and reduce the frequency of the extensive route discoveries. For local route recovery and optimization, DPA extends first the periodic ´HELLO´ message so that each node collects the link state information within two hops. Also, we extends the route table not only to maintain paths based on (source, destination) pair but also to keeps additional path information, forwarding window. After the route changes, the updated route information is exchanged explicitly among neighbors to keep the consistent view on the path. By the experiments, we observed that the our routing scheme shows the highest packet delivery ratio and the lowest end-to-end delay with relatively low control message overhead compare to other reactive routing protocols