TY - GEN
T1 - Joint Admission and Power Control for Big Data Access Management Using GAT
AU - Yang, Mengke
AU - Zhai, Daosen
AU - Zhang, Ruonan
AU - Cao, Haotong
AU - Cai, Lin
AU - Yu, F. Richard
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - The emerging artificial intelligence (AI) puts forward high requirement for big data acquisition, which is difficult to be met with the existing communication technologies in real time. In this paper, we investigate new graph learning based access management scheme for supporting the real-time big data acquisition in the sixth-generation mobile communication system (6G). We model the network scene with a mass of communication links as a fully connected graph which takes into account the accumulative interference of all links. Then, the joint admission and power control problem is formulated as a combinatorial optimization problem. We propose a graph attention network (GAT) based algorithm which can learn the system features by weighted aggregation of neighbor nodes. In addition, we construct a differentiable loss function that can accurately express the optimization objective and train the network by the change of loss. Based on the output of the GAT, we iteratively optimize the link admission and power to active more links. Simulation results demonstrate that the proposed algorithm is superior to the traditional convex optimization based algorithms and the nonmodified GAT based algorithms in the number of activated links. Moreover, the training of the constructed network is unsupervised with high computational efficiency, which makes them suitable for the big data access management.
AB - The emerging artificial intelligence (AI) puts forward high requirement for big data acquisition, which is difficult to be met with the existing communication technologies in real time. In this paper, we investigate new graph learning based access management scheme for supporting the real-time big data acquisition in the sixth-generation mobile communication system (6G). We model the network scene with a mass of communication links as a fully connected graph which takes into account the accumulative interference of all links. Then, the joint admission and power control problem is formulated as a combinatorial optimization problem. We propose a graph attention network (GAT) based algorithm which can learn the system features by weighted aggregation of neighbor nodes. In addition, we construct a differentiable loss function that can accurately express the optimization objective and train the network by the change of loss. Based on the output of the GAT, we iteratively optimize the link admission and power to active more links. Simulation results demonstrate that the proposed algorithm is superior to the traditional convex optimization based algorithms and the nonmodified GAT based algorithms in the number of activated links. Moreover, the training of the constructed network is unsupervised with high computational efficiency, which makes them suitable for the big data access management.
KW - admission control
KW - graph attention network
KW - machine learning
KW - massive connectivity
KW - Power control
UR - http://www.scopus.com/inward/record.url?scp=85187377199&partnerID=8YFLogxK
U2 - 10.1109/GLOBECOM54140.2023.10436993
DO - 10.1109/GLOBECOM54140.2023.10436993
M3 - 会议稿件
AN - SCOPUS:85187377199
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 4735
EP - 4740
BT - GLOBECOM 2023 - 2023 IEEE Global Communications Conference
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE Global Communications Conference, GLOBECOM 2023
Y2 - 4 December 2023 through 8 December 2023
ER -