TY - JOUR
T1 - Energy Efficiency Optimization for Secure Transmission in MISO Cognitive Radio Network with Energy Harvesting
AU - Zhang, Miao
AU - Cumanan, Kanapathippillai
AU - Thiyagalingam, Jeyarajan
AU - Wang, Wei
AU - Burr, Alister G.
AU - Ding, Zhiguo
AU - Dobre, Octavia A.
N1 - Funding Information:
The work of M. Zhang, K. Cumanan, and A. G. Burr were supported by H2020-MSCA-RISE-2015 under Grant 690750. The work of W. Wang was supported in part by the Stereoscopic Coverage Communication Network Verification Platform for China Sea under Grant PCL2018KP002, in part by the Six Categories Talent Peak of Jiangsu Province under Grant KTHY-039, in part by the Science and Technology Program of Nantong under Grant GY22017013, and in part by the Open Research Fund of Nantong University—Nantong Joint Research Center for Intelligent Information Technology under Grant KFKT2017B02. The work of Z. Ding was supported in part by the U.K. Engineering and Physical Sciences Research Council (EPSRC) under Grant EP/N005597/2 and in part by H2020-MSCA-RISE-2015 under Grant 690750.
Publisher Copyright:
© 2013 IEEE.
PY - 2019
Y1 - 2019
N2 - In this paper, we investigate different secrecy energy efficiency (SEE) optimization problems in a multiple-input single-output underlay cognitive radio (CR) network in the presence of an energy harvesting receiver. In particular, these energy efficient designs are developed with different assumptions of channels state information (CSI) at the transmitter, namely perfect CSI, statistical CSI and imperfect CSI with bounded channel uncertainties. In particular, the overarching objective here is to design a beamforming technique maximizing the SEE while satisfying all relevant constraints linked to interference and harvested energy between transmitters and receivers. We show that the original problems are non-convex and their solutions are intractable. By using a number of techniques, such as non-linear fractional programming and difference of concave (DC) functions, we reformulate the original problems so as to render them tractable. We then combine these techniques with the Dinkelbach's algorithm to derive iterative algorithms to determine relevant beamforming vectors which lead to the SEE maximization. In doing this, we investigate the robust design with ellipsoidal bounded channel uncertainties, by mapping the original problem into a sequence of semidefinite programs by employing the semidefinite relaxation, non-linear fractional programming and S-procedure. Furthermore, we show that the maximum SEE can be achieved through a search algorithm in the single dimensional space. Numerical results, when compared with those obtained with existing techniques in the literature, show the effectiveness of the proposed designs for SEE maximization.
AB - In this paper, we investigate different secrecy energy efficiency (SEE) optimization problems in a multiple-input single-output underlay cognitive radio (CR) network in the presence of an energy harvesting receiver. In particular, these energy efficient designs are developed with different assumptions of channels state information (CSI) at the transmitter, namely perfect CSI, statistical CSI and imperfect CSI with bounded channel uncertainties. In particular, the overarching objective here is to design a beamforming technique maximizing the SEE while satisfying all relevant constraints linked to interference and harvested energy between transmitters and receivers. We show that the original problems are non-convex and their solutions are intractable. By using a number of techniques, such as non-linear fractional programming and difference of concave (DC) functions, we reformulate the original problems so as to render them tractable. We then combine these techniques with the Dinkelbach's algorithm to derive iterative algorithms to determine relevant beamforming vectors which lead to the SEE maximization. In doing this, we investigate the robust design with ellipsoidal bounded channel uncertainties, by mapping the original problem into a sequence of semidefinite programs by employing the semidefinite relaxation, non-linear fractional programming and S-procedure. Furthermore, we show that the maximum SEE can be achieved through a search algorithm in the single dimensional space. Numerical results, when compared with those obtained with existing techniques in the literature, show the effectiveness of the proposed designs for SEE maximization.
KW - cognitive radio networks
KW - energy harvesting
KW - robust optimization
KW - Secrecy energy efficiency (SEE)
UR - http://www.scopus.com/inward/record.url?scp=85072570167&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2938874
DO - 10.1109/ACCESS.2019.2938874
M3 - Article
AN - SCOPUS:85072570167
SN - 2169-3536
VL - 7
SP - 126234
EP - 126252
JO - IEEE Access
JF - IEEE Access
M1 - 8822426
ER -