On traffic load distribution and load balancing in dense wireless multihop networks

Esa Hyytiä, Jorma Virtamo

Research output: Contribution to journalArticleScientificpeer-review

38 Citations (Scopus)
128 Downloads (Pure)


We study the load balancing problem in a dense wireless multihop 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, we present a general framework for analyzing the traffic load resulting from a given set of paths and traffic demands. We 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. For this special case, we derive efficient expressions for computing the resulting traffic load for a given set of paths. By using these expressions, we are able to optimize a parameterized set of paths yielding a particularly flat traffic load distribution which decreases the maximum traffic load in the network byOpen image in new window in comparison with the shortest-path routing.
Original languageEnglish
Article number016932
Pages (from-to)1-15
JournalEURASIP Journal on Wireless Communications and Networking
Publication statusPublished - 2007
MoE publication typeA1 Journal article-refereed

Fingerprint Dive into the research topics of 'On traffic load distribution and load balancing in dense wireless multihop networks'. Together they form a unique fingerprint.

Cite this