2023/10/06 by Zhongyuan Zhao, Gunjan Verma, Zhao, Zhongyuan +5 · 1 citation
Computer Science · #05C90 #C.2.1 #C.2.2 #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Electrical engineering #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Signal Processing (eess.SP) #Wireless Networks and Protocols #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2310.04364
openalex publication_date 2023/10/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.