{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T12:25:33Z","timestamp":1762777533844,"version":"build-2065373602"},"reference-count":12,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Internet Technology Letters"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>In this era, Wireless Communication Networks (WCNs) need dynamic and adaptive resource allocation approaches to handle user association and power allocation specifically under multi\u2010connectivity and diverse traffic conditions. However, the conventional approaches struggle due to high computational cost, poor adaptability, and limited generalization. Therefore, this research proposes a large Spatio\u2010Temporal Graph Transformer\u2010based Reinforcement Learning (STGT\u2010RL) model to jointly optimize user association and power allocation in large\u2010scale WCNs. Initially, the network topology is designed using graph representations and incorporates a hybrid encoder that integrates Graph Transformers for spatial user\u2010Base Station (BS) relationships and Spatio\u2010Temporal Transformers for capturing time\u2010varying traffic and channel states. Further, to ensure adaptive decision\u2010making, a Transformer\u2010RL policy agent is trained through a multi\u2010objective reward function that assists in balancing throughput maximization and power efficiency. Furthermore, to enable stable policy learning, the model is initially trained using high\u2010quality supervision from CRFSMA\u2010generated labels, followed by reinforcement\u2010based policy refinement. Hence, the experimental results are simulated on WCN environments to demonstrate that the proposed STGT\u2010RL significantly outperforms baseline deep learning and heuristic\u2010based methods in terms of throughput, energy efficiency, and fairness.<\/jats:p>","DOI":"10.1002\/itl2.70131","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T12:29:11Z","timestamp":1758284951000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Joint Optimization of User Association and Power Allocation in Wireless Networks Using a Large Spatio\u2010Temporal Graph Transformer Model"],"prefix":"10.1002","volume":"8","author":[{"given":"D. S.","family":"Keerthi","sequence":"first","affiliation":[{"name":"Department of Electronics and Communication Engineering Malnad College of Engineering  Hassan India"}]},{"given":"P.","family":"Vishwanath","sequence":"additional","affiliation":[{"name":"Department of Electronics and Communication Engineering HKE Society's Sir M Visvesvaraya College of Engineering Raichur  Raichur India"}]},{"given":"Kothuri Parashu","family":"Ramulu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering Indur Institute of Engineering and Technology  Ponnal India"}]},{"given":"Gopinath","family":"Anjinappa","sequence":"additional","affiliation":[{"name":"School of Electrical and Electronics Engineering REVA University  Bengaluru India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8785-3684","authenticated-orcid":false,"given":"Hirald Dwaraka","family":"Praveena","sequence":"additional","affiliation":[{"name":"Department of ECE, School of Engineering Mohan Babu University (Erstwhile Sree Vidyanikethan Engineering\u00a0College)  Tirupati India"}]}],"member":"311","published-online":{"date-parts":[[2025,9,19]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3385230"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2024.3370977"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC57260.2024.10570826"},{"key":"e_1_2_7_5_1","first-page":"1","volume-title":"2024 IEEE Wireless Communications and Networking Conference (WCNC)","author":"Meng X.","year":"2024"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-024-03680-x"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2022.05.014"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2025.103543"},{"key":"e_1_2_7_9_1","first-page":"1","article-title":"Joint Optimization of User Association and Power Allocation With Multi\u2010Connectivity Using Multi\u2010Objective Slime Mould Algorithm","author":"Cai X.","year":"2025","journal-title":"IETE Journal of Research"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.3390\/e25030409"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12040959"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2022.3195607"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2023.3301232"}],"container-title":["Internet Technology Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/itl2.70131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T12:21:59Z","timestamp":1762777319000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/itl2.70131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1002\/itl2.70131"],"URL":"https:\/\/doi.org\/10.1002\/itl2.70131","archive":["Portico"],"relation":{},"ISSN":["2476-1508","2476-1508"],"issn-type":[{"type":"print","value":"2476-1508"},{"type":"electronic","value":"2476-1508"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"assertion":[{"value":"2025-06-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70131"}}