{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:13:38Z","timestamp":1704932018484},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2021,12,1]]},"DOI":"10.1587\/transcom.2021iti0002","type":"journal-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T22:08:32Z","timestamp":1625090912000},"page":"1465-1478","source":"Crossref","is-referenced-by-count":1,"title":["Analysis on Asymptotic Optimality of Round-Robin Scheduling for Minimizing Age of Information with HARQ"],"prefix":"10.23919","volume":"E104.B","author":[{"given":"Zhiyuan","family":"JIANG","sequence":"first","affiliation":[{"name":"Shanghai Institute for Advanced Communication and Data Science, Shanghai University"}]},{"given":"Yijie","family":"HUANG","sequence":"additional","affiliation":[{"name":"Shanghai Institute for Advanced Communication and Data Science, Shanghai University"}]},{"given":"Shunqing","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Shanghai Institute for Advanced Communication and Data Science, Shanghai University"}]},{"given":"Shugong","family":"XU","sequence":"additional","affiliation":[{"name":"Shanghai Institute for Advanced Communication and Data Science, Shanghai University"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Kaul, R. Yates, and M. Gruteser, \u201cReal-time status: How often should one update?,\u201d IEEE Conf. Comput. Commun. (INFOCOM), pp.2731-2735, March 2012. 10.1109\/infcom.2012.6195689","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, \u201cScheduling policies for minimizing age of information in broadcast wireless networks,\u201d IEEE\/ACM Trans. Netw., vol.26, no.6, pp.2637-2650, Dec. 2018. 10.1109\/tnet.2018.2873606","DOI":"10.1109\/TNET.2018.2873606"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] R. Li, A. Eryilmaz, and B. Li, \u201cThroughput-optimal wireless scheduling with regulated inter-service times,\u201d IEEE INFOCOM, pp.2616-2624, 2013. 10.1109\/infcom.2013.6567069","DOI":"10.1109\/INFCOM.2013.6567069"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] R. Singh, X. Guo, and P.R. Kumar, \u201cIndex policies for optimal meanvariance trade-off of inter-delivery times in real-time sensor networks,\u201d IEEE Conf. Comput. Commun. (INFOCOM), pp.505-512, IEEE, 2015. 10.1109\/infocom.2015.7218417","DOI":"10.1109\/INFOCOM.2015.7218417"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Z. Jiang, B. Krishnamachari, X. Zheng, S. Zhou, and Z. Niu, \u201cTimely status update in wireless uplinks: Analytical solutions with asymptotic optimality,\u201d IEEE Internet Things J., vol.6, no.2, pp.3885-3898, April 2019. 10.1109\/jiot.2019.2893319","DOI":"10.1109\/JIOT.2019.2893319"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Z. Jiang, \u201cAnalyzing age of information in multiaccess networks by fluid limits,\u201d IEEE Conf. Comput.Commun. (INFOCOM), May 2021. 10.1109\/infocom42981.2021.9488712","DOI":"10.1109\/INFOCOM42981.2021.9488712"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Z. Jiang, S. Fu, S. Zhou, Z. Niu, S. Zhang, and S. Xu, \u201cAI-assisted low information latency wireless networking,\u201d IEEE Wireless Commun., vol.27, no.1, pp.108-115, 2020. 10.1109\/mwc.001.1900279","DOI":"10.1109\/MWC.001.1900279"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] W. Bux, \u201cToken-ring local-area networks and their performance,\u201d Proc. IEEE, vol.77, no.2, pp.238-256, 1989. 10.1109\/5.18625","DOI":"10.1109\/5.18625"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] J. Sun, Z. Jiang, B. Krishnamachari, S. Zhou, and Z. Niu, \u201cClosed-formWhittle's index-enabled random access for timely status update,\u201d IEEE Trans. Commun., vol.68, no.3, pp.1538-1551, 2020. 10.1109\/tcomm.2019.2960346","DOI":"10.1109\/TCOMM.2019.2960346"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Y. Hsu, \u201cAge of information: Whittle index for scheduling stochastic arrivals,\u201d IEEE Int' l Symp. Info. Theory, pp.2634-2638, June 2018. 10.1109\/isit.2018.8437712","DOI":"10.1109\/ISIT.2018.8437712"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A. Maatouk, S. Kriouile, M. Assaad, and A. Ephremides, \u201cOn the optimality of the Whittle's index policy for minimizing the age of information,\u201d arXiv preprint, arXiv:2001.03096, 2020.","DOI":"10.1109\/ISIT44484.2020.9174024"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] E. Najm, R. Yates, and E. Soljanin, \u201cStatus updates through M\/G\/1\/1 queues with HARQ,\u201d IEEE Int'l Symp. Info. Theory, pp.131-135, June 2017. 10.1109\/isit.2017.8006504","DOI":"10.1109\/ISIT.2017.8006504"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] E.T. Ceran, D. Gunduz, and A. Gyorgy, \u201cAverage age of information with hybrid ARQ under a resource constraint,\u201d IEEE Trans. Wireless Commun., vol.18, no.3, pp.1900-1913, 2019. 10.1109\/twc.2019.2899303","DOI":"10.1109\/TWC.2019.2899303"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] E. Altman, R. El-Azouzi, D.S. Menasche, and Y. Xu, \u201cForever young: Aging control for hybrid networks,\u201d Proc. Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp.91-100, 2019. 10.1145\/3323679.3326507","DOI":"10.1145\/3323679.3326507"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] B.T. Bacinoglu, E.T. Ceran, and E. Uysal-Biyikoglu, \u201cAge of information under energy replenishment constraints,\u201d Proc. Inf. Theory Appl. Workshop, pp.25-31, Feb. 2015. 10.1109\/ita.2015.7308962","DOI":"10.1109\/ITA.2015.7308962"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] T.V.K. Chaitanya and E.G. Larsson, \u201cOptimal power allocation for hybrid ARQ with chase combining in i.i.d. Rayleigh fading channels,\u201d IEEE Trans. Commun., vol.61, no.5, pp.1835-1846, 2013. 10.1109\/tcomm.2013.032013.120422","DOI":"10.1109\/TCOMM.2013.032013.120422"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] R. Bhatia and C. Davis, \u201cA better bound on the variance,\u201d The American Mathematical Monthly, vol.107, no.4, pp.353-357, 2000. 10.1080\/00029890.2000.12005203","DOI":"10.1080\/00029890.2000.12005203"},{"key":"18","unstructured":"[18] G.E. Box, J.S. Hunter, and W.G. Hunter, Statistics for Experimenters: Design, Innovation, and Discovery, vol.2. Wiley-Interscience New York, 2005."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Y. Polyanskiy, H.V. Poor, and S. Verdu, \u201cChannel coding rate in the finite blocklength regime,\u201d IEEE Trans. Inf. Theory, vol.56, no.5, pp.2307-2359, 2010. 10.1109\/tit.2010.2043769","DOI":"10.1109\/TIT.2010.2043769"},{"key":"20","unstructured":"[20] D.R. Cox, Renewal Theory, vol.1, Methuen London, 1967."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E104.B\/12\/E104.B_2021ITI0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:07Z","timestamp":1704898747000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E104.B\/12\/E104.B_2021ITI0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,1]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2021iti0002","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,1]]},"article-number":"2021ITI0002"}}