{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T12:34:47Z","timestamp":1761741287604,"version":"build-2065373602"},"reference-count":26,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Commun. Netw."],"abstract":"<jats:p>Due to the increasing demand for frequency resources in wireless networks, efficient frequency assignment has become a critical challenge. Unlike conventional cellular systems, where frequency allocation is centrally managed by a base station, device-to-device (D2D) communication, especially in mission-critical scenarios, introduces additional complexity due to its decentralized nature. In this study, we model a D2D communication network as a graph and formulate the frequency assignment task as a graph coloring problem. While previous research has primarily relied on heuristic or artificial intelligence (AI)-based methods to determine node ordering, we propose a novel framework that integrates deep Q-learning (DQN) with graph neural networks (GNNs) to enhance assignment efficiency. To ensure interference-free operation, we explicitly incorporate net filter discrimination (NFD), which captures realistic interference constraints. Unlike previous AI-based approaches that focus solely on minimizing the number of assigned frequency blocks, our method jointly optimizes both the total frequency span and the ordering cost. Extensive simulations show that the proposed approach significantly outperforms greedy baselines, particularly in complex and dynamic environments. Furthermore, by incorporating device mobility into the simulations, we validate the robustness and adaptability of the proposed framework. These results underscore the potential of DQN-based methods to enable scalable and reliable frequency assignment in mission-critical wireless networks.<\/jats:p>","DOI":"10.3389\/frcmn.2025.1657288","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:57:17Z","timestamp":1761721037000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph-theoretic approach to mobility-aware frequency assignment via deep Q-learning"],"prefix":"10.3389","volume":"6","author":[{"given":"Hyewon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Bae","family":"Jeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Younggun","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiyeon","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Byoung","family":"Chae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1965","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","article-title":"Models and solution techniques for frequency assignment problems","volume":"153","author":"Aardal","year":"2007","journal-title":"Ann. Oper. Res."},{"volume-title":"Unifying count-based exploration and intrinsic motivation","year":"2016","author":"Bellemare","key":"B3"},{"key":"B4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Commun. ACM"},{"key":"B5","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","article-title":"Chromatic scheduling and the chromatic number problem","volume":"19","author":"Brown","year":"1972","journal-title":"Manag. Scir."},{"key":"B6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1504\/ijmndi.2006.010812","article-title":"A genetic algorithm for frequency assignment with problem decomposition","volume":"1","author":"Colombo","year":"2006","journal-title":"Int. J. Mob. Netw. Des. Innov."},{"key":"B7","first-page":"73","article-title":"Generation of lower bounds for the minimum-span frequency-assignment problem","volume":"118","author":"Costa","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"B8","first-page":"23","article-title":"Deep learning-based approximate graph-coloring algorithm for register allocation","volume-title":"Proc. LLVM-HPC and HiPar","author":"Das","year":"2020"},{"key":"B9","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/proc.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"B10","doi-asserted-by":"crossref","DOI":"10.2514\/6.1992-1960","volume-title":"Achieving spectrum conservation for the minimum-span and minimum-order frequency assignment problems","author":"Heyward","year":"1992"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1902.10162","article-title":"Coloring big graphs with alphagozero","author":"Huang","year":"2019","journal-title":"arXiv Prepr."},{"journal-title":"Int. Telecommun. Union. Ser. P\u2013Radiowave Propag.","article-title":"Recommendation ITU-R P.525-2: calculation of free-space attenuation","year":"1994","key":"B12"},{"key":"B13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.icte.2018.05.004","article-title":"Game theory based hybrid frequency assignment with net filter discrimination constraints","volume":"5","author":"Jeon","year":"2019","journal-title":"ICT Express"},{"key":"B14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/lwc.2020.3025312","article-title":"Graph-theory-based resource allocation and mode selection in D2D communication systems: the role of full-duplex","volume":"10","author":"Jeon","year":"2021","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"B15","doi-asserted-by":"publisher","first-page":"6627","DOI":"10.1109\/twc.2025.3554988","article-title":"Low complexity frequency domain nonlinear self-interference cancellation for flexible duplex","volume":"24","author":"Kim","year":"2025","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"B16","first-page":"1","article-title":"A frequency assignment technique for effective sinr and throughput management in a battlefield","volume-title":"Proc. Nat. Conf. Commun. (NCC)","author":"Kumar","year":"2018"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2408.05054","article-title":"Graph neural networks as ordering heuristics for parallel graph coloring","author":"Langedal","year":"2024","journal-title":"arXiv Prepr."},{"key":"B18","doi-asserted-by":"publisher","first-page":"5796","DOI":"10.1109\/twc.2025.3549429","article-title":"Nonlinear self-interference cancellation with adaptive orthonormal polynomials for full-duplex wireless systems","volume":"24","author":"Lee","year":"2025","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"B19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/s0166-218x(02)00239-1","article-title":"An enumerative algorithm for the frequency assignment problem","volume":"129","author":"Mannino","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"B20","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.cor.2008.08.006","article-title":"Heuristic manipulation, tabu search and frequency assignment","volume":"37","author":"Montemanni","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"B21","doi-asserted-by":"publisher","first-page":"12068","DOI":"10.1109\/twc.2024.3387855","article-title":"Opportunistic fluid antenna multiple access via team-inspired reinforcement learning","volume":"23","author":"Waqar","year":"2024","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"B22","first-page":"553","article-title":"Generating a graph colouring heuristic with deep q-learning and graph neural networks","volume-title":"Proc. LION 17","author":"Watkins","year":"2023"},{"key":"B23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound for the chromatic number of a graph and its application to timetabling problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Fomput. J."},{"key":"B24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/tnnls.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"B25","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/icc.2006.254887","article-title":"Auction-based congestion pricing for wireless data services","volume":"3","author":"Yaipairoj","year":"2006","journal-title":"Proc. IEEE Int. Conf. Comm. (ICC)."},{"key":"B26","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/jcn.2017.000057","article-title":"Frequency assignment problem with net filter discrimination constraints","volume":"19","author":"Yilmaz","year":"2017","journal-title":"IEEE\/KICS J. Commun. Netw."},{"key":"B27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/temc.1973.303294","article-title":"Frequency assignment games and strategies","author":"Zoellner","year":"1973","journal-title":"IEEE Trans. Electromagn. Compat."}],"container-title":["Frontiers in Communications and Networks"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frcmn.2025.1657288\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:57:19Z","timestamp":1761721039000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frcmn.2025.1657288\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"references-count":26,"alternative-id":["10.3389\/frcmn.2025.1657288"],"URL":"https:\/\/doi.org\/10.3389\/frcmn.2025.1657288","relation":{},"ISSN":["2673-530X"],"issn-type":[{"type":"electronic","value":"2673-530X"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"article-number":"1657288"}}