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.
翻译:实时处理时间敏感信息的新时间状态处理对于若干应用程序至关重要,包括医疗保健监测和自主车辆。本文将考虑这种新状态,因为未经处理的信息通过共享无线网络从传感器发送到基地站的系统。 基地台有一个专用的非先发制人处理器, 并有持续处理时间处理每个传感器的信息。 处理信息的年龄是自最近由处理者处理的软件包生成以来的时间间隔。 我们的目标是将经过处理的信息的平均年限降到无限长的高度。 我们首先显示,在不牺牲最佳性的情况下,实行无漏政策简化了系统。 我们从这一简化中建议了三种传输计划式政策,对不同的要求提供2个最佳的保证。 分布式 Power-2 政策可以在没有中央调度器的情况下实施。 如果有一个中央调度器, 后端和 Max-Wight 政策都几乎是最佳的优势。 我们的后端政策保证了经过处理的信息的最大年限, 而Max-Weight 政策在不保证理论结论约束下实现模拟中的最低平均年龄。