# Information Aging Through Queues: A Mutual Information Perspective

@article{Sun2018InformationAT, title={Information Aging Through Queues: A Mutual Information Perspective}, author={Yin Sun and Benjamin Cyr}, journal={2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)}, year={2018}, pages={1-5} }

In this paper, we propose a new measure for the freshness of information, which uses the mutual information between the real-time source value and the delivered samples at the receiver to quantify the freshness of the information contained in the delivered samples. Hence, the “aging” of the received information can be interpreted as a procedure that the above mutual information reduces as the age grows. In addition, we consider a sampling problem, where samples of a Markov source are taken and… Expand

#### 39 Citations

Sampling for Remote Estimation through Queues: Age of Information and Beyond

- Computer Science
- 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)
- 2019

This paper generalizes the previous study by investigating a problem of sampling a stationary Gauss-Markov process named the Ornstein-Uhlenbeck (OU) process, where it aims to find useful insights for solving the problems of sampling more general signals. Expand

Uncertainty-of-Information Scheduling: A Restless Multi-armed Bandit Framework

- Computer Science, Mathematics
- ArXiv
- 2021

This paper proposes using the uncertainty of information (UoI), measured by Shannon’s entropy, as a metric for information freshness, and develops a Whittle index policy that is near-optimal for the RMAB after proving its indexability. Expand

Information Freshness for Timely Detection of Status Changes

- Computer Science, Engineering
- 2020 54th Annual Conference on Information Sciences and Systems (CISS)
- 2020

The connection between Age of Information (AoI) in network theory, information uncertainty in information theory, and detection delay in time series analysis is established and the accumulative GAoI is still an affine function of the expected detection delay, which indicates the versatility ofGAoI in capturing information freshness in dynamic systems. Expand

Non-linear Age of Information in a Discrete Time Queue: Stationary Distribution and Average Performance Analysis

- Computer Science, Mathematics
- ICC 2020 - 2020 IEEE International Conference on Communications (ICC)
- 2020

This paper considers a status update communication system consisting of a source-destination link with timeliness requirements and obtains a general formula of the stationary distribution of the AoI and a methodology for analyzing general non-linear age functions for this type of systems. Expand

The Cost of Delay in Status Updates and Their Value: Non-Linear Ageing

- Computer Science, Mathematics
- IEEE Transactions on Communications
- 2020

The cost of update delay (CoUD) metric is introduced to characterize the cost of having stale information at the destination and the value of information of update (VoIU) metric that captures the reduction of CoUD upon reception of an update is introduced. Expand

Relationship between Age and Value of Information for a Noisy Ornstein–Uhlenbeck Process

- Computer Science, Medicine
- Entropy
- 2021

The VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process is investigated, and the effects of correlation and noise on their relationship are explored, and logarithmic, exponential and linear dependencies are found. Expand

Age-optimal Sampling and Transmission Scheduling in Multi-Source Systems

- Mathematics, Computer Science
- MobiHoc
- 2019

It is proved that, for any given sampling strategy, the Maximum Age First (MAF) scheduling strategy provides the best age performance among all scheduling strategies. Expand

Age of Information: An Introduction and Survey

- Computer Science, Mathematics
- IEEE Journal on Selected Areas in Communications
- 2021

The current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients is described and AoI timeliness metrics are described. Expand

A Framework for Characterising the Value of Information in Hidden Markov Models

- Computer Science, Mathematics
- ArXiv
- 2021

Numerical results illustrate that the proposed VoI framework can support the timely transmission in status update systems, and it can also capture the correlation property of the underlying random process and the noise in the transmission environment. Expand

A Value of Information Framework for Latent Variable Models

- Computer Science, Mathematics
- GLOBECOM 2020 - 2020 IEEE Global Communications Conference
- 2020

The mutual information between the current status at the source node and the observed noisy measurements at the destination node is used to evaluate the information value, which gives the theoretical interpretation of the reduction in uncertainty in theCurrent status given that the authors have measurements of the latent process. Expand

#### References

SHOWING 1-10 OF 21 REFERENCES

Minimizing the Age of Information Through Queues

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2019

The Last-Generated, First-Serve (LGFS) scheduling policy, in which the packet with the earliest generation time is processed with the highest priority, is proposed, and the age optimality results of LCFS-type policies are established. Expand

Age-optimal information updates in multihop networks

- Mathematics, Computer Science
- 2017 IEEE International Symposium on Information Theory (ISIT)
- 2017

This paper proves that if the packet transmission times over the network links are exponentially distributed, it is proved that a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy. Expand

Remote estimation of the Wiener process over a channel with random delay

- Mathematics, Computer Science
- 2017 IEEE International Symposium on Information Theory (ISIT)
- 2017

This paper proves that the optimal sampling strategy is a threshold policy, and finds the optimal threshold, which is determined by the sampling frequency constraint and how much the Wiener process varies during the channel delay. Expand

Update or wait: How to keep your data fresh

- Computer Science, Mathematics
- IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications
- 2016

This work introduces a penalty function to characterize the level of “dissatisfaction” on data staleness, and forms the average age penalty minimization problem as a constrained semi-Markov decision process (SMDP) with an uncountable state space. Expand

The Age of Information in Multihop Networks

- Computer Science, Mathematics
- IEEE/ACM Transactions on Networking
- 2019

This paper proves 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), and shows that the non-preemptive LGFS policy is within a constant age gap from the optimum average age. Expand

Age and value of information: Non-linear age case

- Mathematics, Computer Science
- 2017 IEEE International Symposium on Information Theory (ISIT)
- 2017

The concept of information ageing is expanded by introducing the Cost of Update Delay (CoUD) metric to characterize the cost of having stale information at the destination and the Value of Information of Update (VoIU) metric that captures the reduction of CoUD upon reception of an update. Expand

Optimizing data freshness, throughput, and delay in multi-server information-update systems

- Computer Science, Mathematics
- 2016 IEEE International Symposium on Information Theory (ISIT)
- 2016

It is proved that a preemptive Last Generated First Served (LGFS) policy simultaneous optimizes the age, throughput, and delay performance in infinite buffer queueing systems and age-optimality for the LGFS policy for any finite queue size is shown. Expand

Age-optimal updates of multiple information flows

- Computer Science, Mathematics
- IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
- 2018

Two online scheduling policies are proposed and are shown to be (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense. Expand

Bits through queues

- Computer Science
- IEEE Trans. Inf. Theory
- 1996

It is shown that intuition is wrong: the Shannon capacity of the single-server queue is actually higher than /spl mu/ bits/sec, because information can be encoded into the arrival epochs. Expand

Optimal communication scheduling and remote estimation over an additive noise channel

- Computer Science, Mathematics
- Autom.
- 2018

This analysis yields some rather surprising results such as a phase-transition phenomenon in the number of used transmission opportunities, which was not encountered in the noiseless communication setting. Expand