{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:43:59Z","timestamp":1778085839198,"version":"3.51.4"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174254","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1770-1775","source":"Crossref","is-referenced-by-count":48,"title":["Age of Information in Random Access Channels"],"prefix":"10.1109","author":[{"given":"Xingran","family":"Chen","sequence":"first","affiliation":[{"name":"University of Pennsylvania,Department of Electrical and Systems Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Gatsis","sequence":"additional","affiliation":[{"name":"University of Oxford,Department of Engineering Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Hassani","sequence":"additional","affiliation":[{"name":"University of Pennsylvania,Department of Electrical and Systems Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirin Saeedi","family":"Bidokhti","sequence":"additional","affiliation":[{"name":"University of Pennsylvania,Department of Electrical and Systems Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","article-title":"An efficient contention resolution algorithm for multiple access channels","author":"mosely","year":"1979","journal-title":"Master’s thesis"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057010"},{"key":"ref10","article-title":"Age of information in multihop multicast networks","volume":"abs 1812 10455","author":"buyukates","year":"2018","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2018.8445981"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2915521"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2873606"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2918736"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3323679.3326520"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2912159"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746751"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437712"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2936199"},{"key":"ref28","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871079"},{"key":"ref27","article-title":"Upper bound on the capacity of a random multiple-access system","volume":"23","author":"tasybakov","year":"0","journal-title":"Probl Peredachi Inf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006541"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533395"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437671"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437500"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6134181"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849713"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2011.5984917"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2870896"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2018.8445979"},{"key":"ref21","article-title":"Status updates over unreliable multiaccess channels","author":"kaul","year":"2017","journal-title":"arXiv 1705 02521v1"},{"key":"ref24","article-title":"Age of information in random access channels","author":"chen","year":"2019","journal-title":"arXiv 1912 01473"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2019.000039"},{"key":"ref26","article-title":"Benefits of coding on age of information in broadcast networks","author":"chen","year":"2018","journal-title":"arXiv 1904 10077"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITC30.2018.00031"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174254.pdf?arnumber=9174254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:16Z","timestamp":1773347656000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174254\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174254","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}