Robust Resource Allocation in Future Wireless Networks (Paperback, Softcover reprint of the original 1st ed. 2017)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Release date:	July 2018
First published:	2017
Authors:	Saeedeh Parsaeefard • Ahmad Reza Sharafat • Nader Mokari
Dimensions:	235 x 155 x 14mm (L x W x T)
Format:	Paperback
Pages:	245
Edition:	Softcover reprint of the original 1st ed. 2017
ISBN-13:	978-3-319-84388-9
Categories:	Books > Computing & IT > Internet > Network computers Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > General Promotions
LSN:	3-319-84388-5
Barcode:	9783319843889

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!