Differential Encoding for Real-Time Status Updates

Bhambay, Sanidhay; Poojary, Sudheer; Parag, Parimal

doi:10.1109/wcnc.2017.7925904

Cited by 14 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to these queue/network focused analyses, AoI has also appeared in various application areas, including timely updates via replicated servers [47]- [50], timely source coding [51]- [53], dissemination of channel state information [54]- [57], differential encoding of temporally correlated updates [58], correlated updates from multiple cameras [59], periodic updates from correlated IoT sources [60], mobile cloud gaming [61], and game-theoretic approaches to network resource allocation for updating sources [62]- [64].…”

Section: B Prior Workmentioning

confidence: 99%

The Age of Information in Networks: Moments, Distributions, and Sampling

Yates¹

2018

Preprint

View full text Add to dashboard Cite

We examine a source providing status updates to monitors through a network with state defined by a continuous-time finite Markov chain. Using an age of information metric, we characterize timeliness by the vector of ages tracked by the monitors. Based on a stochastic hybrid systems approach, we derive first order linear differential equations for the temporal evolution of both the age moments and a moment generating function (MGF) of the age vector components. We show that the existence of a non-negative fixed point for the first moment guarantees convergence of all higher order moments as well as a convergence region for the stationary MGF vector of the age. The stationary MGF vector is then found for the age on a line network of preemptive memoryless servers. It is found that the age at a node is identical in distribution to the sum of independent exponential service times. This observation is then generalized to linear status sampling networks in which each node receives samples of the update process at each preceding node according to a renewal point process. For each node, the age is shown to be identical in distribution to a sum of independent renewal process age random variables.

show abstract

Section: B Prior Workmentioning

confidence: 99%

The Age of Information in Networks: Moments, Distributions, and Sampling

Yates¹

2018

Preprint

View full text Add to dashboard Cite

show abstract

“…We now illustrate our recipe for construction of prefix-free codes that yield minimum average age for memoryless update schemes when P is a Zipf distribution 4 . Specifically, we illustrate our qualitative results using the Zipf(s, N ) distribution with alphabet X = {1, • • • , N } and given by…”

Section: Numerical Results For Zipf Distributionmentioning

confidence: 99%

“…In particular, even if a message is transmitted with low delay, if the receiver has to wait for subsequent messages, the information conveyed by the message looses its timeliness. A heuristically appealing metric that can capture the notion of timeliness of information in a variety of applications, termed its age, was first used in [13] for a setting involving queuing and link layer delays and was analyzed systematically for a queuing model in [14]; see [2], [4], [11], [15], [22], [24] for a sampling of subsequent developments in problems related to minimum age scheduling. In this paper, we initiate a systematic study of the design of source codes with the goal of minimizing the age of the information at the receiver.…”

Section: Introductionmentioning

confidence: 99%

Optimal Source Codes for Timely Updates

Mayekar

Parag

Tyagi

2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

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 minimum average age at the receiver. We show that the asymptotic minimum average age can be roughly attained by Shannon codes for a tilted version of the original pmf generating the symbols, which can be computed easily by solving an optimization problem. Furthermore, we exhibit an example with alphabet X where the Shannon codes for the original pmf incur an asymptotic average age of a factor O( log |X |) more than that achieved by our codes. Underlying our prescription for optimal codes is a new variational formula for integer moments of random variables, which may be of independent interest. Also, we discuss possible extensions of our formulation to randomized schemes and erasure channel, and include a treatment of the related problem of source coding for minimum average queuing delay. T t=1 A(t).This formulation is apt for the timely update problem where the transmitter need not send each update and strives only to reduce the average age of the information at the receiver. 1 Our analysis of average age extends to randomized schemes as well; see Section VI.

show abstract

“…Not just in theory, AoI and PAoI are also used in many scenarios, including the vehicular network [64], correlated updates from multiple cameras [65], the context of industrial cyber-physical system [66], CSMA/CA based wireless networks [67], real-life connections [68], TCP/IP links for WiFi, 4G-LTE, 3G, 2G and Ethernet services [69], exchanging systems [70,71], shared-access channel, differential encoding of temporally correlated updates [72], and game-theoretic approaches to network resource allocation for updating sources [73].…”

Section: Real-time Guaranteementioning

confidence: 99%

Ultra-reliable and low-latency communications: applications, opportunities and challenges

Feng

Lai

Luo

et al. 2021

Sci. China Inf. Sci.

View full text Add to dashboard Cite

In the upcoming 5G and beyond systems, ultra-reliable and low latency communication (URLLC) has been considered as the key enabler to support diverse mission-critical services, such as industrial automation, remote healthcare, and intelligent transportation. However, the two stringent requirements of URLLC: extremely low latency and ultra-strict reliability have posed great challenges in system designing. In this article, the basic concepts and the potential applications of URLLC are first introduced. Then, the state-ofthe-art research of URLLC in the physical layer, link layer and the network layer are overviewed. In addition, some potential research topics and challenges are also identified.

show abstract

Differential Encoding for Real-Time Status Updates

Cited by 14 publications

References 8 publications

The Age of Information in Networks: Moments, Distributions, and Sampling

The Age of Information in Networks: Moments, Distributions, and Sampling

Optimal Source Codes for Timely Updates

Ultra-reliable and low-latency communications: applications, opportunities and challenges

Contact Info

Product

Resources

About