On-Demand And Greedy Forwarding Based Routing Protocol For Mobile Ad Hoc Networks

The dynamic topology of a mobile ad hoc network poses a real challenge in the design of routing protocol, especially in high-dynamic environments. In this paper, we proposed a new routing protocol which based on on-demand and greedy forwarding. This protocol proposed three opinions to RGR, i.e., through scoped flooding to decrease control overhead in route discovery phase, through mobility prediction to monitor the condition of reactive path and help nodes to choose the proper next-hop in GGF phase, and through delayed route requests to reduce unnecessary waste of network resources. Compared to RGR, AODV, Modified-RGR and Optimized-RGR, simulation results show that the improved RGR not only have high packet receive ratio, but have low average normalized routing overhead and average end-to-end delay.