Thompson sampling for opportunistic spectrum access with Markovian rewards

Suleman Alnatheer, Hong Man

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper considers the problem of multi- channels opportunistic access in stationary wireless environments, where an intelligent and unlicensed agent uses the existing licensed spectrum to maximize it's throughput while not causing harm to existing licensed users. Each channel is modeled as unknown and never ending stream of binary data generated by first order discrete time Markov process with two states Gilbert-Elliot model. This problem is classified as restless bandit, where optimal solution is intractable. An on-line approximation algorithm is proposed based on Thompson Sampling Algorithm, which acts as heuristic search for best channel in the spectrum.

Original languageEnglish
Title of host publication2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Proceedings
ISBN (Electronic)9781479944491, 9781479944491
DOIs
StatePublished - 24 Nov 2014
Event80th IEEE Vehicular Technology Conference, VTC 2014-Fall - Vancouver, Canada
Duration: 14 Sep 201417 Sep 2014

Publication series

NameIEEE Vehicular Technology Conference
ISSN (Print)1550-2252

Conference

Conference80th IEEE Vehicular Technology Conference, VTC 2014-Fall
Country/TerritoryCanada
CityVancouver
Period14/09/1417/09/14

Fingerprint

Dive into the research topics of 'Thompson sampling for opportunistic spectrum access with Markovian rewards'. Together they form a unique fingerprint.

Cite this