Name
Title | ||
|---|---|---|
QoS-Based Blind Spectrum Selection with Multi-armed Bandit Problem in Cognitive Radio Networks. |
Abstract | ||
|---|---|---|
In the framework of cognitive radio, joint spectrum sensing and access strategies have been extensively studied recently. As a matter of fact, the sensing ability of cognitive radio is limited and the channel statistics may not be known as a priori. In this paper, we investigate the blind spectrum selection with the multi-armed bandit model, considering both primary user activities and channel quality to meet diverse QoS requirements, e.g. high transmission success rate for real-time applications and high throughput for best-effort applications. Firstly we propose a policy kth-UCB1 which is based on the UCB1 policy for multi-armed bandit problem but converges to the kth-best arm. Then we design a distributed order-optimal policy for multiple users accessing the rank-best channels according to their QoS requirements. The expected regret of proposed policy is proved to be logarithmic in the number of time slots and the simulation results implies it has better performance. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11277-016-3301-1 | Wireless Personal Communications |
Keywords | Field | DocType |
Cognitive radio,Multi-armed bandit,Opportunistic spectrum access,Distributed algorithms | Regret,Computer science,A priori and a posteriori,Computer network,Quality of service,Communication channel,Distributed algorithm,Multi-armed bandit,Throughput,Cognitive radio | Journal |
Volume | Issue | ISSN |
89 | 2 | 0929-6212 |
Citations | PageRank | References |
2 | 0.42 | 14 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongqun Chen | 1 | 17 | 2.06 |
| Huaibei Zhou | 2 | 4 | 0.81 |
| Ruoshan Kong | 3 | 20 | 4.20 |
| Junyuan Huang | 4 | 15 | 1.66 |
| Bo Chen | 5 | 15 | 1.66 |