Aging bandits: Regret analysis and order-optimal learning algorithm for wireless networks with stochastic arrivals

EU Atay, I Kadota, E Modiano - arXiv preprint arXiv:2012.08682, 2020 - arxiv.org
We consider a single-hop wireless network with sources transmitting time-sensitive
information to the destination over multiple unreliable channels. Packets from each source …

Regret of age-of-information bandits

S Fatale, K Bhandari, U Narula… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
We consider a system with a single source that measures/tracks a time-varying quantity and
periodically attempts to report these measurements to a monitoring station. Each update …

Regret of Age-of-Information Bandits in Nonstationary Wireless Networks

Z Song, T Yang, X Wu, H Feng… - IEEE Wireless …, 2022 - ieeexplore.ieee.org
We consider a wireless network with a source periodically generating time-sensitive
information and transmitting it to a destination via one of non-stationary orthogonal wireless …

Aging wireless bandits: Regret analysis and order-optimal learning algorithm

EU Atay, I Kadota, E Modiano - … in Mobile, Ad hoc, and Wireless …, 2021 - ieeexplore.ieee.org
We consider a single-hop wireless network with sources transmitting time-sensitive
information to the destination over multiple unreliable channels. Packets from each source …

AoI-Guaranteed Bandit: Information Gathering over Unreliable Channels

Z Huang, W Wu, C Fu, V Chau, X Liu… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
In many IoT applications, information needs to be gathered from multiple heterogeneous
sources to the base station for real-time processing and follow-up actions. Undoubtedly …

A Novel Scheduling Strategy in Priority-Aware IoT Networks for Age of Information Optimization

O Sayınbaş, A Köse, M Koca… - IEEE Communications …, 2023 - ieeexplore.ieee.org
We propose a novel scheduling strategy for prioritization-critical time-sensitive Internet of
things (IoT) networks. The goal is to decrease the number of sensors with outdated …

Multi-player age-of-information bandits: A trekking approach

H Gudwani, MK Hanawal… - 2022 14th International …, 2022 - ieeexplore.ieee.org
We study the algorithmic task of scheduling communication in a decentralized manner in a
multi-source, single-destination network. The sources share multiple communication …

Aoi-constrained bandit: Information gathering over unreliable channels with age guarantees

Z Huang, W Wu, C Fu, V Chau, X Liu, J Wang… - arXiv preprint arXiv …, 2021 - arxiv.org
Age-of-Information (AoI) is an application layer metric that has been widely adopted to
quantify the information freshness of each information source. However, few works address …

Regret of Age of Information Bandits for Single and Multiple Sources Under Non-stationary Channels

X Wang, J Zhang, X Cheng… - 2024 22nd International …, 2024 - ieeexplore.ieee.org
We study scheduling algorithms to minimize the Age of Information (AoI) regrets under non-
stationary channels in a drifting environment, where the probability that a channel can …

Scheduling Service Updates: A Multi-arm Bandit Approach

VSCL Narayana, S Ravikanti… - Computer Networks …, 2023 - ojs.wiserpub.com
Abstract Software as a Service (SaaS) instances often use edge resources to serve their
customers. The version of the service hosted at the edge needs to be periodically updated to …