On the Secrecy Throughput Maximization for MISO Cognitive Radio Network in Slow Fading Channels

被引:101
|
作者
Wang, Chao
Wang, Hui-Ming [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Peoples R China
基金
中国国家自然科学基金;
关键词
Cognitive radio; physical layer security; artificial noise; secrecy throughput; secrecy outage; power allocation; PHYSICAL-LAYER SECURITY; MIMO;
D O I
10.1109/TIFS.2014.2356339
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper studies the secure multiple-antenna transmission in slow fading channels for the cognitive radio network, where a multiple-input, single-output, multieavesdropper (MISOME) primary network coexisting with a multiple-input single-output secondary user (SU) pair. The SU can get the transmission opportunity to achieve its own data traffic by providing the secrecy guarantee for the PU with artificial noise. Different from the existing works, which adopt the instantaneous secrecy rate as the performance metric, with only the statistical channel state information (CSI) of the eavesdroppers, we maximize the secrecy throughput of the PU by designing and optimizing the beamforming, rate parameters of the wiretap code adopted by the PU, and power allocation between the information signal and the artificial noise of the SU, subjected to the secrecy outage constraint at the PU and a throughput constraint at the SU. We propose two design strategies: 1) non-adaptive secure transmission strategy (NASTS) and 2) adaptive secure transmission strategy, which are based on the statistical and instantaneous CSIs of the primary and secondary links, respectively. For both strategies, the exact rate parameters can be optimized through numerical methods. Moreover, we derive an explicit approximation for the optimal rate parameters of the NASTS at high SNR regime. Numerical results are illustrated to show the efficiency of the proposed schemes.
引用
收藏
页码:1814 / 1827
页数:14
相关论文
共 50 条
  • [1] Secrecy Throughput Maximization for MISO Multi-Eavesdropper Wiretap Channels
    Wang, Wei
    Teh, Kah Chan
    Li, Kwok Hung
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12 (03) : 505 - 515
  • [2] Robust Beamforming Design: From Cognitive Radio MISO Channels to Secrecy MISO Channels
    Zhang, Lan
    Liang, Ying-Chang
    Pei, Yiyang
    Zhang, Rui
    [J]. GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 2373 - 2377
  • [3] Secrecy Rate Maximization in a Cognitive Radio Network with Artificial Noise Aided for MISO Multi-Eves
    Van-Dinh Nguyen
    Duong, Trung Q.
    Dobre, Octavia A.
    Shin, Oh-Soon
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [4] Throughput analysis of cooperative cognitive radio network over generalized κ-μ and η-μ fading channels
    Balam, Suresh Kumar
    Siddaiah, P.
    Nallagonda, Srinivas
    [J]. WIRELESS NETWORKS, 2019, 25 (08) : 4625 - 4638
  • [5] Throughput analysis of cooperative cognitive radio network over generalized κ–μ and η–μ fading channels
    Suresh Kumar Balam
    P. Siddaiah
    Srinivas Nallagonda
    [J]. Wireless Networks, 2019, 25 : 4625 - 4638
  • [6] MAXIMIZATION OF END TO END THROUGHPUT OF COGNITIVE RADIO NETWORK USING COOPERATIVE RELAY CHANNELS
    Sajitha, N.
    Suganthi, M.
    [J]. PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO'16), 2016,
  • [7] On Secrecy Throughput Optimization of a DF Relay Network Subjected to Slow Fading
    Zheng, Tong-Xing
    Wang, Hui-Ming
    [J]. 2014 GLOBECOM WORKSHOPS (GC WKSHPS), 2014, : 1296 - 1301
  • [8] Secrecy Analysis of Cognitive Radio Networks over Generalized Fading Channels
    Sun, Jiangfeng
    Bie, Zhisong
    Bie, Hongxia
    He, Pengfei
    Jin, Machao
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2020, 2020
  • [9] Secrecy Performance of Cognitive Radio Sensor Networks Over α - μ Fading Channels
    Yadav, Suneel
    [J]. IEEE SENSORS LETTERS, 2020, 4 (09)
  • [10] Secrecy capacity of SIMO and slow fading channels
    Parada, P
    Blahut, R
    [J]. 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 2152 - 2155