Distributed algorithm under cooperative or competitive priority users in cognitive networks

Distributed algorithm under cooperative or competitive priority users in cognitive networks

Abstract Opportunistic spectrum access (OSA) problem in cognitive radio (CR) networks allows a secondary (unlicensed) user (SU) to access a vacant channel allocated to a primary (licensed) user (PU). By finding the availability of the best channel, i.e., the channel that has the highest availability...

Full description

Bibliographic Details
Main Authors: Mahmoud Almasri, Ali Mansour, Christophe Moy, Ammar Assoum, Christophe Osswald, Denis Lejeune
Format: Article
Language:English
Published: SpringerOpen 2020-07-01
Series:EURASIP Journal on Wireless Communications and Networking
Subjects:
Cooperative or competitive priority access
Cognitive radio
Opportunistic spectrum access
Multi-armed bandit algorithms
Upper bound of regret
Online Access:http://link.springer.com/article/10.1186/s13638-020-01738-w

Internet

http://link.springer.com/article/10.1186/s13638-020-01738-w

Similar Items