Iterative water-filling for load-balancing in wireless LAN or microcellular networks

Jeremy K. Chen, Theodore S. Rappaport, Gustavo De Veciana

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an efficient iterative load-balancing algorithm for time and bandwidth allocation among access points (APs) and users subject to heterogeneous fairness and application requirements. The algorithm can be carried out either at a central network switch with site-specific propagation predictions, or in a decentralized manner. The algorithm converges to maximum network resource utilization from any starting point, and usually converges in 3 to 9 iterations in various network conditions including users joining, leaving, and moving within a network and various network sizes. Such a fast convergence allows real-time implementations of our algorithm. Simulation results show that our algorithm has merits over other schemes especially when users exhibit clustered patterns: Our algorithm, when assuming multiple radios at each user, achieves 48% gain of median throughput as compared with the max-min fair load-balancing scheme (also with the multi-radio assumption) while losing 14% of fairness index; we also achieve 26% gain of median throughput and 52% gain of fairness index over the Strongest-Signal-First scheme (which assumes each user has only a single radio). When only a single radio is used, our algorithm is similar to the max-min fairness scheme, and is still better than SSF with 44% gain of 25-percentile throughput and 37% gain of fairness index.

Original languageEnglish (US)
Title of host publication2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings
Pages117-121
Number of pages5
Volume1
StatePublished - 2006
Event2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia
Duration: May 7 2006Jul 10 2006

Other

Other2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring
CountryAustralia
CityMelbourne
Period5/7/067/10/06

Fingerprint

Local area networks
Resource allocation
Water
Throughput
Frequency allocation
Radio receivers
Joining
Switches

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Chen, J. K., Rappaport, T. S., & De Veciana, G. (2006). Iterative water-filling for load-balancing in wireless LAN or microcellular networks. In 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings (Vol. 1, pp. 117-121). [1682787]

Iterative water-filling for load-balancing in wireless LAN or microcellular networks. / Chen, Jeremy K.; Rappaport, Theodore S.; De Veciana, Gustavo.

2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. Vol. 1 2006. p. 117-121 1682787.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, JK, Rappaport, TS & De Veciana, G 2006, Iterative water-filling for load-balancing in wireless LAN or microcellular networks. in 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. vol. 1, 1682787, pp. 117-121, 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring, Melbourne, Australia, 5/7/06.
Chen JK, Rappaport TS, De Veciana G. Iterative water-filling for load-balancing in wireless LAN or microcellular networks. In 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. Vol. 1. 2006. p. 117-121. 1682787
Chen, Jeremy K. ; Rappaport, Theodore S. ; De Veciana, Gustavo. / Iterative water-filling for load-balancing in wireless LAN or microcellular networks. 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. Vol. 1 2006. pp. 117-121
@inproceedings{aad54b95d5b54709a8ab8c1aef44f990,
title = "Iterative water-filling for load-balancing in wireless LAN or microcellular networks",
abstract = "This paper presents an efficient iterative load-balancing algorithm for time and bandwidth allocation among access points (APs) and users subject to heterogeneous fairness and application requirements. The algorithm can be carried out either at a central network switch with site-specific propagation predictions, or in a decentralized manner. The algorithm converges to maximum network resource utilization from any starting point, and usually converges in 3 to 9 iterations in various network conditions including users joining, leaving, and moving within a network and various network sizes. Such a fast convergence allows real-time implementations of our algorithm. Simulation results show that our algorithm has merits over other schemes especially when users exhibit clustered patterns: Our algorithm, when assuming multiple radios at each user, achieves 48{\%} gain of median throughput as compared with the max-min fair load-balancing scheme (also with the multi-radio assumption) while losing 14{\%} of fairness index; we also achieve 26{\%} gain of median throughput and 52{\%} gain of fairness index over the Strongest-Signal-First scheme (which assumes each user has only a single radio). When only a single radio is used, our algorithm is similar to the max-min fairness scheme, and is still better than SSF with 44{\%} gain of 25-percentile throughput and 37{\%} gain of fairness index.",
author = "Chen, {Jeremy K.} and Rappaport, {Theodore S.} and {De Veciana}, Gustavo",
year = "2006",
language = "English (US)",
isbn = "0780393929",
volume = "1",
pages = "117--121",
booktitle = "2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings",

}

TY - GEN

T1 - Iterative water-filling for load-balancing in wireless LAN or microcellular networks

AU - Chen, Jeremy K.

AU - Rappaport, Theodore S.

AU - De Veciana, Gustavo

PY - 2006

Y1 - 2006

N2 - This paper presents an efficient iterative load-balancing algorithm for time and bandwidth allocation among access points (APs) and users subject to heterogeneous fairness and application requirements. The algorithm can be carried out either at a central network switch with site-specific propagation predictions, or in a decentralized manner. The algorithm converges to maximum network resource utilization from any starting point, and usually converges in 3 to 9 iterations in various network conditions including users joining, leaving, and moving within a network and various network sizes. Such a fast convergence allows real-time implementations of our algorithm. Simulation results show that our algorithm has merits over other schemes especially when users exhibit clustered patterns: Our algorithm, when assuming multiple radios at each user, achieves 48% gain of median throughput as compared with the max-min fair load-balancing scheme (also with the multi-radio assumption) while losing 14% of fairness index; we also achieve 26% gain of median throughput and 52% gain of fairness index over the Strongest-Signal-First scheme (which assumes each user has only a single radio). When only a single radio is used, our algorithm is similar to the max-min fairness scheme, and is still better than SSF with 44% gain of 25-percentile throughput and 37% gain of fairness index.

AB - This paper presents an efficient iterative load-balancing algorithm for time and bandwidth allocation among access points (APs) and users subject to heterogeneous fairness and application requirements. The algorithm can be carried out either at a central network switch with site-specific propagation predictions, or in a decentralized manner. The algorithm converges to maximum network resource utilization from any starting point, and usually converges in 3 to 9 iterations in various network conditions including users joining, leaving, and moving within a network and various network sizes. Such a fast convergence allows real-time implementations of our algorithm. Simulation results show that our algorithm has merits over other schemes especially when users exhibit clustered patterns: Our algorithm, when assuming multiple radios at each user, achieves 48% gain of median throughput as compared with the max-min fair load-balancing scheme (also with the multi-radio assumption) while losing 14% of fairness index; we also achieve 26% gain of median throughput and 52% gain of fairness index over the Strongest-Signal-First scheme (which assumes each user has only a single radio). When only a single radio is used, our algorithm is similar to the max-min fairness scheme, and is still better than SSF with 44% gain of 25-percentile throughput and 37% gain of fairness index.

UR - http://www.scopus.com/inward/record.url?scp=34047149299&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34047149299&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:34047149299

SN - 0780393929

SN - 9780780393929

VL - 1

SP - 117

EP - 121

BT - 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings

ER -