In this short paper, we consider the problem of designing a near-optimal competitive scheduling policy for $N$ mobile users, to maximize the freshness of available information uniformly across all users. Prompted by the unreliability and non-stationarity of the emerging 5G-mmWave channels for high-speed users, we forego of any statistical assumptions of the wireless channels and user-mobility. Instead, we allow the channel states and the mobility patterns to be dictated by an omniscient adversary. It is not difficult to see that no competitive scheduling policy can exist for the corresponding throughput-maximization problem in this adversarial model. Surprisingly, we show that there exists a simple online distributed scheduling policy with a finite competitive ratio for maximizing the freshness of information in this adversarial model. Moreover, we also prove that the proposed policy is competitively optimal up to an $O(\ln N)$ factor.

中文翻译：

---

最小化最大信息年龄的竞争算法

在这篇简短的论文中，我们考虑了为 $N$ 移动用户设计一个接近最优的竞争调度策略的问题，以最大化所有用户统一的可用信息的新鲜度。由于高速用户的新兴 5G 毫米波信道的不可靠性和非平稳性，我们放弃了对无线信道和用户移动性的任何统计假设。相反，我们允许通道状态和移动模式由无所不知的对手决定。不难看出，在这个对抗模型中，对应的吞吐量最大化问题不存在竞争性调度策略。令人惊讶的是，我们表明存在一个简单的在线分布式调度策略，该策略具有有限的竞争比率，可在此对抗模型中最大化信息的新鲜度。而且，