arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.18063cs.ITcs.SYeess.SPeess.SYmath.IT
收藏

采样率约束下CTMC信息源的AoII最优采样

AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints

Ismail Cosandal, Nail Akar, Sennur Ulukus

AI总结:

针对采样率约束下CTMC信息源的平均AoII最小化问题,提出基于吸收MC的低复杂度CSMDP松弛求解方法,可处理上百状态的通用CTMC。

摘要:

我们研究一种传感器,该传感器对基于N状态连续时间马尔可夫链(CTMC)的信息源过程进行采样,并将观测到的源状态发送至负责及时跟踪源过程的远程监控端。源过程与监控端过程之间的失配由错误信息年龄(AoII)量化,失配持续时间越长,AoII的惩罚越高,我们的目标是在平均采样率约束下最小化平均AoII。我们假设存在完美反向信道,因此传感器在发起传输或抢占正在进行的传输时,可获知估计值信息。首先,通过将该问题建模为平均成本约束半马尔可夫决策过程(CSMDP),我们证明该问题的结构可导出最优阈值策略:当AoII超过一个同时取决于源过程与监控端过程瞬时值的阈值时,传感器发起传输。然而,由于在该通用设定下获取最优策略的复杂度极高,我们考虑了一个松弛问题,其中阈值仅允许依赖于估计值。我们证明该松弛问题可通过一种基于吸收马尔可夫链(MC)理论的新型CSMDP公式求解,计算复杂度为$\boldsymbol{\text{O}(N^4)}$,能够为状态数超过一百的通用CTMC获取最优策略。

英文摘要:

We consider a sensor that samples an $N$-state continuous-time Markov chain (CTMC)-based information source process, and transmits the observed state of the source, to a remote monitor tasked with timely tracking of the source process. The mismatch between the source and monitor processes is quantified by age of incorrect information (AoII), which penalizes the mismatch as it stays longer, and our objective is to minimize the average AoII under an average sampling rate constraint. We assume a perfect reverse channel and hence the sensor has information of the estimate while initiating a transmission or preempting an ongoing transmission. First, by modeling the problem as an average cost constrained semi-Markov decision process (CSMDP), we show that the structure of the problem gives rise to an optimum threshold policy for which the sensor initiates a transmission once the AoII exceeds a threshold depending on the instantaneous values of both the source and monitor processes. However, due to the high complexity of obtaining the optimum policy in this general setting, we consider a relaxed problem where the thresholds are allowed to be dependent only on the estimate. We show that this relaxed problem can be solved with a novel CSMDP formulation based on the theory of absorbing MCs, with a computational complexity of $\mathcal{O}(N^4)$, allowing one to obtain optimum policies for general CTMCs with over a hundred states.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑