z-logo
Premium
A nonorthogonal cooperative scheme for multiuser CRN using probabilistic interference constraint
Author(s) -
Ahmed Ashfaq,
Ali Mudassar,
Naeem Muhammad,
Iqbal Muhammad,
Pareek Udit,
Khan Adnan Ahmed
Publication year - 2019
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3568
Subject(s) - mathematical optimization , cognitive radio , computer science , relay , probabilistic logic , spectrum management , resource allocation , optimization problem , interference (communication) , selection (genetic algorithm) , frequency allocation , constraint (computer aided design) , integer (computer science) , wireless , power (physics) , computer network , algorithm , mathematics , channel (broadcasting) , telecommunications , physics , geometry , quantum mechanics , artificial intelligence , programming language
Abstract The predicted exponential increase in data traffic for future 5G networks demands for increased wireless spectrum capacity. The unlicensed spectrum bands are overburdened, whereas the licensed spectrum bands are underutilized. Cognitive radio systems (CRSs) can solve the problem of spectrum scarcity by allowing the reuse of the underutilized licensed spectrum bands. However, efficient resource allocation schemes in CRS are inevitable before we can reap the benefits of CRS. In this article, we have formulated an optimization problem for multiuser cooperative CRS, which considers relay selection and power allocation to maximize the sum capacity of the system. The optimization problem is a mixed‐integer nonlinear program, and deriving its optimal solution is extremely difficult. Therefore, we propose an iterative joint multiple relay selection and power allocation (IJRSPA) algorithm for multiuser CRSs. The proposed IJRSPA has low computational complexity, and simulation results verify its effectiveness.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here