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 条
  • [1] Biased Backpressure Routing Using Link Features and Graph Neural Networks
    Zhao, Zhongyuan
    Radojicic, Bojan
    Verma, Gunjan
    Swami, Ananthram
    Segarra, Santiago
    IEEE Transactions on Machine Learning in Communications and Networking, 2024, 2 : 1424 - 1439
  • [2] Loop-Free Backpressure Routing Using Link-Reversal Algorithms
    Rai, Anurag
    Li, Chih-ping
    Paschos, Georgios
    Modiano, Eytan
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (05) : 2988 - 3002
  • [3] Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks
    Mahfujul, K. M.
    Qu, Kaige
    Ye, Qiang
    Lu, Ning
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 3848 - 3853
  • [4] Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks
    Mahfujul, K. M.
    Qu, Kaige
    Ye, Qiang
    Lu, Ning
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2024, 11 (06): : 6605 - 6622
  • [5] Trust-based backpressure routing in wireless sensor networks
    Venkataraman, Revathi
    Moeller, Scott
    Krishnamachari, Bhaskar
    Rao, T. Rama
    INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2015, 17 (01) : 27 - 39
  • [6] Online Learning for Shortest Path and Backpressure Routing in Wireless Networks
    Amar, Omer
    Cohen, Kobi
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2702 - 2707
  • [7] Separation of Routing and Scheduling in Backpressure-Based Wireless Networks
    Seferoglu, Hulya
    Modiano, Eytan
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (03) : 1787 - 1800
  • [8] Towards Distributed and Dynamic Backpressure Routing for Wireless Mesh Networks
    Nunez-Martinez, Jose
    Mangues-Bafalluy, Josep
    Portoles-Comeras, Marc
    2011 IEEE 22ND INTERNATIONAL SYMPOSIUM ON PERSONAL INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2011, : 1803 - 1808
  • [9] Analyzing Backpressure Routing Interaction with TCP for Wireless Mesh Networks
    Kabou, Abdelbaset
    Nunez-Martinez, Jose
    Nouali-Taboudjemat, Nadia
    Nouali, Omar
    Mangues-Bafalluy, Josep
    2017 31ST INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN), 2017, : 537 - 542
  • [10] Optimal backpressure routing for wireless networks with multi-receiver diversity
    Neely, Michael J.
    2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-4, 2006, : 18 - 25