SpringerOpen Newsletter

Receive periodic news and updates relating to SpringerOpen.

This article is part of the series Novel Techniques for Analysis and Design of Cross-Layer Optimized Wireless Sensor Networks.

Open Access Open Badges Research Article

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

Esa Hyytiä1* and Jorma Virtamo2

Author Affiliations

1 The Telecommunications Research Center Vienna (ftw.), Donau-City Strasse 1, Vienna 1220, Austria

2 Networking Laboratory, Helsinki University of Technology, P.O. Box 3000, 02015 TKK, Finland

For all author emails, please log on.

EURASIP Journal on Wireless Communications and Networking 2007, 2007:016932  doi:10.1155/2007/16932

The electronic version of this article is the complete one and can be found online at: http://jwcn.eurasipjournals.com/content/2007/1/016932

Received:29 September 2006
Accepted:13 March 2007
Published:15 May 2007

© 2007 Hyytiä and Virtamo

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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 by in comparison with the shortest-path routing.


  1. P Jacquet, Geometry of information propagation in massively dense ad hoc networks. Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '04), May 2004, Roppongi Hills, Tokyo, Japan, 157–162

  2. S Toumpis, L Tassiulas, Optimal deployment of large wireless sensor networks. IEEE Transactions on Information Theory 52(7), 2935–2953 (2006)

  3. S Toumpis, Optimal design and operation of massively dense wireless networks. Proceedings of Workshop on Interdisciplinary Systems Approach in Performance Evaluation and Design of Computer & Communication Systems (INTER-PERF '06), October 2006, Pisa, Italy

  4. E Hyytiä, J Virtamo, On load balancing in a dense wireless multihop network. Proceedings of the 2nd Conference on Next Generation Internet Design and Engineering (NGI '06), April 2006, València, Spain, 72–79

  5. B Sirkeci-Mergen, A Scaglione, A continuum approach to dense wireless networks with cooperation. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), March 2005, Miami, Fla, USA 4, 2755–2763

  6. PP Pham, S Perreau, Performance analysis of reactive shortest path and multi-path routing mechanism with load balance. Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03), March-April 2003, San Francisco, Calif, USA 1, 251–259

  7. Y Ganjali, A Keshavarzian, Load balancing in ad hoc networks: single-path routing vs. multi-path routing. Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), March 2004, Hong Kong 2, 1120–1125

  8. O Dousse, F Baccelli, P Thiran, Impact of interferences on connectivity in ad hoc networks. IEEE/ACM Transactions on Networking 13(2), 425–436 (2005)

  9. P Gupta, PR Kumar, The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000). Publisher Full Text OpenURL

  10. M Kalantari, M Shayman, Routing in wireless ad hoc networks by analogy to electrostatic theory. Proceedings of IEEE International Conference on Communications (ICC '04), June 2004, Paris, France 7, 4028–4033

  11. DB Johnson, DA Maltz, Dynamic source routing in ad hoc wireless networks. Mobile Computing (Kluwer Academic, Dordrecht, The Netherlands, 1996) 353, pp. 153–181 chapter Publisher Full Text OpenURL

  12. C Bettstetter, C Wagner, The spatial node distribution of the random waypoint mobility model. Proceedings of German Workshop on Mobile Ad Hoc Networks (WMAN '02), March 2002, Ulm, Germany, 41–58

  13. C Bettstetter, G Resta, P Santi, The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(3), 257–269 (2003). Publisher Full Text OpenURL

  14. W Navidi, T Camp, Stationary distributions for the random waypoint mobility model. IEEE Transactions on Mobile Computing 3(1), 99–108 (2004). Publisher Full Text OpenURL

  15. E Hyytiä, J Virtamo, Random waypoint mobility model in cellular networks. Wireless Networks 13(2), 177–188 (2007). Publisher Full Text OpenURL

  16. GI Bell, S Glasstone, Nuclear Reactor Theory (Van Nostrand Reinhold, New York, NY, USA, 1970)

  17. E Hyytiä, P Lassila, J Virtamo, Spatial node distribution of the random waypoint mobility model with applications. IEEE Transactions on Mobile Computing 5(6), 680–694 (2006)