Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Distributed algorithm under cooperative or competitive priority users in cognitive networks

Mahmoud Almasri 1 Ali Mansour 1 Christophe Moy 2 Ammar Assoum 3 Christophe Osswald 4 Denis Le Jeune 1
1 Lab-STICC_ENSTAB_CACS_COM
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
4 Lab-STICC_ENSTAB_CID_DECIDE
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192), STIC - Pôle STIC [Brest], Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
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 probability, a SU can increase its transmission time and rate. To maximize the transmission opportunities of a SU, various learning algorithms are suggested: Thompson sampling (TS), upper confidence bound (UCB), ε-greedy, etc. In our study, we propose a modified UCB version called AUCB (Arctan-UCB) that can achieve a logarithmic regret similar to TS or UCB while further reducing the total regret, defined as the reward loss resulting from the selection of non-optimal channels. To evaluate AUCB’s performance for the multi-user case, we propose a novel uncooperative policy for a priority access where the kth user should access the kth best channel. This manuscript theoretically establishes the upper bound on the sum regret of AUCB under the single or multi-user cases. The users thus may, after finite time slots, converge to their dedicated channels. It also focuses on the Quality of Service AUCB (QoS-AUCB) using the proposed policy for the priority access. Our simulations corroborate AUCB’s performance compared to TS or UCB.
Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal-ensta-bretagne.archives-ouvertes.fr/hal-02924010
Contributeur : Laurent Jonchère <>
Soumis le : mardi 29 septembre 2020 - 12:15:59
Dernière modification le : mercredi 14 octobre 2020 - 03:53:07

Fichier

s13638-020-01738-w
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Mahmoud Almasri, Ali Mansour, Christophe Moy, Ammar Assoum, Christophe Osswald, et al.. Distributed algorithm under cooperative or competitive priority users in cognitive networks. EURASIP Journal on Wireless Communications and Networking, SpringerOpen, 2020, ⟨10.1186/s13638-020-01738-w⟩. ⟨hal-02924010⟩

Partager

Métriques

Consultations de la notice

99

Téléchargements de fichiers

134