Distributed Dynamic Resource Allocation for OFDMA-Based Cognitive Small Cell Networks Using a Regret-Matching Game Approach

Wei-Sheng Lai, Tsung‐Hui Chang, Ta-Sung LeeAdvances 2015 · DOI · OpenAlex

Abstract

Game theoretical approaches have been used to develop distributed resource allocation technologies for cognitive heterogeneous networks. In this chapter, we present a novel distributed resource allocation strategy for cognitive small cell networks based on orthogonal frequency-division multiple access. In particular, we consider a heterogeneous network consisting of macrocell networks overlaid with cognitive small cells that opportunistically access the available spectrum. We focus on a regret-matching game approach, aiming at maximizing the total throughput of the small cell network subject to cross-tier interference and quality of service (QoS) constraints. The regret-matching game approach exploits a regret procedure to learn the optimal resource allocation strategy from the regrets of the actions of cognitive users. Furthermore, the regret-matching game approach is extended to the joint resource allocation and user admission control problem. Numerical results are presented to demonstrate the effectiveness of the proposed regre-matching approaches.
BibTeX
@inproceedings{lai2015distributed,
  author = {Wei-Sheng Lai and Tsung‐Hui Chang and Ta-Sung Lee},
  title = {{Distributed Dynamic Resource Allocation for OFDMA-Based Cognitive Small Cell Networks Using a Regret-Matching Game Approach}},
  booktitle = {Advances},
  year = {2015},
  doi = {10.4018/978-1-4666-8642-7.ch009},
}

Loading related content...

Figure