{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:02:37Z","timestamp":1773230557985,"version":"3.50.1"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171481"],"award-info":[{"award-number":["62171481"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Guangdong Provincial Key Laboratory of Information Security Technology","doi-asserted-by":"publisher","award":["2023B1212060026"],"award-info":[{"award-number":["2023B1212060026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFE0200303"],"award-info":[{"award-number":["2021YFE0200303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>An optimal preemption framework is proposed to minimize Age of Information (AoI) in single-link systems with stochastic packet arrivals and known packet lengths. The problem is formulated as a Markov Decision Process (MDP) solved through relative value iteration (RVI), demonstrating that packet-length-dependent threshold policies achieve minimal average AoI. For scenarios with unknown traffic statistics, a Deep Q-Network (DQN) algorithm learns these thresholds adaptively through real-time interactions without prior distribution knowledge. Numerical evaluations under exponential and bounded Pareto packet length distributions reveal 15.5 percent average AoI reduction compared to non-preemptive baselines using the RVI method, while the DQN method achieves 14.4 percent improvement with less than 1.1 percent performance gap from the optimal policy. Both methods exhibit threshold-driven decision structures that balance immediate AoI reduction against long-term scheduling efficiency. Comparative analysis reveals the framework\u2019s robustness across stationary and dynamic environments, with the DQN maintaining near-optimal performance through dimension-reduced state representation. These results establish a unified solution for AoI minimization that transitions seamlessly between model-aware and model-agnostic configurations, addressing critical challenges in real-time Internet of Things (IoT) networks and status update systems requiring freshness guarantees.<\/jats:p>","DOI":"10.1145\/3794849","type":"journal-article","created":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:16:22Z","timestamp":1770326182000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Preemption Policy for Age of Information Minimization with Random Arrival and Known Packet Length"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0752-8176","authenticated-orcid":false,"given":"Xiyue","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University","place":["Guangzhou, China"]},{"name":"Guangdong Key Laboratory of Information Security and Technology, Sun Yat-Sen University","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5265-6414","authenticated-orcid":false,"given":"Qi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University","place":["Guangzhou, China"]},{"name":"Guangdong Key Laboratory of Information Security and Technology, Sun Yat-Sen University","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9670-6336","authenticated-orcid":false,"given":"Jie","family":"Gong","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University","place":["Guangzhou, China"]},{"name":"Guangdong Key Laboratory of Information Security and Technology, Sun Yat-Sen University","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900041"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619318"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2912159"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065057"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875100"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3106347"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195612"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3106395"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139226424"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3114681"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3051722"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310931"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-022-09852-w"},{"key":"e_1_3_2_16_2","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In 3rd International Conference on Learning Representations (ICLR\u201915) San Diego CA USA. Conference Track Proceedings May 7\u20139 2015. Retrieved from http:\/\/arxiv.org\/abs\/1412.6980"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1561\/1300000060"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.4.626"},{"key":"e_1_3_2_19_2","volume-title":"Deep Reinforcement Learning Principle, Algorithm and PyTorch Real Combat Micro (Class Video Version)","author":"Liu Quan","year":"2021","unstructured":"Quan Liu and Zhigang Huang. 2021. Deep Reinforcement Learning Principle, Algorithm and PyTorch Real Combat Micro (Class Video Version). Tsinghua University Press, Beijing, China. Retrieved from https:\/\/example.com\/video-courseWith supplementary video lectures."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1949.10483310"},{"key":"e_1_3_2_21_2","unstructured":"Volodymyr Mnih Koray Kavukcuoglu David Silver Alex Graves Ioannis Antonoglou Daan Wierstra Martin Riedmiller. 2013. Playing Atari with Deep Reinforcement Learning. Retrieved from https:\/\/arxiv.org\/abs\/1312.5602"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834671"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195456"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.23919\/WiOpt58741.2023.10349851"},{"key":"e_1_3_2_27_2","volume-title":"On-Line Q-Learning Using Connectionist Systems","author":"Rummery Gavin A.","year":"1994","unstructured":"Gavin A. Rummery and Mahesan Niranjan. 1994. On-Line Q-Learning Using Connectionist Systems. Technical Report CUED\/F-INFENG\/TR 409. University of Cambridge, Cambridge, UK. Retrieved from https:\/\/www.robots.ox.ac.uk\/parg\/mlrg\/papers\/rummery_tr.pdfEarly formulation of Q-learning with function approximation."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01194247"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2976690"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3078701"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735804"},{"key":"e_1_3_2_32_2","volume-title":"Reinforcement Learning: An Introduction (2nd ed.)","author":"Sutton Richard S.","year":"2018","unstructured":"Richard S. Sutton and Andrew G. Barto. 2018. Reinforcement Learning: An Introduction (2nd ed.). MIT Press, Cambridge, MA, USA. Retrieved from http:\/\/incompleteideas.net\/book\/the-book-2nd.htmlOfficial book website with supplementary materials."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2019.000036"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3104037"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284003"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065072"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2024.3452435"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2025.3584549"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/6GSUMMIT49458.2020.9083812"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437927"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3794849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:21:14Z","timestamp":1773156074000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3794849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3794849"],"URL":"https:\/\/doi.org\/10.1145\/3794849","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"2025-03-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}