Open AccessRobust underlay cognitive network download beamforming in multiple users, multiple groups multicell scenario
Author(s) -
AlAsadi Ahmed,
AlAmidie Muthana,
Alwane Saddam K.,
Albehadili Hayder M.,
McGarvey Ronald G.,
Islam and Naz E.
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2020.0572
Subject(s) - underlay , beamforming , computer science , mathematical optimization , cognitive radio , optimization problem , quality of service , bisection method , computational complexity theory , convex optimization , interference (communication) , algorithm , mathematics , regular polygon , signal to noise ratio (imaging) , channel (broadcasting) , wireless , computer network , telecommunications , geometry
Achieving high quality of service (QOS) at the end‐users while maintaining the low interference power at the primary users is the main goal in underlay cognitive radio networks. This goal becomes a more difficult task in the designing of beamforming vectors where all channels state information (CSIs) in the secondary network, as well as the interference CSIs, are uncertain. This task is addressed in this study using an iterative optimization technique. In this technique, the original CSI problem, which is difficult to solve as a single optimization problem, is instead separated into two sub‐problems. The first subproblem is the interference power problem, which can be solved either sub‐optimally or optimally using Lagrange duality. The second sub‐problem is the QOS problem, which can be solved either sub‐optimally or robustly using non‐monotone spectral projected gradient method. The two sub‐problem solutions are then recombined into a single problem to extract beamforming vectors. Two methods are invoked to extract the beamforming vectors: either the successive convex approximation (SCA) method or the bisection search method. Theoretical analysis and simulation results indicate that the two methods can offer a tradeoff between better QOS (using bisection search method) or less computational complexity (using SCA method)