{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:38:00Z","timestamp":1781973480881,"version":"3.54.5"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Swedish Research Council (VR), ELLIIT, and the European Union"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tcomm.2024.3524026","type":"journal-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T14:25:19Z","timestamp":1735568719000},"page":"5848-5863","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing Information Freshness in Constrained IoT Systems: A Token-Based Approach"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3026-394X","authenticated-orcid":false,"given":"Erfan","family":"Delfani","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, Linköping University, Linköping, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-7702","authenticated-orcid":false,"given":"Nikolaos","family":"Pappas","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Linköping University, Linköping, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking62109.2024.10619779"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2000604"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.106.2100636"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065072"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/9781108943321"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3005549"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517796"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1201\/9781315140223"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2899303"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN41052.2019.8972306"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2931538"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3022895"},{"key":"ref14","article-title":"Multi-threshold AoII-optimum sampling policies for CTMC information sources","author":"Cosandal","year":"2024","journal-title":"arXiv:2407.08592"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2980911"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3019056"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065060"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3064055"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3094550"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3160563"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3206314"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3248169"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3208873"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3244930"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3283549"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3278460"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3310190"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3336547"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622492"},{"key":"ref30","first-page":"1","article-title":"Reward constrained policy optimization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Tessler"},{"key":"ref31","first-page":"22","article-title":"Constrained policy optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Achiam"},{"key":"ref32","article-title":"Safe exploration in continuous action spaces","author":"Dalal","year":"2018","journal-title":"arXiv:1801.08757"},{"key":"ref33","first-page":"1","article-title":"Guided policy search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Levine"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF59524.2023.10476817"},{"key":"ref36","volume-title":"Computer Networks","author":"Tanenbaum","year":"2011"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/972627.972629"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3141786"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006703"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/tgcn.2024.3479460"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2021.3062678"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TGCN.2021.3092272"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3114681"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/tcomm.2024.3471969"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622719"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2024.3363731"},{"key":"ref48","volume":"2","author":"Bertsekas","year":"2007","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2963667"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065057"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2991992"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(85)90288-4"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/455361"},{"key":"ref54","first-page":"394","article-title":"On the complexity of solving Markov decision problems","volume-title":"Proc. 11th Conf. Uncertainty Artif. Intell.","author":"Littman"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.06.005"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1002\/047001363x"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11126922\/10818531.pdf?arnumber=10818531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T17:30:44Z","timestamp":1758130244000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10818531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":56,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3524026","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.172054724.49267481\/v1","asserted-by":"object"}]},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}