Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks
By: Zhongyuan Zhao , Yujun Ming , Ananthram Swami and more
Backpressure (BP) routing and scheduling is an established resource allocation method for wireless multi-hop networks, noted for its fully distributed operation and maximum queue stability. Recent advances in shortest path-biased BP routing (SP-BP) mitigate shortcomings such as slow startup and random walks, yet exclusive link-level commodity selection still causes last-packet problem and bandwidth underutilization. By revisiting the Lyapunov drift theory underlying BP, we show that the legacy exclusive commodity selection is unnecessary, and propose a Maximum Utility (MaxU) link-sharing method to expand its performance envelope without increasing control message overhead. Numerical results show that MaxU SP-BP substantially mitigates the last-packet problem and slightly expands the network capacity region.
Similar Papers
Generalizing Biased Backpressure Routing and Scheduling to Wireless Multi-hop Networks with Advanced Air-interfaces
Networking and Internet Architecture
Improves wireless networks, sending data faster and smoother.
Bayesian Optimization for Non-Cooperative Game-Based Radio Resource Management
Signal Processing
Helps cell towers share internet fairly and fast.
Joint Scheduling and Multiflow Maximization in Wireless Networks
Information Theory
Makes future internet faster and smarter.