{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:50:11Z","timestamp":1773247811731,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T00:00:00Z","timestamp":1761177600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2332800"],"award-info":[{"award-number":["CCF-2332800"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142412615"],"award-info":[{"award-number":["N000142412615"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Army Contracting Command - Aberdeen Proving Ground","award":["W911NF-22-1-015"],"award-info":[{"award-number":["W911NF-22-1-015"]}]},{"DOI":"10.13039\/100014819","name":"U.S. Army Combat Capabilities Development Command","doi-asserted-by":"publisher","award":["W911NF2520046"],"award-info":[{"award-number":["W911NF2520046"]}],"id":[{"id":"10.13039\/100014819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,27]]},"DOI":"10.1145\/3704413.3764415","type":"proceedings-article","created":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T17:08:23Z","timestamp":1761239303000},"page":"281-290","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Understanding the Fundamental Trade-Off Between Age of Information and Throughput in Unreliable Wireless Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-4798-9397","authenticated-orcid":false,"given":"Lin","family":"Wang","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1166-8773","authenticated-orcid":false,"given":"I-Hong","family":"Hou","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2735","volume-title":"Real-time status: How often should one update?","author":"Kaul S.","year":"2012","unstructured":"S. Kaul, R. Yates, and M. Gruteser, \"Real-time status: How often should one update?\" pp. 2731\u20132735, 2012."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065072"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3179305"},{"key":"e_1_3_2_1_4_1","first-page":"10","volume-title":"Minimizing age of information for underwater optical wireless sensor networks,\" in IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","author":"Tian Y.","year":"2023","unstructured":"Y. Tian, L. Wang, C. Lin, Y. Chi, B. Lu, and Z. Qin, \"Minimizing age of information for underwater optical wireless sensor networks,\" in IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, 2023, pp. 1\u201310."},{"key":"e_1_3_2_1_5_1","first-page":"910","volume-title":"Competitive online age-of-information optimization for energy harvesting systems,\" in IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","author":"Lin Q.","year":"2024","unstructured":"Q. Lin, J. Su, and M. Chen, \"Competitive online age-of-information optimization for energy harvesting systems,\" in IEEE INFOCOM 2024 - IEEE Conference on Computer Communications, 2024, pp. 901\u2013910."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3229741"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919320"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3307351"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3012835"},{"key":"e_1_3_2_1_10_1","first-page":"10","volume-title":"Wiswarm: Age-of-information-based wireless networking for collaborative teams of uavs,\" in IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","author":"Tripathi V.","year":"2023","unstructured":"V. Tripathi, I. Kadota, E. Tal, M. S. Rahman, A. Warren, S. Karaman, and E. Modiano, \"Wiswarm: Age-of-information-based wireless networking for collaborative teams of uavs,\" in IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, 2023, pp. 1\u201310."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3232366"},{"key":"e_1_3_2_1_12_1","article-title":"Monitoring correlated sources: Aoi-based scheduling is nearly optimal","author":"Ramakanth R. V.","year":"2024","unstructured":"R. V. Ramakanth, V. Tripathi, and E. Modiano, \"Monitoring correlated sources: Aoi-based scheduling is nearly optimal,\" IEEE Transactions on Mobile Computing, 2024.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"e_1_3_2_1_13_1","first-page":"8","volume-title":"IEEE","author":"Ornee T. Z.","year":"2019","unstructured":"T. Z. Ornee and Y. Sun, \"Sampling for remote estimation through queues: Age of information and beyond,\" in 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT). IEEE, 2019, pp. 1\u20138."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065093"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.23919\/JCN.2023.000032"},{"key":"e_1_3_2_1_16_1","first-page":"1730","volume-title":"IEEE","author":"Wang S.","year":"2024","unstructured":"S. Wang, O. T. Ajayi, and Y. Cheng, \"An analytical approach for minimizing the age of information in a practical csma network,\" in IEEE INFOCOM 2024-IEEE Conference on Computer Communications. IEEE, 2024, pp. 1721\u20131730."},{"key":"e_1_3_2_1_17_1","first-page":"1750","volume-title":"IEEE","author":"Zhou S.","year":"2024","unstructured":"S. Zhou and X. Lin, \"An easier-to-verify sufficient condition for whittle indexability and application to aoi minimization,\" in IEEE INFOCOM 2024-IEEE Conference on Computer Communications. IEEE, 2024, pp. 1741\u20131750."},{"key":"e_1_3_2_1_18_1","first-page":"445","volume-title":"Aoi scheduling with maximum thresholds,\" in IEEE INFOCOM 2020 - IEEE Conference on Computer Communications","author":"Li C.","year":"2020","unstructured":"C. Li, S. Li, Y. Chen, Y. Thomas Hou, and W. Lou, \"Aoi scheduling with maximum thresholds,\" in IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, 2020, pp. 436\u2013445."},{"key":"e_1_3_2_1_19_1","first-page":"851","volume-title":"Minimizing the age of information in broadcast wireless networks,\" in 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Kadota I.","year":"2016","unstructured":"I. Kadota, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, \"Minimizing the age of information in broadcast wireless networks,\" in 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016, pp. 844\u2013851."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323679.3326520"},{"key":"e_1_3_2_1_21_1","first-page":"50","volume-title":"Algorithmic Foundations","author":"Tripathi V.","year":"2022","unstructured":"V. Tripathi and E. Modiano, \"Optimizing age of information with correlated sources,\" in Proceedings of the Twenty-Third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, 2022, pp. 41\u201350."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467040"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467030"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3641512.3686371"},{"key":"e_1_3_2_1_25_1","first-page":"9","volume-title":"On scheduling with aoi violation tolerance,\" in IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","author":"Li C.","year":"2021","unstructured":"C. Li, Q. Liu, S. Li, Y. Chen, Y. T. Hou, and W. Lou, \"On scheduling with aoi violation tolerance,\" in IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, 2021, pp. 1\u20139."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"J. Lou X. Yuan S. Kompella and N.-F. Tzeng \"Aoi and throughput tradeoffs in routing-aware multi-hop wireless networks \" in IEEE INFOCOM 2020 - IEEE Conference on Computer Communications 2020 pp. 476\u2013485.","DOI":"10.1109\/INFOCOM41043.2020.9155444"},{"key":"e_1_3_2_1_27_1","first-page":"1852","volume-title":"Optimizing age of information in wireless networks with throughput constraints,\" in IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","author":"Kadota I.","year":"2018","unstructured":"I. Kadota, A. Sinha, and E. Modiano, \"Optimizing age of information in wireless networks with throughput constraints,\" in IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 2018, pp. 1844\u20131852."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3274143"},{"key":"e_1_3_2_1_29_1","volume-title":"A theory of second-order wireless network optimization and its application on aoi,\" in IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","author":"Guo D.","year":"2022","unstructured":"D. Guo, K. Nakhleh, I.-H. Hou, S. Kompella, and C. Kam, \"A theory of second-order wireless network optimization and its application on aoi,\" in IEEE INFOCOM 2022 - IEEE Conference on Computer Communications. IEEE Press, 2022, p. 999\u20131008."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3432655"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3409528"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061954"}],"event":{"name":"MobiHoc '25: Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","location":"Rice University Houston TX USA","acronym":"MobiHoc '25","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3704413.3764415","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3704413.3764415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T17:10:45Z","timestamp":1761239445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3704413.3764415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,23]]},"references-count":32,"alternative-id":["10.1145\/3704413.3764415","10.1145\/3704413"],"URL":"https:\/\/doi.org\/10.1145\/3704413.3764415","relation":{},"subject":[],"published":{"date-parts":[[2025,10,23]]},"assertion":[{"value":"2025-10-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}