论文标题
事实证明，与异质不可靠的多通信通道相比，圆形旋转的年龄差不多是最小化的年龄
Round-Robin is Provably Near-Optimal for Minimizing Age with HARQ over Heterogeneous Unreliable Multiaccess Channels
论文作者
论文摘要
在异质不可靠的多元通信网络中，其中终端具有具有独特的错误概率的常见无线通道，现有作品表明，持续的圆形旋转（RR-P）调度策略（即贪婪的策略（即，贪婪的政策）可以比在标准自动级别的“ aoi（aoi”级别的年龄）中任意地比最佳的差异（ARQ），并且一定要划分A qusor（ARQ），并且是一种差异（ARQ）。在本文中，考虑了当今无线网络中广泛使用的实用混合ARQ（HARQ）方案。我们表明，在这种情况下，RR-P在渐近的许多端子上非常接近最佳，通过RR-P在最佳的AOI和可实现的AOI之间，明确得出了紧密的，封闭形式的AOI差距。特别是，严格证明，对于RR-P，在HARQ模型下，有关褪色渠道（分别有限块状式制度），相对AOI差距与最佳最佳相比在$（\ sqrt {e} {e} -1）的常数范围内。 $ 0.5 $）。此外，RR-P具有通过渠道 - unaware和易于排除的操作的实现简单性的明显优势，在实践中使其有利。
In a heterogeneous unreliable multiaccess network, wherein terminals share a common wireless channel with distinctive error probabilities, existing works have showed that a persistent round-robin (RR-P) scheduling policy (i.e., greedy policy) can be arbitrarily worse than the optimum in terms of Age of Information (AoI) under standard Automatic Repeat reQuest (ARQ), and one must resort to Whittle's index approach for optimal AoI. In this paper, practical Hybrid ARQ (HARQ) schemes which are widely-used in today's wireless networks are considered. We show that RR-P is very close to optimum with asymptotically many terminals in this case, by explicitly deriving tight, closed-form AoI gaps between optimum and achievable AoI by RR-P. In particular, it is rigorously proved that for RR-P, under HARQ models concerning fading channels (resp. finite-blocklength regime), the relative AoI gap compared with the optimum is within a constant of $(\sqrt{e}-1)^2/4\sqrt{e} \cong 6.4\%$ (resp. $6.2\%$ with error exponential decay rate of $0.5$). In addition, RR-P enjoys the distinct advantage of implementation simplicity with channel-unaware and easy-to-decentralize operations, making it favorable in practice.
