Round‐robin power control for the weighted sum rate maximisation of wireless networks over multiple interfering links

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.