### 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 language | English (US) |
---|---|

Title of host publication | IEEE INFOCOM 2009 - The 28th Conference on Computer Communications |

Pages | 3001-3005 |

Number of pages | 5 |

DOIs | |

State | Published - 2009 |

Externally published | Yes |

Event | 28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil Duration: Apr 19 2009 → Apr 25 2009 |

### Other

Other | 28th Conference on Computer Communications, IEEE INFOCOM 2009 |
---|---|

Country | Brazil |

City | Rio de Janeiro |

Period | 4/19/09 → 4/25/09 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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 -