期刊
IEEE COMMUNICATIONS LETTERS
卷 26, 期 9, 页码 2225-2229出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2022.3186350
关键词
Games; Massive MIMO; Interference; Uplink; System performance; Clustering algorithms; Nash equilibrium; Cell-free massive MIMO; AP~selection; local altruistic game; exact potential game
资金
- National Natural Science Foundation of China [62071485, 61901519, 62001513, 62171119]
- Basic Research Project of Jiangsu Province [BK 20192002]
- Natural Science Foundation of Jiangsu Province [BK 20201334, BK 20200579]
- National Key Research and Development Program of China [2020YFB1807201]
- Key Research and Development Plan of Jiangsu Province [BE2021013-3]
In this paper, we investigate the problem of user-centric access point (AP) selection for cell-free massive MIMO systems. We employ game theory to model the AP service cluster formation as a local altruistic game and propose an improved concurrent spatial adaptive play algorithm to achieve the optimal solution. Simulation results show that the proposed algorithm outperforms existing algorithms in terms of convergence speed, highlighting the superiority of the game-theoretic AP selection method.
In this letter, we investigate user-centric access point (AP) selection for cell-free massive multiple-input multiple-output (MIMO) systems. In contrast to existing works, we study this problem from the perspective of game theory and model user-centric AP service cluster formation as a local altruistic game, which is proven to be an exact potential game (EPG) and to have at least one pure Nash equilibrium (NE). Then, an improved maximum non-neighbor-set-based concurrent spatial adaptive play (MNSB-C-SAP) algorithm is proposed to achieve the NE. Simulation results show that the proposed algorithm outperforms existing algorithms in terms of convergence speed and verify the superiority of the game-theoretic AP selection method compared with some existing approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据