Weighted Sum-Rate Maximization in Wireless Networks

A Review
1. Auflage 2012
ISBN: 978-1-60198-582-8
Verlag: Now Publishers

Buch, Englisch, Band 17, 172 Seiten, Format (B × H): 156 mm x 234 mm

Reihe: Foundations and Trends® in Networking

The weighted sum-rate maximization (WSRMax) problem plays a central role in many network control and optimization methods, such as power control, link scheduling, cross-layer control, network utility maximization. The problem is NP-hard in general. In Weighted Sum-Rate Maximization in Wireless Networks: A Review, a cohesive discussion of the existing solution methods associated with the WSRMax problem, including global, fast local, as well as decentralized methods is presented. In addition, general optimization approaches, such as branch and bound methods, complementary geometric programming, and decomposition methods, are discussed in depth to address the problem. Through a number of numerical examples, the applicability of the resulting algorithms in various application domains is demonstrated. The presented algorithms and the associated numerical results can be very useful for network engineers or researchers with an interest in network design.

Autoren/Hrsg.

Weeraddana, Pradeep Chathuranga

Codreanu, Marian

Latva-aho, Matti

Ephremides, Anthony

Fischione, Carlo

Fachgebiete

• Technische Wissenschaften Elektronik | Nachrichtentechnik Nachrichten- und Kommunikationstechnik Drahtlostechnologie
• Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung Mobilfunk- und Drahtlosnetzwerke & Anwendungen

Inhaltsverzeichnis

1: Introduction 2: A branch and bound algorithm 3: Low complexity algorithms 4: A distributed approach 5: Conclusions. Appendix A: Improving upper bound for branch and bound via complementary geometric programming. Appendix B: The barrier method. Acknowledgements. Notations and Acronyms. References