PRDS: A priority based route discovery strategy for mobile Ad hoc networks

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most reactive route discovery protocols in MANETs employ a random delay between rebroadcast route requests (RREQ) in order to avoid "broadcast storms". However this can lead to problems such as "next hop racing", and high redundancy in the rebroadcasting. In this paper we propose a Priority-based Route Discovery Strategy (PROS) to address both problems. PRDS assigns a high rebroadcast priority to "good" candidates to reduce next hop racing; and introduces a competing procedure to keep "bad" candidates from rebroadcast to alleviate "rebroadcast redundancy". PRDS is a general mechanism that can be applied to different reactive routing protocols to improve the routing performance. As an example, a macrobian route discovery strategy using PRDS (PRDS-MR) is introduced. Simulation results show that PRDS-MR outperforms AODV in terms of packet delivery ratio and delay while decreasing routing overhead up to 50%-80%. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Zhou, B., Marshall, A., Wu, J., Lee, T. H., & Liu, J. (2004). PRDS: A priority based route discovery strategy for mobile Ad hoc networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 410–416. https://doi.org/10.1007/978-3-540-27824-5_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free