E. Hyytiä and J. Virtamo, On Load Balancing in a Dense Wireless Multihop Network, in NGI 2006, 2nd Conference on Next Generation Internet Design and Engineering, pp. 72-79, 2006, València, Spain.
Abstract: We study the load balancing problem in a dense multihop network, where a typical path consists of large number of hops, i.e., the spatial scales of a typical distance between source and destination, and mean distance between the neighbouring nodes are strongly sepatated. In this limit, we present a general framework for analysing 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 an example of uniformly distributed traffic demands in a unit disk with a few families of paths given in advance. With these paths we are able to decrease the maximum traffic load by factor of 33-40\% depending on the assumptions. The obtained traffic load level comes quite near the tightest lower bound.
Links:
(C) 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
BibTeX entry:
@inproceedings{hyytia-ngi-2006,
author = {Esa Hyyti{\"a} and Jorma Virtamo},
title = {On Load Balancing in a Dense Wireless Multihop Network},
booktitle = {{NGI} 2006, 2nd Conference on Next Generation Internet Design and Engineering},
address = {Val{\`e}ncia, Spain},
year = {2006},
month = {Apr.},
pages = {72--79},
doiopt = {10.1109/NGI.2006.1678225},
}