How to discover optimal routes in wireless multihop networks

被引：0
作者：
Gerharz, M [1 ]
de Waal, C [1 ]
Martini, P [1 ]
机构：
[1] Univ Bonn, D-53117 Bonn, Germany
来源：
MOBILE AND WIRELESS COMMUNICATION NETWORKS | 2005年 / 162卷
关键词：
ad hoc networks; routing; quality-of-service; Dijkstra;
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
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.
引用
收藏
页码：323 / 334
页数：12
相关论文
共 12 条
  • [1] ASLAM J, 2003, AD HOC WIRELESS NETW, P1
  • [2] Distributed power control for energy efficient routing in ad hoc networks
    Bergamo, P
    Giovanardi, A
    Travasoni, A
    Maniezzo, D
    Mazzini, G
    Zorzi, M
    [J]. WIRELESS NETWORKS, 2004, 10 (01) : 29 - 42
  • [3] CHAKERES ID, 2003, 200318 UCSB
  • [4] CHO W, 2002, P 4 IEEE C MOB WIR C
  • [5] CORMEN T, 1990, INTRO ALGORITHMS, P514
  • [6] Dijkstra E.W., 1959, Numerische mathematik, V1, P269, DOI DOI 10.1007/BF01386390
  • [7] GERHARZ M, 2003, P 28 IEEE C LOC COMP
  • [8] Maximizable routing metrics
    Gouda, MG
    Schneider, M
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (04) : 663 - 675
  • [9] Gupta N, 2002, LECT NOTES COMPUT SC, V2571, P164
  • [10] Perkins C., 2001, AD HOC NETWORKING
12