The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Real-time status: How often should one update?
Abstract
Increasingly ubiquitous communication networks and connectivity via portable devices have engendered a host of applications in which sources, for example people and environmental sensors, send updates of their status to interested recipients. These applications desire status updates at the recipients to be as timely as possible; however, this is typically constrained by limited network resources. In this paper, we employ a time-average age metric for the performance evaluation of status update systems. We derive general methods for calculating the age metric that can be applied to a broad class of service systems. We apply these methods to queue-theoretic system abstractions consisting of a source, a service facility and monitors, with the model of the service facility (physical constraints) a given. The queue discipline of first-come-first-served (FCFS) is explored. We show the existence of an optimal rate at which a source must generate its information to keep its status as timely as possible at all its monitors. This rate differs from those that maximize utilization (throughput) or minimize status packet delivery delay. While our abstractions are simpler than their real-world counterparts, the insights obtained, we believe, are a useful starting point in understanding and designing systems that support real time status updates.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Wireless sensor networks for habitat monitoring
Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., & Anderson, J. (2002) · Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications · doi:10.1145/570738.570751 · Cited by 4,166
Papadimitratos, P., La Fortelle, A., Evenssen, K., Brignolo, R., & Cosenza, S. (2009) · IEEE Communications Magazine · doi:10.1109/mcom.2009.5307471 · Cited by 870
Minimizing age of information in vehicular networks
Kaul, S., Gruteser, M., Rai, V., & Kenney, J. (2011) · 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks · doi:10.1109/sahcn.2011.5984917 · Cited by 860
Self-citationEnergy-efficient surveillance system using wireless sensor networks
He, T., Krishnamurthy, S., Stankovic, J. A., Abdelzaher, T., Luo, L., Stoleru, R., Yan, T., Gu, L., Hui, J., & Krogh, B. (2004) · Proceedings of the 2nd international conference on Mobile systems, applications, and services · doi:10.1145/990064.990096 · Cited by 743
The theory of probabilities and telephone conversations
Erlang, A. K. (1909) · Cited by 392
A scalable Web cache consistency architecture
Yu, H., Breslau, L., & Shenker, S. J. (1999) · doi:10.1145/316188.316219 · Cited by 146
ETL queues for active data warehousing
Karakasidis, A., Vassiliadis, P., & Pitoura, E. (2005) · Information Quality in Information Systems · doi:10.1145/1077501.1077509 · Cited by 96
Deriving deadlines and periods for real-time update transactions
Xiong, M., & Ramamritham, K. (2004) · IEEE Transactions on Computers · doi:10.1109/tc.2004.1275297 · Cited by 90
Cited by
Deep Learning With Edge Computing: A Review
Chen, J., & Ran, X. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2921977 · Cited by 1,540
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-citationA Learning-Based Incentive Mechanism for Federated Learning
Zhan, Y., Li, P., Qu, Z., Zeng, D., & Guo, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2967772 · Cited by 602
AoI-Minimal Trajectory Planning and Data Collection in UAV-Assisted Wireless Powered IoT Networks
Hu, H., Xiong, K., Qu, G., Ni, Q., Fan, P., & Letaief, K. B. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3012835 · Cited by 355
Metadata
- Authors
- Kaul, S., Yates, R., & Gruteser, M.
- Venue
- 2012 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2012-03
- Pages
- 2731-2735
- OpenAlex
- W1993918491
- Cited by
- 2,360
- References
- 8
- FWCI
- 4.31
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Real-time status: How often should one update? https://app.cochat.ai/papers/10.1109/infcom.2012.6195689
- The paper
- Kaul, S., Yates, R., & Gruteser, M. (2012). Real-time status: How often should one update? 2012 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2012.6195689
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.
