Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic.
Mobihoc '18: The Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Los Angeles CA USA June, 2018(2018)
摘要
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.
更多查看译文
关键词
Data freshness, wireless scheduling, age of information, real-time traffic, ad hoc networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络