Abstract
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.
Keywords
This work was supported in part by NOKIA and the German Federal Ministry of Education & Research (BMBF) as part of the IPonAir project.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
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.
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.
Chakeres, I. D. and Belding-Royer, E. M. (2003). Resource biased path selection in heterogeneous mobile networks. Technical Report 2003-18, UCSB, Santa Barbara.
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).
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.
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271.
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.
Gouda, M. G. and Schneider, M. (2003). Maximizable routing metrics. IEEE/ACM Transactions on Networking, 11(4):663–675.
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.
Perkins, C, editor (2001). Ad Hoc Networking. Addison-Wesley.
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).
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Gerharz, M., de Waal, C., Martini, P. (2005). How to Discover Optimal Routes in Wireless Multihop Networks. In: Belding-Royer, E.M., Al Agha, K., Pujolle, G. (eds) Mobile and Wireless Communication Networks. MWCN 2004. IFIP International Federation for Information Processing, vol 162. Springer, Boston, MA. https://doi.org/10.1007/0-387-23150-1_28
Download citation
DOI: https://doi.org/10.1007/0-387-23150-1_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23148-8
Online ISBN: 978-0-387-23150-1
eBook Packages: Computer ScienceComputer Science (R0)