How to Discover Optimal Routes in Wireless Multihop Networks

  • Michael Gerharz
  • Christian de Waal
  • Peter Martini
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)


In this paper, we introduce a distributed algorithm that is able to discover optimal routes in mobile wireless multihop networks using reactive routing protocols. The algorithm is based on Dijkstra’s shortest-path algorithm and maps the quality of a path to a delay of the corresponding route request to allow high-quality paths to surpass low-quality paths. With a proper selection of the delay mapping, this approach yields a low overhead and interoperable integration of maximisable routing metrics into existing protocols like AODV and DSR while keeping the route setup delay at a moderate level.


Ad hoc networks Routing Quality-of-Service Dijkstra 


  1. [Aslam et al., 2003]
    Aslam, J., Li, Q., and Rus, D. (2003). A lifetime-optimizing approach to routing messages in ad-hoc networks. In Cheng, X., Huang, X., and Du, D.-Z., editors, Ad Hoc Wireless Networking, pages 1–43. Kluwer Academic Publishers.Google Scholar
  2. [Bergamo et al., 2004]
    Bergamo, P., Giovanardi, A., Travasoni, A., Maniezzo, D., Mazzini, G., and Zorzi, M. (2004). Distributed power control for energy efficient routing in ad hoc networks. Wireless Networks, 10(1):29–42.CrossRefGoogle Scholar
  3. [Chakeres and Belding-Royer, 2003]
    Chakeres, I. D. and Belding-Royer, E. M. (2003). Resource biased path selection in heterogeneous mobile networks. Technical Report 2003-18, UCSB, Santa Barbara.Google Scholar
  4. [Cho and Kim, 2002]
    Cho, W. and Kim, S.-L. (2002). A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network. In Proc. 4th IEEE Conf. on Mobile and Wireless Communication (MWCN 2002).Google Scholar
  5. [Cormen et al., 1990]
    Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introdcution to Algorithms, chapter 25 Single-Source Shortest Paths, pages 514–527. The MIT Press.Google Scholar
  6. [Dijkstra, 1959]
    Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271.zbMATHMathSciNetCrossRefGoogle Scholar
  7. [Gerharz et al., 2003]
    Gerharz, M., de Waal, C., Martini, P., and James, P. (2003). Strategies for finding stable paths in mobile wireless ad hoc networks. In Proc. 28th IEEE Conf. on Local Computer Networks (LCN’03), Bonn, Germany.Google Scholar
  8. [Gouda and Schneider, 2003]
    Gouda, M. G. and Schneider, M. (2003). Maximizable routing metrics. IEEE/ACM Transactions on Networking, 11(4):663–675.CrossRefGoogle Scholar
  9. [Gupta and Das, 2002]
    Gupta, N. and Das, S. R. (2002). Energy-aware on-demand routing for mobile ad hoc networks. In Proc. 4th Intl. Workshop on Distributed Computing (IWDC 2002), pages 164–173.Google Scholar
  10. [Perkins, 2001]
    Perkins, C, editor (2001). Ad Hoc Networking. Addison-Wesley.Google Scholar
  11. [Tickoo et al., 2003]
    Tickoo, O., Raghunath, S., and Kalyanaraman, S. (2003). Route fragility: A novel metric for route selection in mobile ad hoc networks. In Proc. 11th IEEE Intl. Conf. on Networks (ICON 2003).Google Scholar
  12. [Tseng et al., 2002]
    Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., and Sheu, J.-P. (2002). The broadcast storm problem in a mobile ad hoc network. Wireless Networks, 8(2/3): 153–167.zbMATHCrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Michael Gerharz
    • 1
  • Christian de Waal
    • 1
  • Peter Martini
    • 1
  1. 1.University of BonnBonnGermany

Personalised recommendations