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. 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.
翻译：我们考虑设计分布式调度算法,最大限度地减少单机无线网络信息年龄。中央最大重量政策在这种环境下几乎是最佳的;因此,我们的目标是设计一个可模仿其性能的分布式CSMA计划。为此,我们提出一个名为“新鲜CSMA”的分布式协议,并表明在理想化的环境中,新鲜CSMA可以在每个框架中与最大重量政策的时间安排决定匹配高概率,并且也与整个时间跨度最大政策的理论性能保障相匹配。我们然后考虑一个更现实的设置,并研究协议参数对碰撞概率和协议分布性造成的间接费用的影响。最后,我们提供模拟来支持我们的理论结果,并表明新鲜CSMA的理想和现实版本之间的性能差距很小。
相关内容
微信扫码咨询专知VIP会员