Abstract
In a dynamic environment, call arrivals and departures in different service areas may trigger reallocations for all MTs in service. In a decentralized architecture, this is translated to a heavy signalling overhead between the MTs and different BSs/APs with every call arrival and/or departure in any service area. Hence, the main challenge is how to develop an efficient decentralized radio resource allocation mechanism that reduces the associated signalling overhead with call arrivals and departures. In this chapter, concepts of call traffic load prediction and network cooperation are introduced to address the challenges that face the decentralized resource allocation in a dynamic environment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This is apart from the required overhead in broadcasting the fixed link access price value \(\widehat{\lambda }_{ns}\) by every BS/AP on its ID beacon. However, the contribution of broadcasting this value to the overhead is negligible.
- 2.
In Table 3.1, \(\widehat{\lambda }_{ns}\) is replaced by the updated link access price value the MT receives during \(T_{j+1}\).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 The Author(s)
About this chapter
Cite this chapter
Ismail, M., Zhuang, W. (2013). Prediction Based Resource Allocation. In: Cooperative Networking in a Heterogeneous Wireless Medium. SpringerBriefs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7079-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7079-3_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7078-6
Online ISBN: 978-1-4614-7079-3
eBook Packages: Computer ScienceComputer Science (R0)