{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:59:23Z","timestamp":1782928763947,"version":"3.54.5"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council Discovery Project","doi-asserted-by":"publisher","award":["DP180104062"],"award-info":[{"award-number":["DP180104062"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102322"],"award-info":[{"award-number":["62102322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1109\/lcomm.2021.3125669","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T21:51:05Z","timestamp":1636408265000},"page":"54-58","source":"Crossref","is-referenced-by-count":25,"title":["Whittle Index-Based Scheduling Policy for Minimizing the Cost of Age of Information"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4913-3587","authenticated-orcid":false,"given":"Zhifeng","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuo","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9373-5289","authenticated-orcid":false,"given":"Nan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8973-9079","authenticated-orcid":false,"given":"Xiangyun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2917080"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2525398"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2011.5984917"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9014267"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCC49849.2020.9238859"},{"issue":"9","key":"ref8","first-page":"8178","article-title":"Optimizing information freshness via multiuser scheduling with adaptive NOMA\/OMA","volume":"7","author":"Wang","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2893319"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN41052.2019.8972306"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2873606"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2980911"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2991992"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852321"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437712"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845145"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2960346"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988013"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845106"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919842"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200040420"},{"key":"ref22","volume-title":"Dynamic Programming and Optimal Control","author":"Bertsekas","year":"2000"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/9674048\/09605614.pdf?arnumber=9605614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:54:45Z","timestamp":1705017285000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9605614\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":22,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2021.3125669","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"value":"1089-7798","type":"print"},{"value":"1558-2558","type":"electronic"},{"value":"2373-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]}}}