Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908704468631552 |
|---|---|
| author | Zhao, Zhongyuan Ming, Yujun Swami, Ananthram Chan, Kevin Dagefu, Fikadu Segarra, Santiago |
| author_facet | Zhao, Zhongyuan Ming, Yujun Swami, Ananthram Chan, Kevin Dagefu, Fikadu Segarra, Santiago |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_09902 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks Zhao, Zhongyuan Ming, Yujun Swami, Ananthram Chan, Kevin Dagefu, Fikadu Segarra, Santiago Networking and Internet Architecture Distributed, Parallel, and Cluster Computing Systems and Control 05C12 (Primary) 05-08 (Secondary) C.2.2; C.2.1 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. |
| title | Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks |
| topic | Networking and Internet Architecture Distributed, Parallel, and Cluster Computing Systems and Control 05C12 (Primary) 05-08 (Secondary) C.2.2; C.2.1 |
| url | https://arxiv.org/abs/2512.09902 |