Robust Resource Allocation in Future Wireless Networks [electronic resource] /
By: Parsaeefard, Saeedeh [author.].
Contributor(s): Sharafat, Ahmad Reza [author.] | Mokari, Nader [author.] | SpringerLink (Online service).
Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017.Description: XIV, 245 p. 25 illus., 21 illus. in color. | Binding - Card Paper |.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319503899.Subject(s): EXTC Engineering
| Communications Engineering, Networks | Computer Communication NetworksDDC classification: 621.382 Online resources: Click here to access eBook in Springer Nature platform. (Within Campus only.)
In:
Springer Nature eBookSummary: This book presents state-of-the-art research on robust resource allocation in current and future wireless networks. The authors describe the nominal resource allocation problems in wireless networks and explain why introducing robustness in such networks is desirable. Then, depending on the objectives of the problem, namely maximizing the social utility or the per-user utility, cooperative or competitive approaches are explained and their corresponding robust problems are considered in detail. For each approach, the costs and benefits of robust schemes are discussed and the algorithms for reducing their costs and improving their benefits are presented. Considering the fact that such problems are inherently non-convex and intractable, a taxonomy of different relaxation techniques is presented, and applications of such techniques are shown via several examples throughout the book. Finally, the authors argue that resource allocation continues to be an important issue in future wireless networks, and propose specific problems for future research.
This book presents state-of-the-art research on robust resource allocation in current and future wireless networks. The authors describe the nominal resource allocation problems in wireless networks and explain why introducing robustness in such networks is desirable. Then, depending on the objectives of the problem, namely maximizing the social utility or the per-user utility, cooperative or competitive approaches are explained and their corresponding robust problems are considered in detail. For each approach, the costs and benefits of robust schemes are discussed and the algorithms for reducing their costs and improving their benefits are presented. Considering the fact that such problems are inherently non-convex and intractable, a taxonomy of different relaxation techniques is presented, and applications of such techniques are shown via several examples throughout the book. Finally, the authors argue that resource allocation continues to be an important issue in future wireless networks, and propose specific problems for future research.
There are no comments for this item.