Distributed uplink power control for optimal SIR assignment in cellular data networks

Prashanth Hande, Sundeep Rangan, Mung Chiang, Xinzhou Wu

Research output: Contribution to journalArticle

Abstract

This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-Miljanic distributed power control can attain a given fixed and feasible SIR target. In data networks, however, SIR needs to be jointly optimized with transmit powers in wireless data networks. In the vast research literature since the mid-1990s, solutions to this joint optimization problem are either distributed but suboptimal, or optimal but centralized. For convex formulations of this problem, we report a distributed and optimal algorithm. The main issue that has been the research bottleneck is the complicated, coupled constraint set, and we resolve it through a re-parametrization via the left Perron Frobenius eigenvectors, followed by development of a locally computable ascent direction. A key step is 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 load-spillage characterization, we first develop a distributed algorithm that can achieve any Pareto-optimal SIR assignment, then a distributed algorithm that picks out a particular Pareto-optimal SIR assignment and the associated powers through utility maximization. Extensions to power-constrained and interference-constrained cases are carried out. The algorithms are theoretically sound and practically implementable: we present convergence and optimality proofs as well as simulations using 3GPP network and path loss models.

Original languageEnglish (US)
Pages (from-to)1420-1433
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number6
DOIs
StatePublished - 2008

Fingerprint

Parallel algorithms
Power control
Eigenvalues and eigenfunctions
Base stations
Wireless networks
Acoustic waves

Keywords

  • Cellular networks
  • Distributed algorithm
  • Optimization
  • Power control
  • Wireless networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software
  • Electrical and Electronic Engineering

Cite this

Distributed uplink power control for optimal SIR assignment in cellular data networks. / Hande, Prashanth; Rangan, Sundeep; Chiang, Mung; Wu, Xinzhou.

In: IEEE/ACM Transactions on Networking, Vol. 16, No. 6, 2008, p. 1420-1433.

Research output: Contribution to journalArticle

Hande, Prashanth ; Rangan, Sundeep ; Chiang, Mung ; Wu, Xinzhou. / Distributed uplink power control for optimal SIR assignment in cellular data networks. In: IEEE/ACM Transactions on Networking. 2008 ; Vol. 16, No. 6. pp. 1420-1433.
@article{046658f2aa2a4b3582fed82bb4eb05d3,
title = "Distributed uplink power control for optimal SIR assignment in cellular data networks",
abstract = "This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-Miljanic distributed power control can attain a given fixed and feasible SIR target. In data networks, however, SIR needs to be jointly optimized with transmit powers in wireless data networks. In the vast research literature since the mid-1990s, solutions to this joint optimization problem are either distributed but suboptimal, or optimal but centralized. For convex formulations of this problem, we report a distributed and optimal algorithm. The main issue that has been the research bottleneck is the complicated, coupled constraint set, and we resolve it through a re-parametrization via the left Perron Frobenius eigenvectors, followed by development of a locally computable ascent direction. A key step is 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 load-spillage characterization, we first develop a distributed algorithm that can achieve any Pareto-optimal SIR assignment, then a distributed algorithm that picks out a particular Pareto-optimal SIR assignment and the associated powers through utility maximization. Extensions to power-constrained and interference-constrained cases are carried out. The algorithms are theoretically sound and practically implementable: we present convergence and optimality proofs as well as simulations using 3GPP network and path loss models.",
keywords = "Cellular networks, Distributed algorithm, Optimization, Power control, Wireless networks",
author = "Prashanth Hande and Sundeep Rangan and Mung Chiang and Xinzhou Wu",
year = "2008",
doi = "10.1109/TNET.2008.918070",
language = "English (US)",
volume = "16",
pages = "1420--1433",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Distributed uplink power control for optimal SIR assignment in cellular data networks

AU - Hande, Prashanth

AU - Rangan, Sundeep

AU - Chiang, Mung

AU - Wu, Xinzhou

PY - 2008

Y1 - 2008

N2 - This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-Miljanic distributed power control can attain a given fixed and feasible SIR target. In data networks, however, SIR needs to be jointly optimized with transmit powers in wireless data networks. In the vast research literature since the mid-1990s, solutions to this joint optimization problem are either distributed but suboptimal, or optimal but centralized. For convex formulations of this problem, we report a distributed and optimal algorithm. The main issue that has been the research bottleneck is the complicated, coupled constraint set, and we resolve it through a re-parametrization via the left Perron Frobenius eigenvectors, followed by development of a locally computable ascent direction. A key step is 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 load-spillage characterization, we first develop a distributed algorithm that can achieve any Pareto-optimal SIR assignment, then a distributed algorithm that picks out a particular Pareto-optimal SIR assignment and the associated powers through utility maximization. Extensions to power-constrained and interference-constrained cases are carried out. The algorithms are theoretically sound and practically implementable: we present convergence and optimality proofs as well as simulations using 3GPP network and path loss models.

AB - This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-Miljanic distributed power control can attain a given fixed and feasible SIR target. In data networks, however, SIR needs to be jointly optimized with transmit powers in wireless data networks. In the vast research literature since the mid-1990s, solutions to this joint optimization problem are either distributed but suboptimal, or optimal but centralized. For convex formulations of this problem, we report a distributed and optimal algorithm. The main issue that has been the research bottleneck is the complicated, coupled constraint set, and we resolve it through a re-parametrization via the left Perron Frobenius eigenvectors, followed by development of a locally computable ascent direction. A key step is 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 load-spillage characterization, we first develop a distributed algorithm that can achieve any Pareto-optimal SIR assignment, then a distributed algorithm that picks out a particular Pareto-optimal SIR assignment and the associated powers through utility maximization. Extensions to power-constrained and interference-constrained cases are carried out. The algorithms are theoretically sound and practically implementable: we present convergence and optimality proofs as well as simulations using 3GPP network and path loss models.

KW - Cellular networks

KW - Distributed algorithm

KW - Optimization

KW - Power control

KW - Wireless networks

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

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

U2 - 10.1109/TNET.2008.918070

DO - 10.1109/TNET.2008.918070

M3 - Article

VL - 16

SP - 1420

EP - 1433

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

ER -