{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:48:28Z","timestamp":1784216908636,"version":"3.55.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2020YFB1807700"],"award-info":[{"award-number":["2020YFB1807700"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Veh. Technol."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tvt.2024.3489216","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T18:39:09Z","timestamp":1730918349000},"page":"4774-4787","source":"Crossref","is-referenced-by-count":3,"title":["Online Scheduling for Multi-Access in Space-Air-Ground Integrated Networks Using iGNNSeq-Enhanced Reinforcement Learning"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9478-3920","authenticated-orcid":false,"given":"Yuejiao","family":"Xie","sequence":"first","affiliation":[{"name":"School of Science and Engineering, Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2126-4824","authenticated-orcid":false,"given":"Qianqian","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0571-2571","authenticated-orcid":false,"given":"Guanchong","family":"Niu","sequence":"additional","affiliation":[{"name":"Guangzhou Institute of Technology, Xidian University, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3316-5381","authenticated-orcid":false,"given":"Man-On","family":"Pun","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6606-5822","authenticated-orcid":false,"given":"Zhu","family":"Han","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Houston, Houston, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2024.3393612"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3592473.3592562"},{"key":"ref3","article-title":"Haps mobile","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0451-5"},{"key":"ref5","first-page":"1","article-title":"Branch and bound algorithms-principles and examples","author":"Clausen","year":"1999"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3379552"},{"key":"ref7","article-title":"Deep policies for online bipartite matching: A reinforcement learning approach","author":"Alomrani","year":"2022","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref8","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Representations","volume":"25","author":"Kool","year":"2018,"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2997336"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2916663"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/sat.1374"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2561078"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2022.3190238"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3088898"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2022.3155711"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2011.2159690"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2019.8796240"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3051603"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1423332"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/ICN.2020.0004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2000542"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.002.2101048"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3117263"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2443095"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.23919\/ICN.2020.0009"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900072"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3058250"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2988917"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAR49639.2020.9107998"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3018824"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3121760"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops57953.2023.10283750"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3151639"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3042925"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LAWP.2010.2050131"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3008009"},{"key":"ref37","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1166"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3390\/s150922266"},{"key":"ref40","article-title":"Gurobi optimizer reference manual, 2020","year":"2020"},{"key":"ref41","article-title":"SIGN: Scalable inception graph neural networks","author":"Frasca","year":"2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2017.2762739"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2927314"}],"container-title":["IEEE Transactions on Vehicular Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/25\/10910276\/10745741.pdf?arnumber=10745741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T06:34:54Z","timestamp":1741242894000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10745741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tvt.2024.3489216","relation":{},"ISSN":["0018-9545","1939-9359"],"issn-type":[{"value":"0018-9545","type":"print"},{"value":"1939-9359","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}