Routing Based on Ad Hoc Link Reliability

  • Kwonseung Shin
  • Min Young Chung
  • Jongho Won
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4331)


An ad-hoc network is a group of mobile nodes acting as routers in infrastructureless networking situations. The ad-hoc node has a precondition of mobility, allowing path to be easily disconnected when transmitting data, thereby increasing network overhead. However, most ad-hoc routing protocols set up the path based only on the number of hops without considering other practical issues and factors. Here we consider a path with the least substantial number of transmissions (SNT) from source to destination based on reliabilities of links. This includes retransmissions due to unreliable links. In this paper, an efficient ad-hoc link reliability based routing (ALR) protocol suitable for mobile ad-hoc network in terms of SNT, is proposed. The network overhead and data transmission delay are reduced, by considering both ad-hoc link reliability and the number of hops. Our empirical performance evaluation comparing to AODV [1] shows that the enhancement is up to about 31% for SNT depending upon the mobility of nodes.


Mobile Node Data Packet Destination Node Intermediate Node Optimise Link State Rout 
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, C., Belding-Royer, E., Das, S.: Ad hoc On-Demand Distance Vector (AODV) Routing. Network Working Group, Request for Comments: 3561 (2003),
  2. 2.
    Corson, S., Macker, J.: Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations. Network Working Group, Request for Comments: 2501 (1999),
  3. 3.
    Ogier, R., Templin, F., Lewis, M.: Topology broadcast based on reverse-path forwarding routing protocol (TBRF). Network Working Group, Request for Comments: 3684 (2004),
  4. 4.
    Chiang, C.-C.: Routing in clustered multihop mobile wireless networks with fading channel. In: Proceedings of IEEE SICON, pp. 197–211 (1997)Google Scholar
  5. 5.
    Clausen, E.T., Jacquet, E.P.: Optimised Link State Routing Protocol (OLSR). Network Working Group, Request for Comments: 3626 (2003),
  6. 6.
    Johnson, D.B., Maltz, D.A., Hu, Y.-C.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). IETF MANET Working Group, INTERNET-DRAFT (2004),
  7. 7.
    Ko, Y.-B., Vaidya, N.H.: Location-aided routing (LAR) in mobile ad hoc networks. In: Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 1998) (1998)Google Scholar
  8. 8.
    Murthy, S., Garcia-Luna-Aceves, J.J.: A routing protocol for packet radio networks. In: Proceedings of the First Annual ACM International Conference on Mobile Computing and Networking, Berkeley, CA, pp. 86–95 (1995)Google Scholar
  9. 9.
    Villasenor-Gonzalez, L., Ge, Y., Lamont, L.: HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks. IEEE Communications Magazine 43(7), 118–125 (2005)CrossRefGoogle Scholar
  10. 10.
    Xue, G.: End-to-End Data Paths: Quickest or Most Reliable? IEEE Communications Letters 2(6), 156–158 (1998)CrossRefGoogle Scholar
  11. 11.
    Waxman, B.M.: Routing of Multipoint Connections. IEEE JSAC 9, 1617–1622 (1993)Google Scholar
  12. 12.
    Doar, M.: A Better Mode for Generating Test Networks. In: IEEE Proc. GLOBECOM 1996, pp. 86–93 (1996)Google Scholar
  13. 13.
    Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380–1387 (1993)Google Scholar
  14. 14.
    Calvert, K.L., Doar, M., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine, 160–163 (June 1997)Google Scholar
  15. 15.
    Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the Web graph. In: Proc. 41stGoogle Scholar
  16. 16.
    Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kwonseung Shin
    • 1
  • Min Young Chung
    • 1
  • Jongho Won
    • 2
  • Hyunseung Choo
    • 1
  1. 1.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKorea
  2. 2.Electronics and Telecommunications Research InstituteDaejeonKorea

Personalised recommendations