论文标题

及时同步与零星状态更改

Timely Synchronization with Sporadic Status Changes

论文作者

Deng, Chenghao, Yang, Jing, Pan, Changyong

论文摘要

在本文中,我们考虑了一个状态更新系统,在该系统中,发射器通过速率限制的链接将其监控信号的状态更新发送到目的地。我们考虑在离散时间点仅在离散时间点更改的情况下的情况。目的是让目的地在状态变更发生后及时与源同步。问题使问题复杂化的是,由于链接率约束,传输需要多个时间插槽。因此,当监视信号的状态更改并且尚未完成前一个传输时,发射器必须决定切换或跳过新更新。我们采用一个称为“同步年龄”(AOS)的度量标准,以测量目的地与源相同步时的“不满”。然后,本文的目的是通过设计发射器的最佳传输策略来最大程度地降低时间平均值。我们将问题提出为马尔可夫决策过程(MDP),并证明了最佳政策的多阈值结构。基于此,我们建议使用MDP值迭代的低计算复合算法。然后,我们通过模拟评估了多阈值政策的性能,并将其与两个基线政策和AOI-Tipimal政策进行比较。

In this paper, we consider a status updating system where the transmitter sends status updates of the signal it monitors to the destination through a rate-limited link. We consider the scenario where the status of the monitored signal only changes at discrete time points. The objective is to let the destination be synchronized with the source in a timely manner once a status change happens. What complicates the problem is that the transmission takes multiple time slots due to the link-rate constraint. Thus, the transmitter has to decide to switch or to skip a new update when the status of the monitored signal changes and it has not completed the transmission of the previous one yet. We adopt a metric called "Age of Synchronization" (AoS) to measure the "dissatisfaction" of the destination when it is desynchronized with the source. Then, the objective of this paper is to minimize the time-average AoS by designing optimal transmission policies for the transmitter. We formulate the problem as a Markov decision process (MDP) and prove the multi-threshold structure of the optimal policy. Based on that, we propose a low computational-complexity algorithm for the MDP value iteration. We then evaluate the performance of the multi-threshold policy through simulations and compare it with two baseline policies and the AoI-optimal policy.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源