{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:56:06Z","timestamp":1777892166683,"version":"3.51.4"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,2,19]],"date-time":"2027-02-19T00:00:00Z","timestamp":1802995200000},"content-version":"am","delay-in-days":324,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 2214940"],"award-info":[{"award-number":["CNS 2214940"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CPS 2128378"],"award-info":[{"award-number":["CPS 2128378"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 2107014"],"award-info":[{"award-number":["CNS 2107014"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 2150152"],"award-info":[{"award-number":["CNS 2150152"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.comnet.2026.112121","type":"journal-article","created":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:30:35Z","timestamp":1771288235000},"page":"112121","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Age of information utility-based routing in networks with unreliable links"],"prefix":"10.1016","volume":"279","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5961-721X","authenticated-orcid":false,"given":"Abdalaziz","family":"Sawwan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7767-7763","authenticated-orcid":false,"given":"Mingjun","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8648-141X","authenticated-orcid":false,"given":"Jie","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2026.112121_bib0001","series-title":"Age of information: an introduction and survey","author":"Yates","year":"2021"},{"key":"10.1016\/j.comnet.2026.112121_bib0002","series-title":"2012 Proceedings IEEE INFOCOM","first-page":"2731","article-title":"Real-time status: how often should one update","author":"Kaul","year":"2012"},{"issue":"6","key":"10.1016\/j.comnet.2026.112121_bib0003","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1109\/TNET.2018.2873606","article-title":"Scheduling policies for minimizing age of information in broadcast wireless networks","volume":"26","author":"Kadota","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2026.112121_bib0004","series-title":"IEEE INFOCOM 2020-IEEE Conference on Computer Communications","first-page":"476","article-title":"AoI and throughput tradeoffs in routing-aware multi-hop wireless networks","author":"Lou","year":"2020"},{"key":"10.1016\/j.comnet.2026.112121_bib0005","series-title":"Conference Proceedings of the IEEE International Phoenix Conference on Computers and Communications","first-page":"480","article-title":"A novel distributed routing protocol to support ad-hoc mobile computing","author":"Toh","year":"1996"},{"key":"10.1016\/j.comnet.2026.112121_bib0006","series-title":"Qshine","first-page":"10","article-title":"A utility-based distributed maximum lifetime routing algorithm for wireless networks","author":"Xue","year":"2005"},{"key":"10.1016\/j.comnet.2026.112121_bib0007","first-page":"270","article-title":"A framework for reliable routing in mobile ad hoc networks","volume":"1","author":"Ye","year":"2003","journal-title":"IEEE Infocom 2003"},{"key":"10.1016\/j.comnet.2026.112121_bib0008","series-title":"Proceedings of the International Conference on Mobile Computing and Networking","first-page":"134","article-title":"A high-throughput path metric for multi-hop wireless routing","author":"Couto","year":"2003"},{"key":"10.1016\/j.comnet.2026.112121_bib0009","series-title":"A new definition of expected transmission count as an ad-hoc network routing information","author":"Jasim","year":"2017"},{"key":"10.1016\/j.comnet.2026.112121_bib0010","series-title":"Proceedings of the Conference on Embedded Networked Sensor Systems","first-page":"14","article-title":"Taming the underlying challenges of reliable multihop routing in sensor networks","author":"Woo","year":"2003"},{"key":"10.1016\/j.comnet.2026.112121_bib0011","series-title":"2012 International Symposium on Telecommunication Technologies","first-page":"71","article-title":"A sinkhole attack detection scheme in mintroute wireless sensor networks","author":"Rassam","year":"2012"},{"key":"10.1016\/j.comnet.2026.112121_bib0012","series-title":"The International Conference on Distributed Computing Systems","first-page":"470","article-title":"Utility-based opportunistic routing in multi-hop wireless networks","author":"Wu","year":"2008"},{"key":"10.1016\/j.comnet.2026.112121_bib0013","first-page":"485","article-title":"Efficient opportunistic routing in utility-based ad hoc networks","author":"Lu","year":"2009","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/j.comnet.2026.112121_bib0014","series-title":"International Conference on Parallel Processing","first-page":"604","article-title":"Utility-based distributed routing in intermittently connected networks","author":"Li","year":"2008"},{"issue":"1","key":"10.1016\/j.comnet.2026.112121_bib0015","first-page":"83","article-title":"SEDUM: Exploiting social networks in utility-based distributed routing for","volume":"62","author":"Li","year":"2011","journal-title":"DTNs IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2026.112121_bib0016","article-title":"A failover mechanism for sfc requests in next-generation networks","author":"Niknami","year":"2024","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.comnet.2026.112121_bib0017","series-title":"Proceedings IEEE INFOCOM","first-page":"2085","article-title":"Tour: time-sensitive opportunistic utility-based routing in delay tolerant networks","author":"Xiao","year":"2013"},{"key":"10.1016\/j.comnet.2026.112121_bib0018","series-title":"IEEE Transactions on Parallel and Distributed Systems","article-title":"Time-sensitive utility-based single-copy routing in low-duty-cycle wireless sensor networks","author":"Xiao","year":"2014"},{"key":"10.1016\/j.comnet.2026.112121_bib0019","series-title":"IEEE S","first-page":"311","article-title":"Time-sensitive utility-based routing in duty-cycle wireless sensor networks with unreliable links","author":"Xiao","year":"2012"},{"key":"10.1016\/j.comnet.2026.112121_bib0020","series-title":"IEEE SECON","first-page":"301","article-title":"Deadline-sensitive opportunistic utility-based routing in cyclic mobile social networks","author":"Xiao","year":"2015"},{"key":"10.1016\/j.comnet.2026.112121_bib0021","series-title":"ICOIN","first-page":"194","article-title":"Location-aware utility-based routing for store-carry-forward message delivery","author":"Kimura","year":"2015"},{"key":"10.1016\/j.comnet.2026.112121_bib0022","series-title":"IEEE MASS","first-page":"588","article-title":"Utility-based routing in wireless ad hoc networks","author":"Zhou","year":"2004"},{"issue":"3","key":"10.1016\/j.comnet.2026.112121_bib0023","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1561\/1300000060","article-title":"Age of information: a new concept, metric, and tool","volume":"12","author":"Kosta","year":"2017","journal-title":"Found. Trends Netw."},{"issue":"3","key":"10.1016\/j.comnet.2026.112121_bib0024","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1109\/TIT.2018.2871079","article-title":"The age of information: real-time status updating by multiple sources","volume":"65","author":"Yates","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.comnet.2026.112121_bib0025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJWGS.2023.129324","article-title":"A survey on the optimisation of age of information in wireless networks","volume":"19","author":"Wang","year":"2023","journal-title":"Int. J. Web Grid Serv."},{"key":"10.1016\/j.comnet.2026.112121_bib0026","doi-asserted-by":"crossref","first-page":"6548","DOI":"10.1109\/TIT.2022.3180965","article-title":"Age of information in random access channels","author":"Chen","year":"2022","journal-title":"IEEE Trans. Inf. Theory,"},{"key":"10.1016\/j.comnet.2026.112121_bib0027","doi-asserted-by":"crossref","first-page":"24886","DOI":"10.1109\/JIOT.2024.3388019","article-title":"Minimizing age of information in non-orthogonal random access networks","author":"Liu","year":"2024","journal-title":"IEEE Internet Things J."},{"issue":"5","key":"10.1016\/j.comnet.2026.112121_bib0028","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/JSAC.2020.2980911","article-title":"Minimizing age of information with power constraints: multi-user opportunistic scheduling in multi-state time-varying channels","volume":"38","author":"Tang","year":"2020","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.comnet.2026.112121_bib0029","doi-asserted-by":"crossref","first-page":"7449","DOI":"10.1109\/TCOMM.2024.3415608","article-title":"Age of information minimization for opportunistic channel access","author":"Wang","year":"2024","journal-title":"IEEE Trans. Commun."},{"issue":"19","key":"10.1016\/j.comnet.2026.112121_bib0030","doi-asserted-by":"crossref","first-page":"14531","DOI":"10.1109\/JIOT.2021.3053768","article-title":"Discrete-time queueing model of age of information with multiple information sources","volume":"8","author":"Akar","year":"2021","journal-title":"IEEE Internet Things J."},{"issue":"5","key":"10.1016\/j.comnet.2026.112121_bib0031","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1109\/JSAC.2021.3065047","article-title":"Minimum achievable peak age of information under service preemptions and request delay","volume":"39","author":"Champati","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.comnet.2026.112121_bib0032","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/JSAIT.2022.3158421","article-title":"Age of information in multi-source updating systems powered by energy harvesting","author":"Abd-Elmagid","year":"2022","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112121_bib0033","first-page":"7865","article-title":"Age of processing-aware offloading decision for autonomous vehicles in 5G open RAN environment","author":"Ndikumana","year":"2023","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.comnet.2026.112121_bib0034","first-page":"9725","article-title":"Impact of network coding on age of information","author":"K\u00f6se","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.comnet.2026.112121_bib0035","series-title":"International Conference on Broadband and Wireless Computing, Communication and Applications","first-page":"263","article-title":"A new DTN routing strategy considering age of information","author":"Isayama","year":"2023"},{"key":"10.1016\/j.comnet.2026.112121_bib0036","series-title":"IEEE INFOCOM 2022-IEEE Conference on Computer Communications Workshops","first-page":"1","article-title":"Unreliable multi-hop networks routing protocol for age of information-sensitive communication","author":"Sawwan","year":"2022"},{"issue":"7","key":"10.1016\/j.comnet.2026.112121_bib0037","doi-asserted-by":"crossref","first-page":"228","DOI":"10.3390\/a15070228","article-title":"On edge pruning of communication networks under an age-of-Information framework","volume":"15","author":"Sawwan","year":"2022","journal-title":"Algorithms"},{"key":"10.1016\/j.comnet.2026.112121_bib0038","series-title":"The Statistical Analysis of Failure Time Data","author":"Kalbfleisch","year":"2011"},{"key":"10.1016\/j.comnet.2026.112121_bib0039","series-title":"Technical Report","article-title":"An exact lower confidence bound for the reliability of a series system where each component has an exponential time to failure distribution","author":"Sarkar","year":"1971"},{"key":"10.1016\/j.comnet.2026.112121_bib0040","series-title":"Technical Report","article-title":"A heuristic improvement of the Bellman-Ford algorithm","author":"Goldberg","year":"1993"},{"issue":"8\u20139","key":"10.1016\/j.comnet.2026.112121_bib0041","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.ipl.2010.02.001","article-title":"The floyd-Warshall algorithm on graphs with negative cycles","volume":"110","author":"Hougardy","year":"2010","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.comnet.2026.112121_bib0042","series-title":"The Universal Generating Function in Reliability Analysis and Optimization","volume":"6","author":"Levitin","year":"2005"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626001337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626001337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:22:14Z","timestamp":1777616534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626001337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":42,"alternative-id":["S1389128626001337"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112121","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Age of information utility-based routing in networks with unreliable links","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112121","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112121"}}