Full-duplex relaying for opportunistic spectrum access under an overall power constraint

Savard, Anne; Belmega, Elena Veronica

Type de document :

Article dans une revue scientifique: Article original

DOI :

10.1109/ACCESS.2020.3024010

Titre :

Full-duplex relaying for opportunistic spectrum access under an overall power constraint

Auteur(s) :

Savard, Anne [Auteur]

Ecole nationale supérieure Mines-Télécom Lille Douai [IMT Nord Europe]
Circuits Systèmes Applications des Micro-ondes - IEMN [CSAM - IEMN]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
Ecole nationale supérieure Mines-Télécom Lille Douai [IMT Lille Douai]
Belmega, Elena Veronica [Auteur]
Equipes Traitement de l'Information et Systèmes [ETIS - UMR 8051]

Titre de la revue :

IEEE ACCESS

Pagination :

168262-168272

Éditeur :

IEEE

Date de publication :

2020

ISSN :

2169-3536

Discipline(s) HAL :

Mathématiques [math]

Résumé en anglais : [en]

To meet the bold requirements of future generation networks, emerging technologies such as opportunistic spectrum access, multi-tier networks, full-duplexing and cooperative networks have to be exploited. In this paper, ...
Lire la suite >To meet the bold requirements of future generation networks, emerging technologies such as opportunistic spectrum access, multi-tier networks, full-duplexing and cooperative networks have to be exploited. In this paper, we propose to blend all the above and globally optimize a relay-aided cognitive radio network composed of a licensed link and an opportunistic link, which is helped by a full-duplex relay node. The opportunistic transmission is allowed provided that a minimum Quality of Service (QoS) constraint is met at the licensed user. First, we derive the achievable rate region under two relaying schemes, namely Decode-and-Forward (DF) and Compress-and-Forward (CF). Then we investigate the optimal power allocation policies for the opportunistic user and the relay under an overall power constraint. The resulting optimization problems are non-convex programs because of the non-trivial operations at the relay (for both CF and DF) and, for DF relaying, the non-convex QoS constraint. Remarkably, the optimal solution is stated in closed-form for CF, whereas it is obtained numerically for DF. Finally, we evaluate numerically the network performance under the two relaying schemes. It turns out that DF outperforms CF only when the relay is close to the opportunistic transmitter and that CF relaying is always useful. © 2021 IEEE.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Projet ANR :

PSI

Collections :

Institut d'Électronique, de Microélectronique et de Nanotechnologie (IEMN) - UMR 8520

Source :

Harvested from HAL

Fichiers

https://ieeexplore.ieee.org/ielx7/6287639/6514899/09195840.pdf
Accès libre
Accéder au document

https://ieeexplore.ieee.org/ielx7/6287639/8948470/09195840.pdf
Accès libre
Accéder au document

09195840.pdf
Accès libre
Accéder au document

Full-duplex relaying for opportunistic ... BibTeX CSV Excel RIS

Fichiers

Full-duplex relaying for opportunistic ...

BibTeX

CSV

Excel

RIS