Dynamic Spectrum Scheduling for Carrier Aggregation: A Game Theoretic Approach

In this paper, the authors investigate the performance of the dynamic allocation of resources between separate cellular networks. They 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 duration. They derive the basic condition for which DI-CA can improve the performance for all the operators and then propose a Nash Bargaining Solution (NBS)-based spectrum scheduling scheme. Finally, they devise a distributed scheduling framework that uses a coalition formation with uncertainty, in which each independent operator can decide whether or not DI-CA can improve its performance without knowing the instantaneous information of others.

Provided by: University of Silesia Topic: Networking Date Added: Sep 2012 Format: PDF

Find By Topic