How To Discover Optimal Routes in Wireless Multihop Networks

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...

Full description

Saved in:
Bibliographic Details
Published inMobile and Wireless Communication Networks pp. 323 - 334
Main Authors Al Agha, Khaldoun, Pujolle, G, Belding-Royer, Elizabeth M
Format Book Chapter
LanguageEnglish
Published United States Kluwer Academic Publishers 2005
Springer US
SeriesIFIP International Federation for Information Processing
Subjects
Ad hoc networks
Dijkstra
Quality-of-Service
Routing
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:This work was supported in part by NOKIA and the German Federal Ministry of Education & Research (BMBF) as part of the IPonAir project.
ISBN:038723148X
9780387231488
ISSN:1571-5736
DOI:10.1007/0-387-23150-1_28