Minimizing The Age Of Information In Broadcast Wireless Networks
2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)(2016)
摘要
We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. To the best of our knowledge, this is the first work to provide a scheduling policy that optimizes AoI in a wireless network with unreliable channels.The results are twofold: first, we show that a Greedy Policy, which transmits the packet with highest current age, is optimal for the case of symmetric networks. Then, for the general network case, we establish that the problem is indexable and obtain the Whittle Index in closed-form. Numerical results are presented to demonstrate the performance of the policies.
更多查看译文
关键词
broadcast wireless networks,time-sensitive information,age of information,discrete-time decision problem,scheduling policy,greedy policy,symmetric networks,Whittle index
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络