论文标题

最小化无线网络中处理信息的年龄

Minimizing Age of Processed Information in Wireless Networks

论文作者

Nikunram, Chanikarn, Meesena, Wasin, Turner, Stephen John, Supittayapornpong, Sucha

论文摘要

时间敏感信息的实时状态处理的新鲜度对于多种应用程序,包括医疗保健监测和自动驾驶汽车至关重要。本文在本文中考虑了这种新鲜度,该系统通过共享无线网络从传感器发送到基站的系统。基站有一个专用的非首次处理器,并具有恒定的处理时间,可以从每个传感器处理信息。加工信息的年龄是自处理器最近处理的数据包以来经过的时间。我们的目标是最大程度地降低无限时间胜过处理信息的平均年龄。我们首先表明,无滴政策可以简化系统而不牺牲最佳性。通过这种简化,我们提出了三个针对不同要求的传输规定政策,并提供2条最佳保证。可以在没有中央调度程序的情况下实施分布式Power-2策略。借助中央调度程序,退缩和最大重量策略几乎是最佳的,具有不同的优势。退缩政策保证了处理已处理的信息的最大年龄,而最大重量策略则达到了模拟中最低的平均年龄,而无需保证界限。仿真结果证实了我们的理论发现。

The freshness of real-time status processing of time-sensitive information is crucial for several applications, including healthcare monitoring and autonomous vehicles. This freshness is considered in this paper for the system where unprocessed information is sent from sensors to a base station over a shared wireless network. The base station has a dedicated non-preemptive processor with a constant processing time to process information from each sensor. The age of processed information is the time elapsed since the generation of the packet that was most recently processed by a processor. Our objective is to minimize the average age of processed information over an infinite time-horizon. We first show that a drop-free policy simplifies the system without sacrificing optimality. From this simplification, we propose three transmission-scheduling policies with 2-optimal guarantees for different requirements. A distributed Power-2 policy can be implemented without a central scheduler. With a central scheduler, both Back-Off and Max-Weight policies are near optimal with different advantages. The Back-Off policy guarantees a bound on the maximum age of processed information, while the Max-Weight policy achieves the lowest average age in simulation without the guarantee of bound. Simulation results confirm our theoretical findings.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源