Efficient Learning-based Scheduling for Information Freshness in Wireless Networks

01/01/2021
by   Bin Li, et al.
6

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/η+√(NTlog 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 9

research
01/11/2018

Timely Status Update in Massive IoT Systems: Decentralized Scheduling for Wireless Uplinks

In a typical Internet of Things (IoT) application where a central contro...
research
12/16/2020

Aging Bandits: Regret Analysis and Order-Optimal Learning Algorithm for Wireless Networks with Stochastic Arrivals

We consider a single-hop wireless network with sources transmitting time...
research
09/14/2019

Minimizing Age of Information in a Multihop Wireless Network

We consider the problem of minimizing age in a multihop wireless network...
research
01/21/2023

A Communication-Efficient Adaptive Algorithm for Federated Learning under Cumulative Regret

We consider the problem of online stochastic optimization in a distribut...
research
03/09/2019

Optimizing Information Freshness in Broadcast Network with Unreliable Links and Random Arrivals: An Approximate Index Policy

With the rapid growth of real-time Internet of Things (IoT) applications...
research
02/04/2021

Low-Power Status Updates via Sleep-Wake Scheduling

We consider the problem of optimizing the freshness of status updates th...
research
01/10/2019

Online Energy-Efficient Scheduling for Timely Information Downloads in Mobile Networks

We consider a mobile network where a mobile device is running an applica...

Please sign up or login with your details

Forgot password? Click here to reset