Game Theory-Based Radio Resource Optimization in Heterogeneous Small Cell Networks (HSCNs)

Author(s):  
Mugen Peng ◽  
Yaohua Sun ◽  
Chengdan Sun ◽  
Manzoor Ahmed

To optimize radio resource allocation, the game theory is utilized as a powerful tool because its characteristic can be adaptive to the distribution characteristics of in heterogeneous small cell networks (HSCNs). This chapter summarizes the recent achievements for the game theory based radio resource allocation in HSCNs, where macro base stations (MBSs) and dense small cell base stations (SBSs) share the same frequency spectrum and interfere with each other. Two kinds of game models are introduced to optimize the radio resource allocation, namely the non-cooperative Stackelberg and the cooperative coalition. System models, optimization problem formulation, problem solution, and simulation results for these two kinds of game models are presented. Particularly, the Stackelberg models for HSCNs are presented with the Stackelberg equilibrium and the closed-form expressions. The coalition formations for traditional HCSNs, cloud small cell networks, and heterogeneous cloud small cell networks are introduced. Simulation results are shown to demonstrate the proposed game theory based radio resource optimization strategies converged and efficient.

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1040
Author(s):  
Menghan Wei ◽  
Youjia Chen ◽  
Ming Ding

Unmanned aerial vehicles (UAVs), featured by the high-mobility and high-quality propagation environment, have shown great potential in wireless communication applications. In this paper, a novel UAV-aided small-cell content caching network is proposed and analyzed, where joint transmission (JT) is considered in the dense small-cell networks and mobile UAVs are employed to shorten the serving distance. The system performance is evaluated in terms of the average cache hit probability and the ergodic transmission rate. From the analytical results, we find that (i) the proposed UAV-aided small-cell network shows superior caching performance and, even with a small density of UAVs the system’s cache hit probability, can be improved significantly; (ii) the content’s optimal caching probability to maximize the cache hit probability is proportional to the (K+1)-th root of its request probability, where K is the number of small-cell base stations that serve each user by JT; (iii) caching the most popular content in UAVs may lead to a low transmission rate due to the limited resource offered by the low-density UAVs. Simulation results are presented to validate the theoretical results and the performance gain achieved by the optimal caching strategy.


Author(s):  
Wei-Sheng Lai ◽  
Tsung-Hui Chang ◽  
Ta-Sung Lee

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.


Sign in / Sign up

Export Citation Format

Share Document