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 条
  • [31] Throughput Performance and Fairness in Multihop Wireless Mesh Networks
    Gao, Mingsheng
    Jiang, Hui
    [J]. 2014 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), 2014, : 867 - 872
  • [32] Performance Evaluation of the Split Transmission in Multihop Wireless Networks
    Tu, Wanqing
    Grout, Vic
    [J]. FUTURE MULTIMEDIA NETWORKING, PROCEEDINGS, 2009, 5630 : 72 - 82
  • [33] Path Aggregation for Voice over IP in Multihop Wireless Mesh Networks
    Lu, Junxiu
    Tan, Kun
    Zhang, Qian
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 3990 - 3995
  • [34] Path selection and rate allocation for video streaming in multihop wireless networks
    Kompella, Sastry
    Mao, Shiwen
    Hou, Y. Thomas
    Sherali, Hanif D.
    [J]. MILCOM 2006, VOLS 1-7, 2006, : 2638 - +
  • [35] Multihop Transmission Opportunity in Wireless Multihop Networks
    Yu, Chansu
    Shen, Tianning
    Shin, Kang G.
    Lee, Jeong-Yoon
    Suh, Young-Joo
    [J]. 2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [36] Bandwidth Guaranteed Scheduling and Shortest Path Routing in Wireless Mesh Networks
    Zeng Ziming
    Zhang Liyi
    [J]. 2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 1705 - 1708
  • [37] Distributed Weighted Node Shortest Path Routing for Wireless Sensor Networks
    Yilmaz, Onur
    Erciyes, Kayhan
    [J]. RECENT TRENDS IN WIRELESS AND MOBILE NETWORKS, 2010, 84 : 304 - 314
  • [38] An Online Learning Approach to Shortest Path and Backpressure Routing in Wireless Networks
    Amar, Omer
    Sarfati, Ilana
    Cohen, Kobi
    [J]. IEEE ACCESS, 2023, 11 : 57253 - 57267
  • [39] Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
    Onwuegbuzie, Innocent Uzougbo
    Abd Razak, Shukor
    Isnin, Ismail Fauzi
    Al-dhaqm, Arafat
    Anuar, Nor Badrul
    [J]. PLOS ONE, 2022, 17 (03):
  • [40] An exact algorithm for minimum CDS with shortest path constraint in wireless networks
    Ling Ding
    Xiaofeng Gao
    Weili Wu
    Wonjun Lee
    Xu Zhu
    Ding-Zhu Du
    [J]. Optimization Letters, 2011, 5 : 297 - 306