Age of Incorrect Information (AoII) is a newly introduced performance metric that considers communication goals. Therefore, comparing with traditional performance metrics and the recently introduced metric - Age of Information (AoI), AoII achieves better performance in many real-life applications. However, the fundamental nature of AoII has been elusive so far. In this paper, we consider the AoII in a system where a transmitter sends updates about a multi-state Markovian source to a remote receiver through an unreliable channel. The communication goal is to minimize AoII subject to a power constraint. We cast the problem into a Constrained Markov Decision Process (CMDP) and prove that the optimal policy is a mixture of two deterministic threshold policies. Afterward, by leveraging the notion of Relative Value Iteration (RVI) and the structural properties of threshold policy, we propose an efficient algorithm to find the threshold policies as well as the mixing coefficient. Lastly, numerical results are laid out to highlight the performance of AoII-optimal policy.
翻译:错误信息时代(AoII)是一个新引入的绩效衡量标准,它考虑到通信目标。因此,与传统的绩效衡量标准和最近引入的衡量标准――信息年龄(AoI)相比,AoII在许多实际应用中取得了更好的业绩。然而,AoII的基本性质迄今为止一直难以实现。在本文中,我们认为AoII是一个系统,一个发射机通过不可靠的频道向远程接收器发送多州马尔科维亚源的最新消息。通信目标是尽量减少AoII受到电力限制的情况。我们把问题放到一个 Constraced Markov 决策程序(CMDP)中,并证明最佳政策是两种确定性门槛政策的组合。之后,我们利用相对值迭代(RVI)概念和门槛政策的结构特性,提出了一种有效的算法,以找到阈值政策和混合系数。最后,提出了数字结果,以突出AoII-optimal政策的业绩。