TY - GEN
T1 - Distributed uplink power control for optimal SIR assignment in cellular data networks
AU - Hande, Prashanth
AU - Rangan, Sundeep
AU - Chiang, Mung
PY - 2006
Y1 - 2006
N2 - The classical power control algorithms in wireless cellular networks have found wide applicability in attaining fixed SIR targets. This paper presents a distributed mechanism to jointly optimize SIR assignment and transmitted power in a multicellular network. Not all SIR assignments are feasible due to interference between mobile stations. We provide a new characterization of the feasible SIR region in terms of the loads on the base stations and an indication of the potential interference from mobile stations which we term spillage. Based on this characterization, we first develop a distributed algorithm that can achieve any Paretooptimal SIR assignment. Next, we pose the problem of maximizing a network-wide criterion as a utility maximization problem and present an algorithm that distributively optimizes the SIR assignment over the Pareto-optimal points. We overcome the bottleneck of centralized computation typically required for such an optimization of a network utility by exploiting the new load-spillage characterization. Extensions to power-constrained and interferenceconstrained cases are carried out. Convergence and optimality proofs as well as simulation examples using 3GPP uplink evaluation tools are presented.
AB - The classical power control algorithms in wireless cellular networks have found wide applicability in attaining fixed SIR targets. This paper presents a distributed mechanism to jointly optimize SIR assignment and transmitted power in a multicellular network. Not all SIR assignments are feasible due to interference between mobile stations. We provide a new characterization of the feasible SIR region in terms of the loads on the base stations and an indication of the potential interference from mobile stations which we term spillage. Based on this characterization, we first develop a distributed algorithm that can achieve any Paretooptimal SIR assignment. Next, we pose the problem of maximizing a network-wide criterion as a utility maximization problem and present an algorithm that distributively optimizes the SIR assignment over the Pareto-optimal points. We overcome the bottleneck of centralized computation typically required for such an optimization of a network utility by exploiting the new load-spillage characterization. Extensions to power-constrained and interferenceconstrained cases are carried out. Convergence and optimality proofs as well as simulation examples using 3GPP uplink evaluation tools are presented.
UR - http://www.scopus.com/inward/record.url?scp=39049106674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39049106674&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2006.248
DO - 10.1109/INFOCOM.2006.248
M3 - Conference contribution
AN - SCOPUS:39049106674
SN - 1424402212
SN - 9781424402212
T3 - Proceedings - IEEE INFOCOM
BT - Proceedings - INFOCOM 2006
T2 - INFOCOM 2006: 25th IEEE International Conference on Computer Communications
Y2 - 23 April 2006 through 29 April 2006
ER -