Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity (Synthesis Lectures on Communication Networks)

Ji, Bo,Lin, Xiaojun,Shroff, Ness B.

ISBN 10: 1627054618 / ISBN 13: 9781627054614

Published by Morgan & Claypool Publishers, 2016

About this Item

Fast Shipping - Safe and Secure 7 days a week!

Seller Inventory # 3TWOWA001M4L

Bibliographic Details

• Title: Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity (Synthesis Lectures on Communication Networks)
• Publisher: Morgan & Claypool Publishers
• Publication Date: 2016
• Language: English
• ISBN 10: 1627054618
• ISBN 13: 9781627054614
• Binding: paperback
• Condition: Very Good

About this title

Synopsis

The last decade has seen an unprecedented growth in the demand for wireless services. These services are fueled by applications that often require not only high data rates, but also very low latency to function as desired. However, as wireless networks grow and support increasingly large numbers of users, these control algorithms must also incur only low complexity in order to be implemented in practice. Therefore, there is a pressing need to develop wireless control algorithms that can achieve both high throughput and low delay, but with low-complexity operations. While these three performance metrics, i.e., throughput, delay, and complexity, are widely acknowledged as being among the most important for modern wireless networks, existing approaches often have had to sacrifice a subset of them in order to optimize the others, leading to wireless resource allocation algorithms that either suffer poor performance or are difficult to implement. In contrast, the recent results presented in this book demonstrate that, by cleverly taking advantage of multiple physical or virtual channels, one can develop new low-complexity algorithms that attain both provably high throughput and provably low delay. The book covers both the intra-cell and network-wide settings. In each case, after the pitfalls of existing approaches are examined, new systematic methodologies are provided to develop algorithms that perform provably well in all three dimensions.

About the Author

Temple University