Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic
Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic
复制标题
DOI：
10.1145/3209582.3209602
复制
发表时间：
2018-06
期刊：
影响因子：
--
通讯作者：
N. Lu;Bo Ji;Bin Li
中科院分区：
文献类型：
--
作者：
N. Lu;Bo Ji;Bin Li
我们考虑的问题，调度实时业务与硬截止日期在无线ad hoc网络。在现有的实时调度策略，只是确保最小的及时吞吐量相比，我们的设计目标是提供保证的及时吞吐量和数据的新鲜度方面的年龄的信息（AoI），这是一个新提出的度量，捕获的“年龄”最近收到的信息在目的地的链接。其主要思想是引入AoI作为调度决策的驱动因素之一。我们首先证明了所提出的调度策略是可行性最优的，即，满足每个业务的及时吞吐量要求。然后，我们推导出一个上限的考虑数据新鲜度指标的AOI，证明了网络范围内的数据新鲜度是有保证的，可以根据建议的调度策略进行调整。有趣的是，我们发现，网络数据新鲜度的提高是以减缓及时吞吐量的收敛为代价的。进行了大量的模拟，以验证我们的分析结果。分析和仿真结果证实了所提出的调度策略，以提高数据的新鲜度，而不牺牲可行性最优的能力。
We consider the problem of scheduling real-time traffic with hard deadlines in a wireless ad hoc network. In contrast to existing real-time scheduling policies that merely ensure a minimal timely throughput, our design goal is to provide guarantees on both the timely throughput and data freshness in terms of age-of-information (AoI), which is a newly proposed metric that captures the "age" of the most recently received information at the destination of a link. The main idea is to introduce the AoI as one of the driving factors in making scheduling decisions. We first prove that the proposed scheduling policy is feasibility-optimal, i.e., satisfying the per-traffic timely throughput requirement. Then, we derive an upper bound on a considered data freshness metric in terms of AoI, demonstrating that the network-wide data freshness is guaranteed and can be tuned under the proposed scheduling policy. Interestingly, we reveal that the improvement of network data freshness is at the cost of slowing down the convergence of the timely throughput. Extensive simulations are performed to validate our analytical results. Both analytical and simulation results confirm the capability of the proposed scheduling policy to improve the data freshness without sacrificing the feasibility optimality.