斯塔克伯格竞赛
聚类分析
计算机科学
资源配置
博弈论
数学优化
最优化问题
分布式计算
资源管理(计算)
干扰(通信)
计算复杂性理论
潜在博弈
纳什均衡
计算机网络
算法
数学
人工智能
频道(广播)
数理经济学
作者
Tinh T. Bui,Long D. Nguyen,Ha Hoang Kha,Nguyen‐Son Vo,Trung Q. Duong
出处
期刊:Sensors
[Multidisciplinary Digital Publishing Institute]
日期:2023-04-11
卷期号:23 (8): 3899-3899
被引量:2
摘要
In this study, we consider the combination of clustering and resource allocation based on game theory in ultra-dense networks that consist of multiple macrocells using massive multiple-input multiple-output and a vast number of randomly distributed drones serving as small-cell base stations. In particular, to mitigate the intercell interference, we propose a coalition game for clustering small cells, with the utility function being the ratio of signal to interference. Then, the optimization problem of resource allocation is divided into two subproblems: subchannel allocation and power allocation. We use the Hungarian method, which is efficient for solving binary optimization problems, to assign the subchannels to users in each cluster of small cells. Additionally, a centralized algorithm with low computational complexity and a distributed algorithm based on the Stackelberg game are provided to maximize the network energy efficiency (EE). The numerical results demonstrate that the game-based method outperforms the centralized method in terms of execution time in small cells and is better than traditional clustering in terms of EE.
科研通智能强力驱动
Strongly Powered by AbleSci AI