We study a problem of scheduling transmissions of status messages over a fading link. The fading process is i.i.d., and is known at the sender after one-slot delay. Messages arrive according to an i.i.d. Bernoulli process at the sender, and each message has a delay deadline of d{d} time-slots. The problem is to decide whether or not to transmit, and to choose an optimum transmit-energy, such that the average Age of Information is minimum satisfying a constraint on transmit-energy and throughput. We pose this problem as a constrained Markov decision process, and provide an Age OPTimum policy (AOPT). We also propose a simple heuristic, Greedy Randomization of Energy Policy (GREP), and compare the performance of AOPT and GREP with ARQ policies. This is one of the first work in finding a minimum age scheduling policy with throughput guarantees and with delayed CSIT for an average transmit-energy constraint.

中文翻译：

---

具有延迟 CSIT 和能量约束的衰落通道中的最低年龄调度


我们研究了在衰落链路上调度状态消息传输的问题。衰落过程是独立同分布的，并且在一时隙延迟后在发送方处是已知的。消息根据独立同分布伯努利过程到达发送方，并且每条消息都有 d{d} 个时隙的延迟期限。问题是决定是否传输，并选择最佳传输能量，使得平均信息年龄最小，满足传输能量和吞吐量的约束。我们将此问题视为受限马尔可夫决策过程，并提供年龄最优策略（AOPT）。我们还提出了一种简单的启发式能源策略贪婪随机化 (GREP)，并将 AOPT 和 GREP 与 ARQ 策略的性能进行比较。这是寻找具有吞吐量保证和平均传输能量约束的延迟 CSIT 的最小年龄调度策略的首要工作之一。