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

Amal Alhosban | Zendy; Ismail Ababneh | Zendy; Zaki Malik | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Amal Alhosban,

Ismail Ababneh,

Zaki Malik

Publication year - 2012

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2012.06.013

Subject(s) - computer science , flooding (psychology) , computer network , wireless ad hoc network , overhead (engineering) , network packet , mobile ad hoc network , routing protocol , optimized link state routing protocol , adaptive quality of service multi hop routing , distributed computing , destination sequenced distance vector routing , ad hoc wireless distribution service , link state routing protocol , algorithm , wireless , telecommunications , operating system , psychology , psychotherapist

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research