Hybrid On-demand Greedy Routing Protocol with Backtracking for Mobile Ad-Hoc Networks

On-demand routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied. Generally, on-demand routing protocols establish routes by flooding route requests throughout the entire network, which is not a scalable approach. On the other hand, geographic routing protocols do not establish route a priory but route data packets in a greedy fashion towards the destination. When a packet encounters a void (i.e., a node that has no neighbor that is closer to the destination than itself), it is routed around the void using various strategies such as constructing a planarized network graph and then using right hand rule to route around the void. In this paper, we present an on-demand routing protocol which uses greedy approach for route request propagation during route establishment. When the route request encounters a void, it simply uses backtracking to forward the route request around the void without requiring the construction of planarized network graph to round around the void. We compare the performance of our protocol with the well known Ad-Hoc On-demand Distance Vector (AODV) routing protocol which has over twenty thousand citations. Simulation results show that our protocol has a higher packet-delivery ratio, lower control overhead, and less hop count on average than AODV.