Performance of multihop wireless networks: Shortest path is not enough

被引:67
|
作者
De Couto, DSJ [1 ]
Aguayo, D [1 ]
Chambers, BA [1 ]
Morris, R [1 ]
机构
[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA
关键词
D O I
10.1145/774763.774776
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss rates low enough that the routing protocol is willing to use them, but high enough that much of the capacity is consumed by retransmissions. These observations suggest that more attention be paid to link quality when choosing ad hoc routes; the paper presents measured link characteristics likely to be useful in devising a better path quality metric.
引用
收藏
页码:83 / 88
页数:6
相关论文
共 50 条
  • [1] A shortest-path-based topology control algorithm in wireless multihop networks
    Shen, Yao
    Cai, Yunze
    Xu, Xiaoming
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (05) : 31 - 38
  • [2] The restricted shortest-path-based topology control algorithm in wireless multihop networks
    Shen, Yao
    Cai, Yunze
    Li, Xinyan
    Xu, Xiaoming
    [J]. IEEE COMMUNICATIONS LETTERS, 2007, 11 (12) : 937 - 939
  • [3] Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks
    Sangwoo Lee
    Chansik Park
    Min Joon Lee
    Sunwoo Kim
    [J]. EURASIP Journal on Wireless Communications and Networking, 2014
  • [4] On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
    Ying, Lei
    Shakkottai, Sanjay
    Reddy, Aneesh
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1674 - +
  • [5] Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks
    Lee, Sangwoo
    Park, Chansik
    Lee, Min Joon
    Kim, Sunwoo
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2014,
  • [6] On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
    Ying, Lei
    Shakkottai, Sanjay
    Reddy, Aneesh
    Liu, Shihuan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2011, 19 (03) : 841 - 854
  • [7] Planning wireless networks by shortest path
    Mannino, C.
    Mattia, S.
    Sassano, A.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2011, 48 (03) : 533 - 551
  • [8] Planning wireless networks by shortest path
    C. Mannino
    S. Mattia
    A. Sassano
    [J]. Computational Optimization and Applications, 2011, 48 : 533 - 551
  • [9] Understanding Path Reconstruction Algorithms in Multihop Wireless Networks
    Dong, Wei
    Cao, Chenhong
    Zhang, Xiaoyu
    Gao, Yi
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (01) : 1 - 14
  • [10] Neither Shortest Path Nor Dominating Set: Aggregation Scheduling by Greedy Growing Tree in Multihop Wireless Sensor Networks
    Tian, Chen
    Jiang, Hongbo
    Wang, Chonggang
    Wu, Zuodong
    Chen, Jinhua
    Liu, Wenyu
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2011, 60 (07) : 3462 - 3472