Tan, Chee Wei and Chiang, Mung and Srikant, R. (2009) Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks. In: INFOCOM 2009. IEEE , pp. 1350-1358. ISBN 978-1-4244-3512-8 http://resolver.caltech.edu/CaltechAUTHORS:20100512-085645280
- Published Version
Restricted to Repository administrators only
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100512-085645280
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.
|Item Type:||Book Section|
|Additional Information:||© 2009 IEEE. We acknowledge helpful discussions with Steven Low at Caltech and Kevin Tang at Cornell. This research has been supported in part by ONR grant N00014-07-1-0864 and NSF CNS 0720570.|
|Subject Keywords:||Duality; Distributed algorithm; Power control; Weighted sum rate maximization; Nonnegative matrices and applications; Nonconvex optimization; Wireless networks|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||16 May 2010 01:48|
|Last Modified:||26 Dec 2012 12:01|
Repository Staff Only: item control page