期刊
IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 20, 期 3, 页码 1173-1185出版社
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2019.2959774
关键词
Wireless networks; Scheduling; Optimal scheduling; Mobile computing; Stochastic processes; Information age; Age of information; scheduling; wireless networks; optimization
资金
- NSF [AST-1547331, CNS-1713725, CNS-1701964]
- Army Research Office (ARO) [W911NF-17-1-0508]
This study examines the Age of Information (AoI) performance in wireless networks, proposing optimal policies and max-weight policies to effectively reduce information staleness.
We consider a wireless network with a base station serving multiple traffic streams to different destinations. Packets from each stream arrive to the base station according to a stochastic process and are enqueued in a separate (per stream) queue. The queueing discipline controls which packet within each queue is available for transmission. The base station decides, at every time t, which stream to serve to the corresponding destination. The goal of scheduling decisions is to keep the information at the destinations fresh. Information freshness is captured by the Age of Information (AoI) metric. In this paper, we derive a lower bound on the AoI performance achievable by any given network operating under any queueing discipline. Then, we consider three common queueing disciplines and develop both an Optimal Stationary Randomized policy and a Max-Weight policy under each discipline. Our approach allows us to evaluate the combined impact of the stochastic arrivals, queueing discipline and scheduling policy on AoI. We evaluate the AoI performance both analytically and using simulations. Numerical results show that the performance of the Max-Weight policy is close to the analytical lower bound.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据