How to discover optimal routes in wireless multihop networks

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. © 2005 by International Federation for Information Processing.