Weighted sum-rate maximization in wireless networks: A review
2011 (English)In: Foundations and Trends in Networking, ISSN 1554-057X, Vol. 6, no 1-2, 1-163 p.Article, review/survey (Refereed) Published
A wide variety of resource management problems of recent interest, including power/rate control, link scheduling, cross-layer control, network utility maximization, beamformer design of multiple-input multiple-output networks, and many others are directly or indirectly reliant on the weighted sum-rate maximization (WSRMax) problem. In general, this problem is very difficult to solve and is NP-hard. In this review, we provide a cohesive discussion of the existing solution methods associated with the WSRMax problem, including global, fast local, as well as decentralized methods. We also discuss in depth the applications of general optimization techniques, such as branch and bound methods, homotopy methods, complementary geometric programming, primal decomposition methods, subgradient methods, and sequential approximation strategies, in order to develop algorithms for the WSRMax problem. We show, through a number of numerical examples, the applicability of these algorithms in various application domains.
Place, publisher, year, edition, pages
2011. Vol. 6, no 1-2, 1-163 p.
Beamformer design, Cross-layer, Decomposition methods, Geometric programming, Homotopy method, Link scheduling, Network utility maximization, NP-hard, Numerical example, Optimization techniques, Resource management problems, Sequential approximation, Solution methods, Subgradient methods, Weighted sum-rate, Branch and bound method, MIMO systems, Approximation algorithms
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-148716DOI: 10.1561/1300000036ScopusID: 2-s2.0-84871184153OAI: oai:DiVA.org:kth-148716DiVA: diva2:751459
QC 201410012014-10-012014-08-112014-10-01Bibliographically approved