论文标题
新鲜-CSMA：一种分布式协议，用于最小化信息的年龄
Fresh-CSMA: A Distributed Protocol for Minimizing Age of Information
论文作者
论文摘要
我们考虑了分布式调度算法的设计，这些算法将单跳无线网络中信息时代最小化。在这种情况下，已知集中式的最大权重政策几乎是最佳的。因此，我们的目标是设计一个可以模仿其性能的分布式CSMA方案。为此，我们提出了一个称为Fresh-CSMA的分布式协议，并表明在理想化的环境中，新鲜CSMA可以在每个帧中具有很高的可能性与最大重量策略的调度决策相匹配，并且在整个时间范围内也可以符合最大重量策略的理论性能保证。然后，我们考虑一个更现实的设置，并研究协议参数对碰撞概率以及由协议的分布性质引起的间接费用的影响。我们还考虑对马尔可夫来源的监视，并将我们的方法扩展到包含不正确信息年龄（AOII）而不是AOI的CSMA协议。最后，我们提供了支持我们的理论结果的模拟，并表明新鲜CSMA的理想版本和现实版本之间的性能差距很小。
We consider the design of distributed scheduling algorithms that minimize age of information in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a distributed CSMA scheme that can mimic its performance. To that end, we propose a distributed protocol called Fresh-CSMA and show that in an idealized setting, Fresh-CSMA can match the scheduling decisions of the max-weight policy with high probability in each frame, and also match the theoretical performance guarantees of the max-weight policy over the entire time horizon. We then consider a more realistic setting and study the impact of protocol parameters on the probability of collisions and the overhead caused by the distributed nature of the protocol. We also consider the monitoring of Markov sources and extend our approach to CSMA protocols that incorporate Age of Incorrect Information (AoII) instead of AoI. Finally, we provide simulations that support our theoretical results and show that the performance gap between the ideal and realistic versions of Fresh-CSMA is small.
