Secrecy Outage and Diversity Analysis of Cognitive Radio Systems

被引:135
作者
Zou, Yulong [1 ]
Li, Xuelong [2 ]
Liang, Ying-Chang [3 ,4 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Telecommun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
[2] Chinese Acad Sci, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Ctr Opt IMagery Anal & Learning OPTIMAL, Xian 710119, Shaanxi, Peoples R China
[3] ASTAR, I2R, Singapore, Singapore
[4] Univ Elect Sci & Technol China, Chengdu 610054, Peoples R China
基金
中国国家自然科学基金;
关键词
Cognitive radio; multi-user scheduling; secrecy outage probability; secrecy diversity; diversity order; PHYSICAL-LAYER SECURITY; ARTIFICIAL-NOISE; NETWORKS; TRADEOFF;
D O I
10.1109/JSAC.2014.141121
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we investigate the physical-layer security of a multi-user multi-eavesdropper cognitive radio system, which is composed of multiple cognitive users (CUs) transmitting to a common cognitive base station (CBS), while multiple eavesdroppers may collaborate with each other or perform independently in intercepting the CUs-CBS transmissions, which are called the coordinated and uncoordinated eavesdroppers, respectively. Considering multiple CUs available, we propose the round-robin scheduling as well as the optimal and suboptimal user scheduling schemes for improving the security of CUs-CBS transmissions against eavesdropping attacks. Specifically, the optimal user scheduling is designed by assuming that the channel state information (CSI) of all links from CUs to CBS, to primary user (PU) and to eavesdroppers are available. By contrast, the suboptimal user scheduling only requires the CSI of CUs-CBS links without the PU's and eavesdroppers' CSI. We derive closed-form expressions of the secrecy outage probability of these three scheduling schemes in the presence of the coordinated and uncoordinated eavesdroppers. We also carry out the secrecy diversity analysis and show that the round-robin scheduling achieves the diversity order of only one, whereas the optimal and suboptimal scheduling schemes obtain the full secrecy diversity, no matter whether the eavesdroppers collaborate or not. In addition, numerical secrecy outage results demonstrate that for both the coordinated and uncoordinated eavesdroppers, the optimal user scheduling achieves the best security performance and the round-robin scheduling performs the worst. Finally, upon increasing the number of CUs, the secrecy outage probabilities of the optimal and suboptimal user scheduling schemes both improve significantly.
引用
收藏
页码:2222 / 2236
页数:15
相关论文
共 27 条
  • [1] [Anonymous], IEEE T INF THEORY
  • [2] [Anonymous], 2008, P80222D10 IEEE
  • [3] Wireless information-theoretic security
    Bloch, Matthieu
    Barros, Joao
    Rodrigues, Miguel R. D.
    McLaughlin, Steven W.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2515 - 2534
  • [4] Cognitive Amplify-and-Forward Relay Networks Over Nakagami-m Fading
    Duong, Trung Q.
    da Costa, Daniel Benevides
    Elkashlan, Maged
    Vo Nguyen Quoc Bao
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2012, 61 (05) : 2368 - 2374
  • [5] Spectrum sharing for unlicensed bands
    Etkin, Raul
    Parekh, Abhay
    Tse, David
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (03) : 517 - 528
  • [6] A Survey on Security Threats and Detection Techniques in Cognitive Radio Networks
    Fragkiadakis, Alexandros G.
    Tragos, Elias Z.
    Askoxylakis, Ioannis G.
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2013, 15 (01): : 428 - 445
  • [7] Guaranteeing secrecy using artificial noise
    Goel, Satashu
    Negi, Rohit
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (06) : 2180 - 2189
  • [8] On the secrecy capacity of fading channels
    Gopala, Praveen Kumar
    Lai, Lifeng
    El Gamal, Hesham
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) : 4687 - 4698
  • [9] Outage Probability of Cognitive Relay Networks with Interference Constraints
    Lee, Jemin
    Wang, Hano
    Andrews, Jeffrey G.
    Hong, Daesik
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (02) : 390 - 395
  • [10] LEUNGYANCHEONG SK, 1978, IEEE T INFORM THEORY, V24, P451, DOI 10.1109/TIT.1978.1055917