2020
DOI: 10.1109/tit.2020.2983151
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Source Codes for Timely Updates

Abstract: A transmitter observing a sequence of independent and identically distributed random variables seeks to keep a receiver updated about its latest observations. The receiver need not be apprised about each symbol seen by the transmitter, but needs to output a symbol at each time instant t. If at time t the receiver outputs the symbol seen by the transmitter at time U (t) ≤ t, the age of information at the receiver at time t is t − U (t). We study the design of lossless source codes that enable transmission with … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(22 citation statements)
references
References 27 publications
(81 reference statements)
0
22
0
Order By: Relevance
“…4(c). Even though we split the update rates among different routes for K − 1 = 4 files that have some of the highest freshness (files 26,28,29,30), their freshness loss is negligible as shown in Fig. 4(c).…”
Section: Numerical Resultsmentioning
confidence: 99%
“…4(c). Even though we split the update rates among different routes for K − 1 = 4 files that have some of the highest freshness (files 26,28,29,30), their freshness loss is negligible as shown in Fig. 4(c).…”
Section: Numerical Resultsmentioning
confidence: 99%
“…where the first equality is an identity, and in the second equality we used (12) and (13) and also added and subtracted the term N k=0 u T k R k u k to and from the right-hand side. Rearranging the terms in the above relation, we find…”
Section: Resultsmentioning
confidence: 99%
“…They showed that age in a network is in fact minimized at an optimal operating point that lies between the extremes of maximum throughput and minimum delay. Age of information have been adopted in various applications since then, and accordingly different related metrics such as average age of information and peak age of information have been proposed, see e.g., [2]- [12]. The importance of age of information is due to the fact that timeliness, which is characterized by age of information, is an emerging requirement for cyberphysical systems [13].…”
Section: A Literature Survey On Aoimentioning
confidence: 99%
“…By assuming φ i ≥ β, i.e., by disregarding (•) + in (29), we solve 2n i=1 u i = C for β. Then, we compare the smallest φ i which is larger than zero in (28) with β. If we have φ i ≥ β, then it implies that u i ≥ 0 for all remaining i.…”
Section: Proofmentioning
confidence: 99%