Abstract
We propose an effective path recovery scheme for AODV in mobile ad-hoc network environment. Even though the existing path recovery scheme for AODV routing protocol can recover the disconnected path in some ways, however, they can not utilize the pre-connected routing nodes when we handle the nodes in Ad-hoc environment. In order to utilize the pre-connected routing nodes in recovering the path more effectively, we use a designated candidate nodes. The candidate nodes are used to recover the disconnected path using the pre-connected routing information. This scheme produces better results with less control packets with faster path recovery time.
This research was supported by the Brain Korea 21 project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Perkins, R.C., Belding-Royer, E., Das, S.: RFC3561. Ad hoc On-Demand Distance Vector (AODV) (July 2003)
Clausen, T., Jacquet, P. (eds.): RFC 3626, Optimized Link State Routing Protocol (OLSR) (October 2003)
Corson, S., Macker, J.: RFC 2501, Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations (January 1999)
Johnson, D.B., Maltz, D.A., Hu, Y.-c., Jetcheva, J.G.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks(DSR). Internet Draft, IETF MANET Working Group, draft-ietf-manet-dsr-07.txt (February 2002)
Haas, Z.J., Perlman, M.R.: The Zone Routing Protocol(ZRP) for Ad Hoc Networks, Internet Draft, IETF MANET Working Group, draft-ietf-manet-zone-3.txt (March 2000)
Ko, Y.-B., Vaidya, N.H.: Location-Aided Routing(LAR) in mobile Ad-hoc network. Wireless Networks 6(4), 307–321 (2000)
Basagni, S., Chlamtac, I., Syrotiuk, V.R., Woodward, B.A.: A distance routing affect algorithm for mobility(DREAM). In: Proc. of the ACM/IEEE International Conf. on Mo-bile computing and Networking, pp. 76–84 (1998)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless net-works. In: Proc. of the international conf. on Mobile computing and networking, August 2000, pp. 243–254 (2000)
Liao, W., Sheu, J., Tseng, Y.: GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks. Telecom. Systems 18, 37–60 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, Sm., Kim, K. (2006). An Effective Path Recovery Mechanism for AODV Using Candidate Node. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_115
Download citation
DOI: https://doi.org/10.1007/11942634_115
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49860-5
Online ISBN: 978-3-540-49862-9
eBook Packages: Computer ScienceComputer Science (R0)