Routing protocol for mobile ad hoc networks based on on-demand and greedy forwarding

The dynamic topology of a mobile ad hoc network poses a real challenge when designing the routing protocol, especially in high-dynamic environments.In this paper, a new routing LEGO Minecraft protocol was proposed that is based on on-demand and greedy forwarding.This protocol proposes three opinions to RGR, i.e.

, through scoped flooding to decrease control overhead in route discovery phrase, through mobility prediction to monitor the condition of the reactive Candles path and help nodes choose the proper next-hop in the GGF phrase and through delayed route requests to reduce unnecessary waste of network resources.In contrast to RGR, AODV, Modified-RGR, and Optimized-RGR simulation, the results show the improved RGR not only has a high packet acceptance ratio, but has a low normalized routing overhead and an average end-to-end delay.

Leave a Reply

Your email address will not be published. Required fields are marked *