A framework for characterizing the value of information in hidden Markov models
In this paper, a general framework is formalised to characterise the value of information (VoI)
in hidden Markov models. Specifically, the VoI is defined as the mutual information between …
in hidden Markov models. Specifically, the VoI is defined as the mutual information between …
Freshness based cache updating in parallel relay networks
We consider a system consisting of a server, which receives updates for N files according to
independent Poisson processes. The goal of the server is to deliver the latest version of the …
independent Poisson processes. The goal of the server is to deliver the latest version of the …
Timely gossiping with file slicing and network coding
We consider a system consisting of a large network of n users and a library of files, wherein
inter-user communication is established based upon gossip mechanisms. Each file is …
inter-user communication is established based upon gossip mechanisms. Each file is …
Toward Optimal Tradeoff Between Data Freshness and Update Cost in Information-Update Systems
In this article, we consider a discrete-time information-update system, where a service
provider can proactively retrieve information from the information source to update its data …
provider can proactively retrieve information from the information source to update its data …
Remote estimation for dynamic iot sources under sublinear communication costs
We investigate a remote estimation system with communication cost for multiple Internet-of-
Things sensors, in which the state of each sensor changes according to a Wiener process …
Things sensors, in which the state of each sensor changes according to a Wiener process …
Short blocklength process monitoring and scheduling: Resolution and data freshness
In cyber-physical systems (CPSs) and internet-of-things applications, various sensor-
actuator pairs are deployed for control purposes which require timely online communication …
actuator pairs are deployed for control purposes which require timely online communication …
Sample, quantize, and encode: Timely estimation over noisy channels
The effects of quantization and coding on the estimation quality of Gauss-Markov processes
are considered, with a special attention to the Ornstein-Uhlenbeck process. Samples are …
are considered, with a special attention to the Ornstein-Uhlenbeck process. Samples are …
An online learning approach to optimizing time-varying costs of aoi
V Tripathi, E Modiano - Proceedings of the Twenty-second International …, 2021 - dl.acm.org
We consider systems that require timely monitoring of sources over a communication
network, where the cost of delayed information is unknown, time-varying and possibly …
network, where the cost of delayed information is unknown, time-varying and possibly …
Benefits of coding on age of information in broadcast networks
X Chen, SS Bidokhti - 2019 IEEE Information Theory Workshop …, 2019 - ieeexplore.ieee.org
Age of Information (AoI) is studied in two-user broad-cast networks with feedback, and lower
and upper bounds are derived on the expected weighted sum AoI of the users. In particular …
and upper bounds are derived on the expected weighted sum AoI of the users. In particular …
[HTML][HTML] Age of information for remote sensing with uncoordinated finite-horizon access
We analyze a remote sensing system in the Internet of things, where uncoordinated nodes
send status updates to a common receiver to achieve information freshness, quantified …
send status updates to a common receiver to achieve information freshness, quantified …