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

TL;DR

This paper proposes a novel joint offloading and routing algorithm for wireless multi-hop networks that dynamically adapts to network conditions, improving efficiency over existing methods by considering interference and real-time information.

Contribution

It introduces a reformulation of offloading and routing as a graph problem and applies a biased Backpressure algorithm for dynamic, interference-aware decision making.

Findings

Achieves smaller makespan in large networks compared to existing methods.

Effectively accounts for interference and real-time network states.

Outperforms linear programming-based approaches in simulations.

Abstract

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.