Dynamic Spectrum Scheduling for Carrier Aggregation: A Game Theoretic Approach
![Thumbnail](/themes/edepositireland/images/white_rectangle.jpeg)
File Type:
PDFItem Type:
Conference PaperDate:
2013Access:
OpenAccessCitation:
Y. Xiao, Y. Chau, P. di Francesco, and L. A. DaSilva, Dynamic Spectrum Scheduling for Carrier Aggregation: A Game Theoretic Approach, IEEE International Conference on Communications, IEEE International Conference on Communications, Budapest, Hungary, 9-13 June, 2013, 2672-2676Download Item:
Abstract:
In this paper, we investigate the performance of
the dynamic allocation of resources between separate
cellular networks. We propose a Dynamic Internetworking
Carrier Aggregation (DI-CA) framework which involves
every network operator releasing some of its exclusive, but
excess, spectrum to another network operator for a limited
time. We derive the basic condition for which DI-CA can
improve the performance for all the operators and then
propose a distributed scheduling framework that uses
coalition formation with uncertainty, in which each
independent operator can decide whether or not DI-CA can
improve its performance without having information
regarding channel conditions or load experienced by other
operators. We propose a distributed Bayesian coalition
formation algorithm to approach a neighborhood of the
Bayesian Nash equilibrium.
Sponsor
Grant Number
Science Foundation Ireland (SFI)
10/IN.1/I3007
Author's Homepage:
http://people.tcd.ie/dasilvalhttp://people.tcd.ie/difranp
Description:
PUBLISHEDArticle number 6654940
Budapest, Hungary
Author: DA SILVA, LUIZ; DI FRANCESCO, PAOLO
Sponsor:
Science Foundation Ireland (SFI)Other Titles:
IEEE International Conference on CommunicationsIEEE International Conference on Communications
Type of material:
Conference PaperAvailability:
Full text availableSubject (TCD):
TelecommunicationsDOI:
http://dx.doi.org/10.1109/ICC.2013.6654940Metadata
Show full item recordLicences: