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.

翻译：本文件调查了信息的平均年龄(AoI)与具有随机清除渠道的散装货包抵达网络和网络传输成本之间的权衡。具体地说,我们将资源有限的AoI最小化问题作为受限制的Markov决定程序(CMDP)的模型,并为它提出了一个低复杂性单一临界量列表政策。拟议政策的主要优点是其可移动性和便于执行。拟议政策的长期平均传输成本和AoI分布作为选定临界值的封闭形式功能来计算。此外,我们表明,拟议政策在特殊环境下可降低为最佳政策,在一般环境下可实现接近最佳的绩效。