Age of Incorrect Information for Generic Discrete-Time Markov Sources
Konstantinos Bountrogiannis, Anthony Ephremides, Panagiotis Tsakalides, and George Tzagkarakis

TL;DR
This paper develops a threshold-based framework for minimizing Age of Incorrect Information in Markov sources over noisy channels with rate constraints, providing near-optimal policies with reduced complexity.
Contribution
It introduces a multiple-threshold policy class for AoII optimization in Markov sources, along with a computationally efficient algorithm leveraging the threshold structure.
Findings
Threshold policies outperform periodic scheduling.
Multiple-threshold policy matches optimal performance.
Proposed algorithms reduce computational complexity.
Abstract
This work introduces a framework for analyzing the Age of Incorrect Information (AoII) in a real-time monitoring system with a generic discrete-time Markov source. We study a noisy communication system employing a hybrid automatic repeat request (HARQ) protocol, subject to a transmission rate constraint. The optimization problem is formulated as a constrained Markov decision process (CMDP), and it is shown that there exists an optimal policy that is a randomized mixture of two stationary policies. To overcome the intractability of computing the optimal stationary policies, we develop a multiple-threshold policy class where thresholds depend on the source, the receiver, and the packet count. By establishing a Markov renewal structure induced by threshold policies, we derive closed-form expressions for the long-term average AoII and transmission rate. The proposed policy is constructed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
