Chung Shue Chen, K. Shum, C. Sung
{"title":"Round-robin power control for the weighted sum rate maximisation of wireless networks over multiple interfering links","authors":"Chung Shue Chen, K. Shum, C. Sung","doi":"10.1002/ett.1496","DOIUrl":null,"url":null,"abstract":"We study the weighted sum rate maximisation problem of wireless networks consisting of multiple source–destination pairs. The optimisation problem is to maximise a weighted sum of data rates by adjusting the power of each user. The problem is in general a non-convex optimisation problem that will lead to multiple local maxima. A Gauss–Seidel type iterative power control algorithm is presented. The proposed algorithm has the favourable properties that only simple operations are needed in each iteration and the convergence is fast. Performance investigation under some benchmark examples and different user densities has shown its effectiveness. A survey and comprehensive comparison with today’s best-known solutions is provided. Finally, we derive and prove some simple and interesting optimal binary power allocation strategies under special cases of the problem if the network can be represented by a certain approximation. Copyright © 2011 John Wiley & Sons, Ltd. *Correspondence","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"66 2 1","pages":"458-470"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Transactions on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ett.1496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33
多干扰链路无线网络加权和速率最大化的轮询功率控制
研究了由多个源-目的对组成的无线网络的加权和速率最大化问题。优化问题是通过调整每个用户的功率来最大化数据速率的加权总和。这个问题通常是一个会导致多个局部最大值的非凸优化问题。提出了一种高斯-塞德尔型迭代功率控制算法。该算法具有每次迭代操作简单、收敛速度快等优点。在一些基准示例和不同用户密度下的性能测试表明了该方法的有效性。提供了与当今最著名的解决方案的调查和全面比较。最后,在该问题的特殊情况下,如果网络可以用一定的近似表示,我们推导并证明了一些简单有趣的最优二元功率分配策略。版权所有©2011 John Wiley & Sons, Ltd. *通信
本文章由计算机程序翻译,如有差异,请以英文原文为准。