An Effective Path Recovery Mechanism for AODV Using Candidate Node

  • Sang-min Lee
  • Keecheon Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4331)


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.


Mobile Node Control Packet Dynamic Source Route Candidate Node Optimize Link State Route 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Perkins, R.C., Belding-Royer, E., Das, S.: RFC3561. Ad hoc On-Demand Distance Vector (AODV) (July 2003)Google Scholar
  2. 2.
    Clausen, T., Jacquet, P. (eds.): RFC 3626, Optimized Link State Routing Protocol (OLSR) (October 2003)Google Scholar
  3. 3.
    Corson, S., Macker, J.: RFC 2501, Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations (January 1999)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
  7. 7.
    Ko, Y.-B., Vaidya, N.H.: Location-Aided Routing(LAR) in mobile Ad-hoc network. Wireless Networks 6(4), 307–321 (2000)MATHCrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Liao, W., Sheu, J., Tseng, Y.: GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks. Telecom. Systems 18, 37–60 (2001)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sang-min Lee
    • 1
  • Keecheon Kim
    • 1
  1. 1.Dept, of Computer Science & engineeringKonkuk UniversitySeoulKorea

Personalised recommendations