This paper considers a multi-user downlink scheduling problem with access to the channel state information at the transmitter (CSIT) to minimize the Age-of-Information (AoI) in a non-stationary environment. The non-stationary environment is modelled using a novel adversarial framework. In this setting, we propose a greedy scheduling policy, called MA-CSIT, that takes into account the current channel state information. We establish a finite upper bound on the competitive ratio achieved by the MA-CSIT policy for a small number of users and show that the proposed policy has a better performance guarantee than a recently proposed greedy scheduler that operates without CSIT. In particular, we show that access to the additional channel state information improves the competitive ratio from 8 to 2 in the two-user case and from 18 to 8/3 in the three-user case. Finally, we carry out extensive numerical simulations to quantify the advantage of knowing CSIT in order to minimize the Age-of-Information for an arbitrary number of users.
翻译:本文考虑了在非静止环境中获取发报机(发报机)的频道状态信息的多用户下行列表问题,以尽量减少信息年龄(AoI)在非静止环境中的情况。非静止环境是采用新的对抗框架的模式。在这一背景下,我们提出一项贪婪的列表政策,称为MA-CSIT,其中考虑到目前的频道状态信息。我们为少数用户确定了一个有限的最高限值。我们表明,拟议政策比最近提出的没有CSIT运作的贪婪调度器有更好的绩效保障。我们特别表明,获取额外频道状态信息使竞争比率从2个用户案件中的8到2,3个用户案件中的18到8/3得到改善。最后,我们进行了广泛的数字模拟,以量化了解CSIT的优势,从而尽可能减少任意用户的信息年龄。