The DOI matches its Crossref record.
The Age of Information in Multihop Networks
Open accessAbstract
Information updates in multihop networks such as Internet of Things (IoT) and intelligent transportation systems have received significant recent attention. In this paper, we minimize the age of a single information flow in interference-free multihop networks. When preemption is allowed and the packet transmission times are exponentially distributed, we prove that a preemptive last-generated, first-served (LGFS) policy results in smaller age processes across all nodes in the network than any other causal policy (in a stochastic ordering sense). In addition, for the class of new-better-than-used (NBU) distributions, we show that the non-preemptive LGFS policy is within a constant age gap from the optimum average age. In contrast, our numerical result shows that the preemptive LGFS policy can be very far from the optimum for some NBU transmission time distributions. Finally, when preemption is prohibited and the packet transmission times are arbitrarily distributed, the non-preemptive LGFS policy is shown to minimize the age processes across all nodes in the network among all work-conserving policies (again in a stochastic ordering sense). Interestingly, these results hold under quite general conditions, including (1) arbitrary packet generation and arrival times, and (2) for minimizing both the age processes in stochastic ordering and any non-decreasing functional of the age processes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Age of Information: An Introduction and Survey
Yates, R. D., Sun, Y., Brown, D. R., Kaul, S. K., Modiano, E., & Ulukus, S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3065072 · Cited by 1,160
Self-citationWang, Y., Su, Z., Guo, S., Dai, M., Luan, T. H., & Liu, Y. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3263909 · Cited by 357
Metadata
- Authors
- Bedewy, A. M., Sun, Y., & Shroff, N. B.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2019-06
- Volume
- 27
- Issue
- 3
- Pages
- 1248-1257
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2780247015
- Cited by
- 166
- References
- 0
- FWCI
- 12.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Age of Information in Multihop Networks. https://app.cochat.ai/papers/10.1109/tnet.2019.2915521
- The paper
- Bedewy, A. M., Sun, Y., & Shroff, N. B. (2019). The Age of Information in Multihop Networks. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2019.2915521
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.