Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
复制标题
DOI：
10.1109/infcom.2009.5062050
复制
发表时间：
2009-04
期刊：
影响因子：
--
通讯作者：
C. Tan;M. Chiang;R. Srikant
中科院分区：
文献类型：
--
作者：
C. Tan;M. Chiang;R. Srikant
在无线网络中，通过功率控制实现总速率最大化是一个重要的、具有挑战性的和被广泛研究的问题。这是一个非凸优化问题，并实现了一般非凸的速率区域。我们通过研究两个相关问题的解决方案，使用SIR近似和最大-最小加权SIR优化的和速率最大化，得出近似比的和速率目标。我们还表明，这两个问题可以非常有效地解决，使用更快的算法比现有的文献。此外，使用一个新的参数化的和率最大化问题，我们得到的功率控制率区域的特征和它的凸性在各种渐近制度。IEEE 802.11网络的工程影响进行了讨论。
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.