PRDS: A Priority Based Route Discovery Strategy for Mobile Ad Hoc Networks
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 (PRDS) 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%.
KeywordsNetwork Size Delivery Ratio Packet Delivery Ratio Route Discovery Distribute Coordination Function
Unable to display preview. Download preview PDF.
- 1.Perkins, C.E., Royer, E.M.: Ad-hoc On Demand Distance Vector Routing. In: Proc. WMCSA 1999, New Orleans, LA, pp. 90–100 (1999)Google Scholar
- 3.Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: Proc. ACM/IEEE MobiCom, Seattle, WA, USA, pp. 151–162 (1999)Google Scholar
- 4.Li, J., Mohapatra, P.: A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks. In: Proc. IEEE GlobeCom 2003, San Francisco, USA (2003)Google Scholar
- 6.Bajaj, L., Takai, M., Ahuja, R., Tang, K., Bagrodia, R., Gerla, M.: GloMoSim: A Scalable Network Simulation Environment. UCLA Computer Science Department Technical Report 990027 (1999)Google Scholar