论文标题
在资源受限网络中，AOI最小化的单个阈值数据包计划策略
Single Threshold Packet Scheduling Policy for AoI Minimization in Resource-Constrained Network
论文作者
论文摘要
本文研究了具有随机数据包到达和随机擦除通道的网络的平均信息年龄（AOI）和传输成本之间的权衡。具体而言，我们将资源约束的AOI最小化问题建模为受约束的马尔可夫决策过程（CMDP），并为其提出一个低复杂性的单个阈值数据包计划策略。拟议政策的主要优点是其实施的易处理性和便利性。提议的政策的AOI分布和长期的平均传输成本被推导为选定阈值的封闭形式功能。此外，我们表明，在特殊设置下，提议的政策减少到最佳政策，并在一般环境下实现近距离的性能。
This paper investigates the tradeoff between the average age of information (AoI) and the transmission cost for networks with stochastic packet arrival and random erasure channel. Specifically, we model the resource-constrained AoI minimization problem as a constrained Markov decision process (CMDP) and propose a low-complexity single threshold packet scheduling policy for it. The key advantage of the proposed policy is its tractability and convenience for implementation. The AoI distribution and long-term average transmission cost of the proposed policy are derived as closed-form functions of the selected threshold. Furthermore, we show that the proposed policy reduces to the optimal policies under special settings and achieves close-to-optimal performance under general settings.
