Joint freshness and dispersion control for a generate-at-will status update link modeled as a finite-state Markov wireless channel is studied to minimize the long-run probability that either AoI or age dispersion exceeds a prescribed threshold under an average transmission rate constraint.
Abstract
Age of information (AoI) has become a standard design objective for timely monitoring as it measures the freshness of the latest update at a receiver. AoI alone, however, is insufficient in goal-oriented applications where decisions depend on consecutive observations. Age dispersion complements AoI by measuring the generation-time separation between consecutive updates. In this paper, we study joint freshness and dispersion control for a generate-at-will status update link modeled as a finite-state Markov wireless channel. The objective is to minimize the long-run probability that either AoI or age dispersion exceeds a prescribed threshold under an average transmission rate constraint. For channel-dependent randomized transmission policies, we derive exact matrix expressions for the stationary joint distribution of AoI and dispersion. For reversible channels, mean dispersion is lower bounded by the reciprocal of the delivery throughput, and the difference is an explicit non-negative variance term for which we establish the exact equality condition. We then formulate the adaptive joint-threshold control problem as a constrained Markov decision process and prove that it admits an exact finite-state representation whose size scales linearly with the number of channel states and the threshold levels. Simulation results show that the controller reduces joint threshold violations by 37.3% relative to adaptive AoI-only control under the same transmission budget, while increasing mean AoI by 8.3%.
This paper develops a tractable analytical framework for analyzing and optimizing the Age of Information (AoI) and validate the proposed AoI analysis via extensive simulations, demonstrating a tight agreement between analysis and simulation.
Yue-Qi Chen, Si-Qi Fan, Zhuo-Yi Zhao et al.· 0 citations
In this paper, we consider a discrete-time pull-based remote estimation system involving an information source and a remote monitor where the information source is a finite-state irreducible discrete-time Markov chain (DTMC) process. In this system, the remote monitor sends a pull request towards the source which respo...
Ismail Cosandal, S. Ulukus, Nail Akar· 0 citations
Timely information dissemination is essential in modern communication systems, where low informational latency is critical for networked control, monitoring, and real-time decision-making. The Age of Information (AoI) has emerged as a fundamental metric for quantifying information freshness at the receiver. A key chall...
Yoshiaki Inoue, M. Mandjes, L. Ravner· 0 citations
We study the optimal sampling and transmission policies for a transmitter communicating with n gossiping receivers with the objective of tracking a source's status over time using a semantic freshness metric: Version Age of Information (VAoI). The transmitter observes the version changes in the source, and can acquire...
Goal-oriented communication protocols are explicitly designed to support the objectives of target applications, such as the monitoring and control of remote processes, while minimizing data traffic. This study considers a transmitter node that observes the environment state and sends it to a remote agent, which then pe...
Romain Planchon, F. Chiariotti, Federico Mason et al.· 0 citations
We study the problem of scheduling packets on communication channels whose service availability is modeled by independent Gilbert–Elliot (ON,OFF) Markov chains. Classical models assume that channel states are always known to the scheduler and that transmission is perfect for ON channels. We consider the often more real...
Thomas Hira, U. Ayesta, R. Righter et al.· Probability in the engineeri...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.