Near-Optimal Load Balancing in Dense Wireless Multi-Hop Networks

This paper considers the load balancing problem in wireless multi-hop networks. In the limit of a dense network, there is a strong separation between the macroscopic and microscopic scales, and the load balancing problem can be formulated as finding continuous curves ("Routes") between all source-destination pairs that minimize the maximum of the so-called scalar packet flux ("Traffic load"). This paper re-formulates the problem by focusing entirely on the so-called d-flows (vector flow field of packets with a common destination x) and by looking at the equation these flows have to satisfy.