Load balancing by distributed optimisation in ad hoc networks

Reference:

André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, and Pekka Orponen. Load balancing by distributed optimisation in ad hoc networks. In J. Cao, I. Stojmenovic, X. Jia, and S. K. Das, editors, Proceedings of the 2nd International Conference on Mobile Ad-Hoc and Sensor Networks (MSN'06, Hong Kong, China, December 2006), volume 4325 of Lecture Notes in Computer Science, pages 873–884, Berlin Heidelberg, 2006. Springer-Verlag.

Abstract:

We approach the problem of load balancing for wireless multi-hop networks by distributed optimisation. As an example of a distributed optimisation algorithm for ad hoc networks, we use an approximation algorithm for minimising the maximum network congestion and implement it as a modification of the DSR routing protocol. The algorithm is based on shortest-path computations that are integrated into the DSR route discovery and maintenance process. Therefore, it does not rely on the dissemination of global information within the entire network. The simulation results obtained by the ns2 simulator show a gain of 14% to 69% in the throughput, depending on the setup, compared to DSR for a high network load.

Keywords:

sensor networks, ad hoc networks, routing, load balancing, distributed optimisation

Suggested BibTeX entry:

@inproceedings{SHSO06,
    address = {Berlin Heidelberg},
    author = {Andr\'e Schumacher and Harri Haanp\"a\"a and Satu Elisa Schaeffer and Pekka Orponen},
    booktitle = {Proceedings of the 2nd International Conference on Mobile Ad-Hoc and Sensor Networks (MSN'06, Hong Kong, China, December 2006)},
    editor = {J. Cao and I. Stojmenovic and X. Jia and S. K. Das},
    pages = {873--884},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Computer Science},
    title = {Load balancing by distributed optimisation in ad hoc networks},
    volume = {4325},
    year = {2006},
}