Efficient Learning-based Scheduling for Information Freshness in Wireless Networks
Author:
- 10 May 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Abstract
Motivated by the recent trend of integrating artificial intelligence into the Internet-of-Things (IoT), we consider the problem of scheduling packets from multiple sensing sources to a central controller over a wireless network. Here, packets from different sensing sources have different values or degrees of importance to the central controller for intelligent decision making. In such a setup, it is critical to provide timely and valuable information for the central controller. In this paper, we develop a parameterized maximum-weight type scheduling policy that combines both the AoI metrics and Upper Confidence Bound (UCB) estimates in its weight measure with parameter η. Here, UCB estimates balance the tradeoff between exploration and exploitation in learning and are critical for yielding a small cumulative regret. We show that our proposed algorithm yields the running average total age at most by O(N 2 η). We also prove that our proposed algorithm achieves the cumulative regret over time horizon T at most by $O(NT/\eta + \sqrt {NT\log T} )$. This reveals a tradeoff between the cumulative regret and the running average total age: when increasing η, the cumulative regret becomes smaller, but is at the cost of increasing running average total age. Simulation results are provided to evaluate the efficiency of our proposed algorithm.
Keywords
This publication has 23 references indexed in Scilit:
- Update or Wait: How to Keep Your Data FreshIEEE Transactions on Information Theory, 2017
- Emulating Round-Robin in Wireless Networks2017
- Lazy is timely: Status updates by an energy harvesting source2015
- Sampling multidimensional Wiener processes2014
- Throughput-Optimal Scheduling Design With Regular Service Guarantees in Wireless NetworksIEEE/ACM Transactions on Networking, 2014
- Throughput-optimal wireless scheduling with regulated inter-service times2013
- Minimizing age of information in vehicular networks2011
- Stochastic Network Optimization with Application to Communication and Queueing SystemsSynthesis Lectures on Communication Networks, 2010
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewardsIEEE Transactions on Automatic Control, 1987
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985