# Joint Task Offloading and Routing in Wireless Multi-hop Networks Using Biased Backpressure Algorithm

arXiv: https://arxiv.org/abs/2412.15385 · HTML: https://mlsanity.com/paper/2412.15385/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Dec 2024.

## Built on by (most cited first, 2 of 2)

- [Fast State-Augmented Learning for Wireless Resource Allocation with Dual Variable Regression](https://mlsanity.com/paper/2506.18748/) (2025)
- [A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking](https://mlsanity.com/paper/2512.10874/) (2025)

## Abstract (arXiv)

A significant challenge for computation offloading in wireless multi-hop networks is the complex interaction among traffic flows in the presence of interference. Existing approaches often ignore these key effects and/or rely on outdated queueing and channel state information. To fill these gaps, we reformulate joint offloading and routing as a routing problem on an extended graph with physical and virtual links. We adopt the state-of-the-art shortest path-biased Backpressure routing algorithm, which allows the destination and the route of a job to be dynamically adjusted at every time step based on network-wide long-term information and real-time states of local neighborhoods. In large networks, our approach achieves smaller makespan than existing approaches, such as separated Backpressure offloading and joint offloading and routing based on linear programming.