α-optimal user association and cell load balancing in wireless networks

Authors:
Hongseok Kim;Gustavo de Veciana;Xiangying Yang;Muthaiah Venkatachalam
Affiliations:
Department of Electrical and Computer Engineering, The University of Texas at Austin;Department of Electrical and Computer Engineering, The University of Texas at Austin;Intel Corporation;Intel Corporation
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 5
Cited 0

Statistical bandwidth sharing: a study of congestion at flow level

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Congestion at flow level and the impact of user behaviour

Computer Networks: The International Journal of Computer and Telecommunications Networking
Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Proceedings of the 10th annual international conference on Mobile computing and networking
Dynamic association for load balancing and interference avoidance in multi-cell networks

IEEE Transactions on Wireless Communications
Distributed load-balancing in a multi-carrier wireless system

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a framework for user association in infrastructure-based wireless networks, specifically focused on flow-level cell load balancing under spatially inhomogeneous traffic distributions. Our work encompasses several different user association policies: rate-optimal, throughput-optimal, delay-optimal, and load-equalizing, which we collectively denote α-optimal user association. We prove that the optimal load vector ρ* that minimizes a generalized system performance function is the fixed point of a certain mapping. Based on this mapping we propose and analyze an iterative distributed user association policy that adapts to spatial traffic loads and converges to a globally optimal allocation.