{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:48:38Z","timestamp":1772912918773,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["U20A20175"],"award-info":[{"award-number":["U20A20175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2020YFB1713800"],"award-info":[{"award-number":["2020YFB1713800"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2022,8,31]]},"abstract":"<jats:p>\n            <jats:bold>Multi-access edge computing (MEC)<\/jats:bold>\n            and\n            <jats:bold>ultra-dense networking (UDN)<\/jats:bold>\n            are recognized as two promising paradigms for future mobile networks that can be utilized to improve the spectrum efficiency and the\n            <jats:bold>quality of computational experience (QoCE)<\/jats:bold>\n            . In this paper, we study the task offloading problem in an MEC-enabled UDN architecture with the aim to minimize the task duration while satisfying the energy budget constraints. Due to the dynamics associated with the environment and parameter uncertainty, designing an optimal task offloading algorithm is highly challenging. Consequently, we propose an online task offloading algorithm based on a state-of-the-art\n            <jats:bold>deep reinforcement learning (DRL)<\/jats:bold>\n            technique:\n            <jats:bold>asynchronous advantage actor-critic (A3C)<\/jats:bold>\n            . It is worthy of remark that the proposed method requires neither instantaneous\n            <jats:bold>channel state information (CSI)<\/jats:bold>\n            nor prior knowledge of the computational capabilities of the base stations. Simulations show that the our method is able to learn a good offloading policy to obtain a near-optimal task allocation while meeting energy budget constraints of mobile devices in the UDN environment.\n          <\/jats:p>","DOI":"10.1145\/3491217","type":"journal-article","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T06:05:57Z","timestamp":1647324357000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["AI-Enabled Task Offloading for Improving Quality of Computational Experience in Ultra Dense Networks"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0556-2769","authenticated-orcid":false,"given":"Bo","family":"Gu","sequence":"first","affiliation":[{"name":"School of Intelligent Systems Engineering, Sun Yat-sen University, Guangzhou, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1928-3704","authenticated-orcid":false,"given":"Mamoun","family":"Alazab","sequence":"additional","affiliation":[{"name":"College of Engineering, Charles Darwin University, Casuarina, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4765-2236","authenticated-orcid":false,"given":"Ziqi","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2645-4724","authenticated-orcid":false,"given":"Xu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9393-4416","authenticated-orcid":false,"given":"Jun","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Cybersecurity, Northwestern Polytechnical University, Xi\u2019an, China"}]}],"member":"320","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2016.2517653"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2815360"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2876279"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933893"},{"key":"e_1_3_1_6_2","unstructured":"Cisco. March 2020. Cisco annual internet report (2018\u20132023) white paper. (March 2020)."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2565516"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2699660"},{"key":"e_1_3_1_9_2","unstructured":"ETSI. 2016. Mobile Edge Computing: Technical Requirements. (Mar. 2016)."},{"issue":"8","key":"e_1_3_1_10_2","article-title":"Neural networks for machine learning lecture 6a overview of mini-batch gradient descent","volume":"14","author":"Hinton Geoffrey","year":"2012","unstructured":"Geoffrey Hinton, Nitish Srivastava, and Kevin Swersky. 2012. Neural networks for machine learning lecture 6a overview of mini-batch gradient descent. Cited on 14, 8 (2012).","journal-title":"Cited on"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/tmc.2019.2928811"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2903815"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2840120"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2947046"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2898573"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2916583"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2611964"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925615"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2717986"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Peter M. Mell and Timothy Grance. 2011. SP 800-145. The NIST definition of cloud computing. (2011).","DOI":"10.6028\/NIST.SP.800-145"},{"key":"e_1_3_1_21_2","article-title":"Asynchronous methods for deep reinforcement learning","volume":"1602","author":"Mnih Volodymyr","year":"2016","unstructured":"Volodymyr Mnih, Adri\u00e0 Puigdom\u00e8nech Badia, Mehdi Mirza, Alex Graves, Timothy P. Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. 2016. Asynchronous methods for deep reinforcement learning. CoRR abs\/1602.01783 (2016). arxiv:1602.01783http:\/\/arxiv.org\/abs\/1602.01783.","journal-title":"CoRR"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2624118"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2845360"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2760160"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2703901"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2020.2964765"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2972061"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2787201"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2891736"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2966500"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2020.2966500"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2969148"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2971807"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2688925"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2020.2967502"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2020.2965159"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2847337"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3491217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3491217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:19Z","timestamp":1750183759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3491217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,8,31]]}},"alternative-id":["10.1145\/3491217"],"URL":"https:\/\/doi.org\/10.1145\/3491217","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"2020-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}