{"ID":2830841,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.09902","arxiv_id":"2512.09902","title":"Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks","abstract":"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.","short_abstract":"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 exclus...","url_abs":"https://arxiv.org/abs/2512.09902","url_pdf":"https://arxiv.org/pdf/2512.09902v1","authors":"[\"Zhongyuan Zhao\",\"Yujun Ming\",\"Ananthram Swami\",\"Kevin Chan\",\"Fikadu Dagefu\",\"Santiago Segarra\"]","published":"2025-12-10T18:32:23Z","proceeding":"cs.NI","tasks":"[\"cs.NI\",\"cs.DC\",\"eess.SY\"]","methods":"[]","has_code":false}