GFDA: Route Discovery Algorithms for On-demand Mobile Ad Hoc Routing Protocols

Route discovery in manymobile ad hoc protocols is based on flooding. However, flooding suffers from high overhead, which can increase contention and communication delays. In this paper,we propose twonewroute discovery algorithms that are aimed towards reducing these delays. Both algorithms are suitable for use with ad hoc protocols where nodes periodically broadcast Hello Messages. Using the GloMoSim simulator, the proposed algorithms were evaluated and compared to existing methods. The simulation results show that the proposed approach can reduce routing overhead, number of broken links, average delay, and the number of dropped packets. Small improvements in message delivery ratios are also observed.