{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/heterogeneous-graph-neural-network-for-power","title":"Heterogeneous graph neural network for power allocation in multicarrier-division duplex cell-free massive MIMO systems","arxiv_id":"2205.00546","date":"2022-05-01","proceeding":null,"authors":["Bohan Li","Lie-Liang Yang","Robert G Maunder","Songlin Sun","Pei Xiao"],"abstract":"In-band full duplex cell-free (CF) systems suffer from severe self-interference and cross-link interference, especially when CF systems are operated in distributed way. To this end, we propose the multicarrier-division duplex as an enabler for achieving full-duplex operation in the distributed CF massive MIMO systems, where downlink and uplink transmissions occur simultaneously in the same frequency band but on the mutually orthogonal subcarriers. To maximize the spectral-efficiency (SE), we introduce a heterogeneous graph neural network (HGNN) specific for CF systems, referred to as CF-HGNN, to optimize the power-allocation (PA). We design the adaptive node embedding layer for CF-HGNN to be scalable to the various numbers of access points (APs), mobile stations (MSs) and subcarriers. The attention mechanism of CF-HGNN enables individual AP/MS nodes to aggregate information from the interfering and communication paths with different priorities. For comparison, we propose a quadratic transform and successive convex approximation (QT-SCA) algorithm to solve the PA problem in classic way. Numerical results show that CF-HGNN is capable of achieving 99\\% of the SE achievable by QT-SCA but using only $10^{-4}$ times of its operation time. CF-HGNN significantly outperforms the traditional greedy unfair method in terms of SE performance. Furthermore, CF-HGNN exhibits good scalability to the CF networks with various numbers of nodes and subcarriers, and also to the large-scale CF networks when assisted by user clustering.","url_abs":"https://arxiv.org/abs/2205.00546v3","url_pdf":"https://arxiv.org/pdf/2205.00546v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"heterogeneous-graph-neural-network-for-power","repo_url":"https://github.com/bhli168/MDD_GNN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}