Sciweavers

Share
CORR
2010
Springer

Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach

8 years 6 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activities) is modeled as an arbitrary finite-state Markov chain. At each instance of time, a (secondary) user probes a channel and collects a certain reward as a function of the state of the channel (e.g., good channel condition results in higher data rate for the user). Each channel has potentially different state space and statistics, both unknown to the user, who tries to learn which one is the best as it goes and maximizes its usage of the best channel. The objective is to construct a good online learning algorithm so as to minimize the difference between the user's performance in total rewards and that of using the best channel (on average) had it known which one is the best from a priori knowledge of the channel statistics (also known as the regret). This is a classic exploration and exploitation probl...
Cem Tekin, Mingyan Liu
Added 16 May 2011
Updated 16 May 2011
Type Journal
Year 2010
Where CORR
Authors Cem Tekin, Mingyan Liu
Comments (0)
books