论文标题
年龄优化的低功率状态随着时间相关的褪色频道的更新
Age-Optimal Low-Power Status Update over Time-Correlated Fading Channel
论文作者
论文摘要
在本文中,我们考虑在状态更新系统中进行传输调度,该系统是定期生成的,并通过Gilbert-Elliott褪色频道传输。目的是最大程度地减少目的地的长期平均信息年龄(AOI)在平均能量限制下。我们考虑两种实际情况来获得通道状态信息(CSI):(i)\ emph {无通道传感}和(ii)\ emph {带有延迟的通道传感}。对于案例(i),当传输后在发射器上接收ACK/NACK时,会揭示通道状态,但是当没有发生变速箱时,未揭示通道状态。因此,我们必须设计能够平衡跨能量,AOI,渠道探索和渠道剥削的方案。该问题被提出为受约束的部分可观察到的马尔可夫决策过程问题(POMDP)。为了降低算法的复杂性,我们表明最佳策略是不超过两个固定确定性策略的随机混合物,每个策略在渠道上的信念中都是阈值类型的。对于情况(ii),(延迟)CSI可通过通道传感在发射机上可用。在这种情况下,权衡仅在AOI和能源消耗之间,并且该问题被作为受约束的MDP提出。最佳策略显示出与(i)相似的结构,但具有与AOI相关的阈值。最后,对所提出的结构感知算法的性能进行了数值评估,并将其与贪婪的政策进行了比较。
In this paper, we consider transmission scheduling in a status update system, where updates are generated periodically and transmitted over a Gilbert-Elliott fading channel. The goal is to minimize the long-run average age of information (AoI) at the destination under an average energy constraint. We consider two practical cases to obtain channel state information (CSI): (i) \emph{without channel sensing} and (ii) \emph{with delayed channel sensing}. For case (i), the channel state is revealed when an ACK/NACK is received at the transmitter following a transmission, but when no transmission occurs, the channel state is not revealed. Thus, we have to design schemes that balance tradeoffs across energy, AoI, channel exploration, and channel exploitation. The problem is formulated as a constrained partially observable Markov decision process problem (POMDP). To reduce algorithm complexity, we show that the optimal policy is a randomized mixture of no more than two stationary deterministic policies each of which is of a threshold-type in the belief on the channel. For case (ii), (delayed) CSI is available at the transmitter via channel sensing. In this case, the tradeoff is only between the AoI and energy consumption and the problem is formulated as a constrained MDP. The optimal policy is shown to have a similar structure as in case (i) but with an AoI associated threshold. Finally, the performance of the proposed structure-aware algorithms is evaluated numerically and compared with a Greedy policy.