Fast algorithms and performance bounds for sum rate maximization in wireless networks

Chee Wei Tan, Mung Chiang, R. Srikant

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

44 Scopus citations


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 languageEnglish (US)
Title of host publicationIEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Number of pages9
StatePublished - 2009
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X


Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CityRio de Janeiro

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Electrical and Electronic Engineering


  • Distributed algorithm
  • Duality
  • Nonconvex optimization
  • Nonnegative matrices and applications
  • Power control
  • Weighted sum rate maximization
  • Wireless networks


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