- We will send in 10–14 business days.
/images/books/11350133/9781601985828.jpg)
- Author: Pradeep Chathuranga Weeraddana
- Publisher: Now Publishers
- ISBN-10: 1601985827
- ISBN-13: 9781601985828
- Format: 15.6 x 23.4 x 0.9 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Weighted Sum-Rate Maximization in Wireless Networks (e-book) (used book) | bookbook.eu
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.15:03:28
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Pradeep Chathuranga Weeraddana
- Publisher: Now Publishers
- ISBN-10: 1601985827
- ISBN-13: 9781601985828
- Format: 15.6 x 23.4 x 0.9 cm, minkšti viršeliai
- Language: English English
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.
Reviews