{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:08:11Z","timestamp":1780405691195,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:00:00Z","timestamp":1775692800000},"content-version":"vor","delay-in-days":98,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1016\/j.procs.2026.04.147","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T12:09:06Z","timestamp":1780402146000},"page":"1125-1130","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient User Association using Multi-Objective Q-Learning Approach"],"prefix":"10.1016","volume":"280","author":[{"given":"Layla","family":"Aziz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samira","family":"Achki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdelali","family":"Elgourari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.procs.2026.04.147_bib1","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.dcan.2020.02.002","article-title":"\u201cThe analysis of coverage probability, ASE and EE in heterogeneous ultra-dense networks with power control\u201d","volume":"6","author":"Qiaoshou","year":"2020","journal-title":"Digital Communications and Networks"},{"issue":"17","key":"10.1016\/j.procs.2026.04.147_bib2","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1049\/cmu2.12816","article-title":"\u201cA heuristic approach to energy efficient user association in ultra-dense HetNets using intermittent scheduling strategies\u201d","volume":"18","author":"Dobruna","year":"2024","journal-title":"IET Communications"},{"key":"10.1016\/j.procs.2026.04.147_bib3","doi-asserted-by":"crossref","first-page":"20229","DOI":"10.1109\/JIOT.2022.3173210","article-title":"\u201cLearning-Based Resource Allocation in Heterogeneous Ultradense Network\u201d","volume":"9","author":"Zhang","year":"2022","journal-title":"IEEE Internet of Things Journal"},{"key":"10.1016\/j.procs.2026.04.147_bib4","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1109\/JSAC.2014.2328098","article-title":"\u201cWhat will 5G be? \u201d","volume":"32","author":"Jeffrey","year":"2014","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/j.procs.2026.04.147_bib5","first-page":"1509","article-title":"\u201cUser association for load balancing in heterogeneous networks: A survey\u201d","volume":"18","author":"Zhang","year":"2015","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"10.1016\/j.procs.2026.04.147_bib6","unstructured":"Meshkati, F. et al., \u201cReinforcement learning for wireless networks: Overview and challenges,\u201d in IEEE GLOBECOM, 2019."},{"key":"10.1016\/j.procs.2026.04.147_bib7","doi-asserted-by":"crossref","unstructured":"Khaled, Haitham, and Emad, Alkhazraji. (2024) \u201cAI Optimization-Based Heterogeneous Approach for Green Next-Generation Communication Systems,\u201d Sensors, 24 (15):4956.","DOI":"10.3390\/s24154956"},{"key":"10.1016\/j.procs.2026.04.147_bib8","doi-asserted-by":"crossref","unstructured":"Alhashimi, Hayder Faeq, Mhd Nour Hindia, Kaharudin Dimyati, Effariza Binti Hanafi, and Tengku Faiz Tengku Mohmed Noor Izam. (2023) \u201cJoint Optimization Scheme of User Association and Channel Allocation in 6G HetNets,\u201d Symmetry, 15 (9):1673.","DOI":"10.3390\/sym15091673"},{"key":"10.1016\/j.procs.2026.04.147_bib9","doi-asserted-by":"crossref","unstructured":"Alablani, Ibtihal, and Mohammed J. F. Alenazi. (2023) \u201cDQN-GNN-Based User Association Approach for Wireless Networks,\u201d Mathematics, 11 (20):4286.","DOI":"10.3390\/math11204286"},{"key":"10.1016\/j.procs.2026.04.147_bib10","first-page":"44","article-title":"\u201cDeep reinforcement learning for resource allocation in the physical layer,\u201d","volume":"25","author":"Wang","year":"2018","journal-title":"IEEE Wireless Communications"},{"key":"10.1016\/j.procs.2026.04.147_bib11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/s11227-024-06788-1","article-title":"\u2018User association-based load balancing using reinforcement learning in 5G heterogeneous networks.\u201d","volume":"81","author":"Ramesh","year":"2025","journal-title":"J Supercomput"},{"issue":"3","key":"10.1016\/j.procs.2026.04.147_bib12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.2174\/2210327913666230601153113","article-title":"\u2018A New Effective Strategy for User Association in Heterogeneous Networks.\u201d","volume":"13","author":"Layla","year":"2023","journal-title":"International Journal of Sensors Wireless Communications and Control"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050926011609?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050926011609?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T12:17:59Z","timestamp":1780402679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050926011609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":12,"alternative-id":["S1877050926011609"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2026.04.147","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient User Association using Multi-Objective Q-Learning Approach","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2026.04.147","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}