Abstract
Existing on-demand routing algorithms for mobile ad hoc networks such as DSR (dynamic source routing) and AODV (ad hoc on-demand distance vector) routing do not consider maintenance of established paths. So after a link failure is detected, the path discovery operation is triggered. This causes delay and jitter to packets delivered. To address this problem, the recovery action is triggered early in preemptive route maintenance by detecting that a link is likely to break soon and it finds an alternative path in advance. However, broadcasting RREQs (Route Requests) to find an alternate good path can degrade the performance of mobile ad hoc networks where topology changes frequently. [3] A new proactive scheme is proposed to enhance performance of preemptive route maintenance for AODV. In the proposed idea, nodes adjacent to destination generate GREPs (gratuitous replies) to build extended sub-paths to source and the generated GREPs are forwarded by the “greedy forwarding” strategy using knowledge of position information of neighbors and source. The simulation results prove that our idea is more efficient than PAODV (AODV with preemptive route maintenance) in terms of number of broken links, packet delivery fraction, and routing load.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” in Mobile Computing (T. Imielinski and H. Korth, eds.), Kluwere Academic Publishers, 1994.
C. E. Perkins and E. M. Royer, “Ad-hoc on demand distance vector routing,” in IEEE Work-shop on Mobile Computing Systems and Applications (WMCSA), February 1999.
Tom Goff, Nael B. Abu-Ghazaleh, Dhananjay S. Phatak, Ridvan Kahvecioglu, “Preemptive Routing in Ad Hoc Networks”, The seventh annual international conference on Mobile computing and networking 2001 July 2001
B._Karp and H. T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in Annual International Conference on Mobile Computing and Networking (MOBICOM), August 2000.
C. Perkins and P. Bhagwat, Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers, ACM SIGCOMM, (October 1994).
S. Murthy and J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks”, ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183–197.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wook Cha, H., Shik Park, H. (2003). A Proactive Scheme Using Sub-path Extension to Enhance Performance of Preemptive Route Maintenance Scheme for AODV Routing. In: Lee, J., Kang, CH. (eds) Mobile Communications. CIC 2002. Lecture Notes in Computer Science, vol 2524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36555-9_50
Download citation
DOI: https://doi.org/10.1007/3-540-36555-9_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00732-6
Online ISBN: 978-3-540-36555-6
eBook Packages: Springer Book Archive