### Abstract

Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and achieves a rate region that is in general nonconvex. We derive approximation ratios to the sum rate objective by studying the solutions to two related problems, sum rate maximization using an SIR approximation and max-min weighted SIR optimization. We also show that these two problems can be solved very efficiently, using much faster algorithms than the existing ones in the literature. Furthermore, using a new parameterization of the sum rate maximization problem, we obtain a characterization of the power controlled rate region and its convexity property in various asymptotic regimes. Engineering implications are discussed for IEEE 802.11 networks.

Original language | English (US) |
---|---|

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

Pages | 1350-1358 |

Number of pages | 9 |

DOIs | |

State | Published - Oct 12 2009 |

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

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

ISSN (Print) | 0743-166X |

### Other

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

Country | Brazil |

City | Rio de Janeiro |

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

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Fast algorithms and performance bounds for sum rate maximization in wireless networks'. Together they form a unique fingerprint.

## Cite this

*IEEE INFOCOM 2009 - The 28th Conference on Computer Communications*(pp. 1350-1358). [5062050] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2009.5062050