{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:39:47Z","timestamp":1773931187897,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/spcom.2018.8724448","type":"proceedings-article","created":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:48:36Z","timestamp":1559256516000},"page":"222-226","source":"Crossref","is-referenced-by-count":30,"title":["Age-of-Information Aware Scheduling"],"prefix":"10.1109","author":[{"given":"Prakirt Raj","family":"Jhunjhunwala","sequence":"first","affiliation":[]},{"given":"Sharayu","family":"Moharir","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308962"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006541"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2016.7492912"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875100"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006590"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335391"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282742"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541765"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006543"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541763"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524524"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006542"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006593"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541764"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310931"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006504"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.202"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254578"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SARNOF.2016.7846775"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/43.728912"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90011-0"},{"key":"ref25","first-page":"37","article-title":"Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems","author":"dasdan","year":"1999","journal-title":"Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference"}],"event":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","location":"Bangalore, India","start":{"date-parts":[[2018,7,16]]},"end":{"date-parts":[[2018,7,19]]}},"container-title":["2018 International Conference on Signal Processing and Communications (SPCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8718087\/8724385\/08724448.pdf?arnumber=8724448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T18:44:21Z","timestamp":1561488261000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8724448\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/spcom.2018.8724448","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}