On Traffic Load Distribution and Load Balancing in Dense Wireless Multihop Networks

The authors study the load balancing problem in a dense wireless multi-hop network, where a typical path consists of a large number of hops, that is, the spatial scales of a typical distance between source and destination and mean distance between the neighboring nodes are strongly separated. In this limit, they present a general framework for analyzing the traffic load resulting from a given set of paths and traffic demands. They formulate the load balancing problem as a minmax problem and give two lower bounds for the achievable minimal maximum traffic load. The framework is illustrated by considering the load balancing problem of uniformly distributed traffic demands in a unit disk.