arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.00850cs.ITcs.NIcs.SYeess.SPeess.SYmath.IT
收藏

信息年龄与成本约束下的失真最小化

Distortion Minimization with Age of Information and Cost Constraints

Jayanth S, Nikolaos Pappas, Rajshekhar V Bhat

AI总结:

针对无线信道下监控随机过程的及时传输问题,提出以平稳随机策略最小化失真并约束信息年龄,证明二维马尔可夫链可集总并推导期望AoI表达式。

摘要:

我们考虑一个源监控随机过程,并通过无线ON/OFF信道向目的地传输及时信息。我们假设一旦源采样数据,采样数据必须经过处理以识别随机过程的状态。处理可以在传输前的源端进行,也可以在传输后的目的地进行。目标是在将衡量信息及时性的信息年龄(AoI)保持在某一阈值以下的同时,最小化失真。我们使用平稳随机策略(SRP)框架来解决所提出的问题。我们证明了以AoI和瞬时失真为状态的二维离散时间马尔可夫链是可集总的,并获得了在SRP下期望AoI的表达式。

英文摘要:

We consider a source monitoring a stochastic process with a transmitter to transmit timely information through a wireless ON/OFF channel to a destination. We assume that once the source samples the data, the sampled data has to be processed to identify the state of the stochastic process. The processing can take place either at the source before transmission or after transmission at the destination. The objective is to minimize the distortion while keeping the age of information (AoI) that measures the timeliness of information under a certain threshold. We use a stationary randomized policy (SRP) framework to solve the formulated problem. We show that the two-dimensional discrete-time Markov chain considering the AoI and instantaneous distortion as the state is lumpable and we obtain the expression for the expected AoI under the SRP.

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

↑