A Robust Routing Protocol by a Substitute Local Path in Ad Hoc Networks

  • Mary Wu
  • SangJoon Jung
  • Seunghwan Lee
  • Chonggun Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)


Ad hoc wireless networks consist of mobile nodes in an area without any centralized access point or existing infrastructure. The network topology changes frequently due to nodes’ migrations, signal interferences and power outages. One of the ad hoc network routing protocols is the on-demand routing protocol that establishes a route to a destination node only when it is required by a source node. The overhead of maintenance is low, but it is necessary to reestablish a new route when the routing path breaks down. Several recent papers have studied about ad hoc network routing protocols avoiding the disconnection of the existing route. Each active node on the routing path detects the danger of a link breakage to a downstream node and try to reestablish a new route. The node detects a link problem, try to find a substitute local path before the route breaks down. If the local reestablishment process fails, the route breaks down. In this paper, a robust routing protocol is proposed to increase the success rate of the local route reestablishment and enhance the communication delay performance. The results of computer simulation show that the proposed routing protocol increases system performance.


Mobile Node Signal Strength Destination Node Transmission Range Active Node 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garcia-Luna-Aceves, J.J., Mosko, M., Perkins, C.: A New Approach to On-Demand Loop-Free Routing in Ad Hoc Networks. In: Proc. Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), July 13-16 (2003)Google Scholar
  2. 2.
    Raju, J., Garcia-Luna-Aceves, J.J.: Efficient On-Demand Routing Using Source-Tracing in Wireless Networks. In: Proc. IEEE Global Telecommunications Conference (GLOBECOM), November 27-December 1 (2000)Google Scholar
  3. 3.
    Perkins, C.E., Royer, E.M.: Ad-hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90–100 (1999)Google Scholar
  4. 4.
    Perkins, C., Belding-Royer, E., Das, S.: RFC 3561 - Ad hoc On-Demand Distance Vector (AODV) Routing (2003)Google Scholar
  5. 5.
    Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imielinski, T., Korth, H. (eds.) Mobile computing, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)CrossRefGoogle Scholar
  6. 6.
    Park, V.D., Corson, M.S.: A Highly Adaptive Distributed Routing Algorithm for Mobile wireless Networks. In: Proceedings of IEEE INFOCOM 1997, April 1997, pp. 1405–1413 (1997)Google Scholar
  7. 7.
    Toh, C.-K.: Associativity-Based Routing For Ad-Hoc Mobile Networks. Journal on Wireless Personal Communications 4 (First Quarter 1997)Google Scholar
  8. 8.
    Dube, R., et al.: Signal Stability based Adaptive Routing(SSA) for Ad Hoc Mobile Networks. IEEE Personal Communication Magazine (February 1997)Google Scholar
  9. 9.
    Chang, C.-Y., Tu, S.-C.: Active route-maintenance protocol for signal-based communication paht in ad hoc networks. Journal of Network and Computer Applications 25, 161–177 (2002)CrossRefGoogle Scholar
  10. 10.
    Wu, M., Choi, Y.J., Jung, Y., Lim, K.S., Kim, C.: A Calculation Method of Handoff Rate using Speed and Direction of Mobile Stations in Cellular Networks. Journal of Kiss, Information Networking 29(4), 8 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mary Wu
    • 1
  • SangJoon Jung
    • 2
  • Seunghwan Lee
    • 3
  • Chonggun Kim
    • 1
  1. 1.Dept of Computer Eng.Yeungnam Univ.KyungbukKorea
  2. 2.Dept. of General EducationKyungil Univ.KyungbukKorea
  3. 3.SoC R&D Center, System LSI divisionSamsung Electronics Co. 

Personalised recommendations