Distributed non-autonomous power control through distributed convex optimization

S. Sundhar Ram, V. V. Veeravalli, Angelia Nedich

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

48 Citations (Scopus)

Abstract

We consider the uplink power control problem where mobile users in different cells are communicating with their base stations. We formulate the power control problem as the minimization of a sum of convex functions. Each component function depends on the channel coefficients from all the mobile users to a specific base station and is assumed to be known only to that base station (only CSIR). We then view the power control problem as a distributed optimization problem that is to be solved by the base stations and propose convergent, distributed and iterative power control algorithms. These algorithms require each base station to communicate with the base stations in its neighboring cells in each iteration and are hence non-autonomous. Since the base stations are connected through a wired backbone the communication overhead is not an issue. The convergence of the algorithms is shown theoretically and also verified through numerical simulations.

Original languageEnglish (US)
Title of host publicationIEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Pages3001-3005
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period4/19/094/25/09

Fingerprint

Convex optimization
Power control
Base stations
Communication
Computer simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Ram, S. S., Veeravalli, V. V., & Nedich, A. (2009). Distributed non-autonomous power control through distributed convex optimization. In IEEE INFOCOM 2009 - The 28th Conference on Computer Communications (pp. 3001-3005). [5062275] https://doi.org/10.1109/INFCOM.2009.5062275

Distributed non-autonomous power control through distributed convex optimization. / Ram, S. Sundhar; Veeravalli, V. V.; Nedich, Angelia.

IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. 2009. p. 3001-3005 5062275.

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

Ram, SS, Veeravalli, VV & Nedich, A 2009, Distributed non-autonomous power control through distributed convex optimization. in IEEE INFOCOM 2009 - The 28th Conference on Computer Communications., 5062275, pp. 3001-3005, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 4/19/09. https://doi.org/10.1109/INFCOM.2009.5062275
Ram SS, Veeravalli VV, Nedich A. Distributed non-autonomous power control through distributed convex optimization. In IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. 2009. p. 3001-3005. 5062275 https://doi.org/10.1109/INFCOM.2009.5062275
Ram, S. Sundhar ; Veeravalli, V. V. ; Nedich, Angelia. / Distributed non-autonomous power control through distributed convex optimization. IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. 2009. pp. 3001-3005
@inproceedings{00dec6d508ed49b7a5fe0a7b1339b3e7,
title = "Distributed non-autonomous power control through distributed convex optimization",
abstract = "We consider the uplink power control problem where mobile users in different cells are communicating with their base stations. We formulate the power control problem as the minimization of a sum of convex functions. Each component function depends on the channel coefficients from all the mobile users to a specific base station and is assumed to be known only to that base station (only CSIR). We then view the power control problem as a distributed optimization problem that is to be solved by the base stations and propose convergent, distributed and iterative power control algorithms. These algorithms require each base station to communicate with the base stations in its neighboring cells in each iteration and are hence non-autonomous. Since the base stations are connected through a wired backbone the communication overhead is not an issue. The convergence of the algorithms is shown theoretically and also verified through numerical simulations.",
author = "Ram, {S. Sundhar} and Veeravalli, {V. V.} and Angelia Nedich",
year = "2009",
doi = "10.1109/INFCOM.2009.5062275",
language = "English (US)",
isbn = "9781424435135",
pages = "3001--3005",
booktitle = "IEEE INFOCOM 2009 - The 28th Conference on Computer Communications",

}

TY - GEN

T1 - Distributed non-autonomous power control through distributed convex optimization

AU - Ram, S. Sundhar

AU - Veeravalli, V. V.

AU - Nedich, Angelia

PY - 2009

Y1 - 2009

N2 - We consider the uplink power control problem where mobile users in different cells are communicating with their base stations. We formulate the power control problem as the minimization of a sum of convex functions. Each component function depends on the channel coefficients from all the mobile users to a specific base station and is assumed to be known only to that base station (only CSIR). We then view the power control problem as a distributed optimization problem that is to be solved by the base stations and propose convergent, distributed and iterative power control algorithms. These algorithms require each base station to communicate with the base stations in its neighboring cells in each iteration and are hence non-autonomous. Since the base stations are connected through a wired backbone the communication overhead is not an issue. The convergence of the algorithms is shown theoretically and also verified through numerical simulations.

AB - We consider the uplink power control problem where mobile users in different cells are communicating with their base stations. We formulate the power control problem as the minimization of a sum of convex functions. Each component function depends on the channel coefficients from all the mobile users to a specific base station and is assumed to be known only to that base station (only CSIR). We then view the power control problem as a distributed optimization problem that is to be solved by the base stations and propose convergent, distributed and iterative power control algorithms. These algorithms require each base station to communicate with the base stations in its neighboring cells in each iteration and are hence non-autonomous. Since the base stations are connected through a wired backbone the communication overhead is not an issue. The convergence of the algorithms is shown theoretically and also verified through numerical simulations.

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

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

U2 - 10.1109/INFCOM.2009.5062275

DO - 10.1109/INFCOM.2009.5062275

M3 - Conference contribution

SN - 9781424435135

SP - 3001

EP - 3005

BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications

ER -