TY - GEN
T1 - Learning Power Allocation for Cell-free Massive MIMO System with Graph Neural Networks
AU - Peng, Yao
AU - Liu, Tingting
AU - Yang, Chenyang
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Optimizing power allocation among access points (APs) is an effective way to improve the spectral efficiency of user-centric cell-free multi-antenna systems, where each user equipment (UE) associates with adjacent APs, leading to dynamic association relationship. The serving APs can adopt different beamforming strategies, say distributed beamforming (D-BF) and centralized beamforming (C-BF). Although D-BF requires lower fronthaul capacity than C-BF, it is unable to eliminate inter-AP interference. To reduce the high computational complexity of numerical algorithms for solving optimization problems, deep neural networks (DNNs) have been designed to learn the power allocation policies with D-BF, which however disregard the impact of dynamic association and are with high training complexity. Besides, there are no existing works to learn the power allocation policies with C-BF, where the power constraint of each AP needs to be satisfied. In this paper, we design graph neural networks (GNNs), including D-GNN and C-GNN, to learn the power allocation policies under D-BF and C-BF, respectively. For achieving high learning efficiency, these GNNs exploit the permutation properties of the optimal policies. The D-GNN is adaptive to dynamic association and the C-GNN can satisfy the per-AP power constraint. Simulation results show that the designed GNNs outperform the existing DNNs with low training complexity and short inference time, and are generalizable to the numbers of APs, antennas, and UEs.
AB - Optimizing power allocation among access points (APs) is an effective way to improve the spectral efficiency of user-centric cell-free multi-antenna systems, where each user equipment (UE) associates with adjacent APs, leading to dynamic association relationship. The serving APs can adopt different beamforming strategies, say distributed beamforming (D-BF) and centralized beamforming (C-BF). Although D-BF requires lower fronthaul capacity than C-BF, it is unable to eliminate inter-AP interference. To reduce the high computational complexity of numerical algorithms for solving optimization problems, deep neural networks (DNNs) have been designed to learn the power allocation policies with D-BF, which however disregard the impact of dynamic association and are with high training complexity. Besides, there are no existing works to learn the power allocation policies with C-BF, where the power constraint of each AP needs to be satisfied. In this paper, we design graph neural networks (GNNs), including D-GNN and C-GNN, to learn the power allocation policies under D-BF and C-BF, respectively. For achieving high learning efficiency, these GNNs exploit the permutation properties of the optimal policies. The D-GNN is adaptive to dynamic association and the C-GNN can satisfy the per-AP power constraint. Simulation results show that the designed GNNs outperform the existing DNNs with low training complexity and short inference time, and are generalizable to the numbers of APs, antennas, and UEs.
KW - cell-free
KW - centralized beamforming
KW - distributed beamforming
KW - graph neural network
KW - power allocation
UR - https://www.scopus.com/pages/publications/105000823235
U2 - 10.1109/GLOBECOM52923.2024.10901299
DO - 10.1109/GLOBECOM52923.2024.10901299
M3 - 会议稿件
AN - SCOPUS:105000823235
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 2653
EP - 2658
BT - GLOBECOM 2024 - 2024 IEEE Global Communications Conference
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE Global Communications Conference, GLOBECOM 2024
Y2 - 8 December 2024 through 12 December 2024
ER -