|
Books > Computing & IT > Computer communications & networking
|
Buy Now
Resource Allocation with Carrier Aggregation in Cellular Networks - Optimality and Spectrum Sharing using C++ and MATLAB (Paperback, Softcover reprint of the original 1st ed. 2018)
Loot Price: R4,783
Discovery Miles 47 830
|
|
|
Resource Allocation with Carrier Aggregation in Cellular Networks - Optimality and Spectrum Sharing using C++ and MATLAB (Paperback, Softcover reprint of the original 1st ed. 2018)
Expected to ship within 10 - 15 working days
|
This book introduces an efficient resource management approach for
future spectrum sharing systems. The book focuses on providing an
optimal resource allocation framework based on carrier aggregation
to allocate multiple carriers' resources efficiently among mobile
users. Furthermore, it provides an optimal traffic dependent
pricing mechanism that could be used by network providers to charge
mobile users for the allocated resources. The book provides
different resource allocation with carrier aggregation solutions,
for different spectrum sharing scenarios, and compares them. The
provided solutions consider the diverse quality of experience
requirement of multiple applications running on the user's
equipment since different applications require different
application performance. In addition, the book addresses the
resource allocation problem for spectrum sharing systems that
require user discrimination when allocating the network resources.
General
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!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
