Enhanced Backpressure Routing Using Wireless Link Features

被引:0
|
作者
Zhao, Zhongyuan [1 ]
Verma, Gunjan [2 ]
Swami, Ananthram [2 ]
Segarra, Santiago [1 ]
机构
[1] Rice Univ, Houston, TX 77251 USA
[2] US Armys DEVCOM Army Res Lab, Adelphi, MD USA
关键词
Backpressure routing; resource allocation; shortest path distance; queue length; sojourn time; delay-aware routing;
D O I
10.1109/CAMSAP58249.2023.10403470
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Backpressure (BP) routing is a well-established framework for distributed routing and scheduling in wireless multi-hop networks. However, the basic BP scheme suffers from poor end-to-end delay due to the drawbacks of slow startup, random walk, and the last packet problem. Biased BP with shortest path awareness can address the first two drawbacks, and sojourn time-based backlog metrics were proposed for the last packet problem. Furthermore, these BP variations require no additional signaling overhead in each time step compared to the basic BP. In this work, we further address three long-standing challenges associated with the aforementioned low-cost BP variations, including optimal scaling of the biases, bias maintenance under mobility, and incorporating sojourn time awareness into biased BP. Our analysis and experimental results show that proper scaling of biases can be achieved with the help of common link features, which can effectively reduce end-to-end delay of BP by mitigating the random walk of packets under low-to-medium traffic, including the last packet scenario. In addition, our low-overhead bias maintenance scheme is shown to be effective under mobility, and our bio-inspired sojourn time-aware backlog metric is demonstrated to be more efficient and effective for the last packet problem than existing approaches when incorporated into biased BP.
引用
收藏
页码:271 / 275
页数:5
相关论文
共 50 条
  • [31] Transmission-efficient routing in wireless networks using link-state information
    Garcia-Luna-Aceves, JJ
    Spohn, M
    MOBILE NETWORKS & APPLICATIONS, 2001, 6 (03): : 223 - 238
  • [32] QoS Routing and Link Scheduling in Wireless Mesh Backbone
    Abdelkader, Tamer
    Abdrabou, Atef
    Zhuang, Weihua
    2008 THIRD INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1-3, 2008, : 582 - 587
  • [33] Link state opportunistic routing for multihop wireless networks
    Cédric Gueguen
    Philippe Fabian
    Xavier Lagrange
    Wireless Networks, 2019, 25 : 3983 - 3998
  • [34] Link state opportunistic routing for multihop wireless networks
    Gueguen, Cedric
    Fabian, Philippe
    Lagrange, Xavier
    WIRELESS NETWORKS, 2019, 25 (07) : 3983 - 3998
  • [35] Optimal power, throughput and routing for wireless link arrays
    Baccelli, Francois
    Bambos, Nicholas
    Chan, Carri
    25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, : 1374 - 1385
  • [36] Routing Without Routes: The Backpressure Collection Protocol
    Moeller, Scott
    Sridharan, Avinash
    Krishnamachari, Bhaskar
    Gnawali, Omprakash
    PROCEEDINGS OF THE 9TH ACM/IEEE INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS, 2010, : 279 - 290
  • [37] Backpressure-based Routing Protocol for DTNs
    Dvir, Amit
    Vasilakos, Athanasios V.
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) : 405 - 406
  • [38] Performance Scaling of Wireless Sensor Network by Using Enhanced OMRA Routing Algorithm
    Dhaigude, Tanaji
    Parthiban, Latha
    Kokare, Avinash
    COMPUTING, COMMUNICATION AND SIGNAL PROCESSING, ICCASP 2018, 2019, 810 : 233 - 243
  • [39] Securing the Backpressure Algorithm for Wireless Networks
    Lu, Zhuo
    Sagduyu, Yalin E.
    Li, Jason H.
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017, 16 (04) : 1136 - 1148
  • [40] TCP-Aware Backpressure Routing and Scheduling
    Seferoglu, Hulya
    Modiano, Eytan
    2014 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2014, : 477 - 485