Proceedings of the 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications 2011
DOI: 10.4108/icst.crowncom.2011.245851
|View full text |Cite
|
Sign up to set email alerts
|

Upper Confidence Bound Algorithm for Opportunistic Spectrum Access with Sensing Errors

Abstract: In this paper we consider the problem of exploiting spectrum resources within the Opportunistic Spectrum Access context. We mainly focus on the case where one secondary user (SU) probes a pool of possibly available channels dedicated to a primary network. The SU is assumed to have imperfect sensing abilities. We, first, model the problem as a Multi-Armed Bandit problem with sensing errors. Then, we suggest to analyze the performances of the well known Upper Confidence Bound algorithm 1 within this framework, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 4 publications
(5 reference statements)
0
18
0
Order By: Relevance
“…A minimum variancebased and a maximum capacity-based spectrum decision schemes have been developed for real-time applications and best-effort applications, respectively. Moreover, learning mechanisms can be equipped to assist the decision making procedure [110][111][112]. In [110], the use of reinforcement learning algorithm for spectrum assignment in WCDMA systems has been evaluated to show the satisfactory results under different load conditions.…”
Section: Spectrum Decisionmentioning
confidence: 99%
“…A minimum variancebased and a maximum capacity-based spectrum decision schemes have been developed for real-time applications and best-effort applications, respectively. Moreover, learning mechanisms can be equipped to assist the decision making procedure [110][111][112]. In [110], the use of reinforcement learning algorithm for spectrum assignment in WCDMA systems has been evaluated to show the satisfactory results under different load conditions.…”
Section: Spectrum Decisionmentioning
confidence: 99%
“…With several network models based on game theory [13], Markov chains or multi-armed Bandit (MAB) (and machine learning in general) [44][45][46][47][48][49][50], to name a few, and relying on the concept of CR, the community tackled several challenges encountered when dealing with OSA such as (non exhaustive): dynamic power allocation, optimal band selection (with or without prior knowledge on the occupancy pattern of the spectrum bands by PUs), as well as cooperation among the different SUs [12] centralized or decentralized, with or without observation errors.…”
Section: Spectrum Scarcity and Dynamic Spectrum Accessmentioning
confidence: 99%
“…In Section 5.2 an OSA scenario based on a MAB model, described in article [48], is summarized and illustrates the impact of observation errors on decision making for CR. In the following section, however, we introduce prior knowledge as a classification criteria among the main learning and decision making tools suggested in CR articles.…”
Section: Spectrum Scarcity and Dynamic Spectrum Accessmentioning
confidence: 99%
See 2 more Smart Citations