Results 21 to 30 of about 2,867 (224)
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information [PDF]
This paper examines the average age minimization problem where only a fraction of the network users can transmit simultaneously over unreliable channels. Finding the optimal scheduling scheme, in this case, is known to be challenging. Accordingly, the Whittle's index policy was proposed in the literature as a low-complexity heuristic to the problem ...
Saad Kriouile +2 more
openaire +2 more sources
Fast Two-Stage Computation of an Index Policy for Multi-Armed Bandits with Setup Delays
We consider the multi-armed bandit problem with penalties for switching that include setup delays and costs, extending the former results of the author for the special case with no switching delays.
José Niño-Mora
doaj +1 more source
Deep Reinforcement Learning Heterogeneous Channels for Poisson Multiple Access
This paper proposes a medium access control (MAC) protocol based on deep reinforcement learning (DRL), i.e., multi-channel transmit deep-reinforcement learning multi-channel access (MCT-DLMA) in heterogeneous wireless networks (HetNets).
Xu Zhang +3 more
doaj +1 more source
On the Whittle Index for Restless Multiarmed Hidden Markov Bandits [PDF]
We consider a restless multi-armed bandit in which each arm can be in one of two states. When an arm is sampled, the state of the arm is not available to the sampler. Instead, a binary signal with a known randomness that depends on the state of the arm is available. No signal is available if the arm is not sampled.
Rahul Meshram +2 more
openaire +5 more sources
Scheduling in Wireless Networks using Whittle Index Theory
6 pages, 9 figures.
Karthik G. V. B. +2 more
openaire +2 more sources
A Whittle Index Approach to Minimizing Functions of Age of Information [PDF]
Accepted for Allerton ...
Vishrant Tripathi, Eytan H. Modiano
openaire +3 more sources
Two Families of Indexable Partially Observable Restless Bandits and Whittle Index Computation
We consider the restless bandits with general state space under partial observability with two observational models: first, the state of each bandit is not observable at all, and second, the state of each bandit is observable only if it is chosen. We assume both models satisfy the restart property under which we prove indexability of the models and ...
Nima Akbarzadeh, Aditya Mahajan
openaire +2 more sources
Adaptive Scheduling: A Reinforcement Learning Whittle Index Approach for Wireless Sensor Networks
We propose a Reinforcement Learning (RL)-based scheduling framework for Restless Multi-Armed Bandit (RMAB) problems, centred on a Whittle Index Q-Learning policy with Upper Confidence Bound (Whittle index Q-Learning (WIQL)-upper confidence bound (UCB ...
Sokipriala Jonah +2 more
doaj +1 more source
A Novel Scheduling Index Rule Proposal for QoE Maximization in Wireless Networks
This paper deals with the resource allocation problem aimed at maximizing users’ perception of quality in wireless channels with time-varying capacity. First of all, we model the subjective quality-aware scheduling problem in the framework of Markovian ...
Ianire Taboada, Fidel Liberal
doaj +1 more source
In dense millimeter wave (mmWave) networks, user association, i.e., the task of selecting the access point (AP) that each arriving user should join, significantly impacts the network performance.
Ravindra S. Tomar +2 more
doaj +1 more source

