Robust Beamforming and Power Allocation in CR MISO Networks with SWIPT to Maximize the Minimum Achievable Rate
In this paper, a new method is presented to maximize the minimum achievable rate of the users in a cognitive radio multiple input single output network. The secondary system provides simultaneous wireless information and power transfer (SWIPT) for energy harvesting receivers. Considering random Gaus...
Gespeichert in:
Veröffentlicht in: | Wireless personal communications 2019-05, Vol.106 (2), p.927-954 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, a new method is presented to maximize the minimum achievable rate of the users in a cognitive radio multiple input single output network. The secondary system provides simultaneous wireless information and power transfer (SWIPT) for energy harvesting receivers. Considering random Gaussian vector for the estimation error of the channel state information (CSI), we impose some outage constraints to guarantee the quality of service of the network. Outage constraints on the received power and the information leakage at the energy harvesting users are imposed to assure SWIPT. We introduce new convex inequalities to replace the original non-convex constraints and write the objective function as the minimization of the maximum of some fractional functions. This new objective function and convex inequalities result in a new quasi-convex general fractional programming problem. The new quasi-convex optimization problem is written in such a way that the computational costs to solve this problem are as low as possible. We develop an algorithm to obtain the optimal beamforming weights and artificial noise covariance matrix. All stochastic constraints are rewritten for the special case that the covariance matrices of error in the estimation of CSI are a factor of identity matrix. This reformulation results in less computation costs to obtain optimal beamforming weights and AN covariance matrix. Simulation results confirm that, all stochastic constraints are satisfied with certain probability. In comparison with the previous robust related work, the proposed method achieves higher rates which confirms superiority of our method. |
---|---|
ISSN: | 0929-6212 1572-834X |
DOI: | 10.1007/s11277-019-06197-1 |