The Security-Reliability Tradeoff of Multiuser Scheduling-Aided Energy Harvesting Cognitive Radio Networks

被引:41
作者
Ding, Xiaojin [1 ,2 ]
Zou, Yulong [3 ]
Zhang, Genxin [3 ]
Chen, Xiaoshu [2 ]
Wang, Xiaojun [2 ]
Hanzo, Lajos [4 ]
机构
[1] Nanjing Univ Posts & Telecommun, Jiangsu Engn Res Ctr Commun & Network Technol, Nanjing 210003, Jiangsu, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
[3] Nanjing Univ Posts & Telecommun, Sch Telecommun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
[4] Univ Southampton, Dept Elect & Comp Sci, Southampton, Hants, England
基金
欧洲研究理事会; 中国国家自然科学基金; 英国工程与自然科学研究理事会; 美国国家科学基金会; 中国博士后科学基金;
关键词
Cognitive radio networks; energy harvesting; user scheduling; physical-layer security; outage probability; intercept probability; RESOURCE-ALLOCATION; SECRECY OUTAGE; RELAY; SELECTION; DESIGN;
D O I
10.1109/TCOMM.2019.2904258
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We study the physical-layer security of a cognitive radio system in the face of multiple eavesdroppers (EDs), which is composed of a secondary base station (SBS), multiple secondary users (SUs) as well as a pair of primary transmitter (PT) and primary receiver (PR), where the SUs first harvest energy from their received radio frequency signals transmitted by the PT and then communicate with the SBS relying on opportunistic scheduling. We consider two specific user scheduling schemes, namely, the channel-aware user scheduling (CaUS) and the energy-aware user scheduling (EaUS). In the CaUS scheme, an SU having the best instantaneous SU-SBS link (spanning from SUs to SBS) will be activated to communicate with the SBS. By contrast, the EaUS scheme takes into account both the amount of energy harvested from the PT and the instantaneous quality of the SU-SBS link. We analyze the security-reliability tradeoff (SRT) of both the CaUS and EaUS schemes in terms of their intercept versus outage probability. We also provide the SRT analysis of traditional round-robin user scheduling
引用
收藏
页码:3890 / 3904
页数:15
相关论文
共 41 条
[1]   Wireless Energy Harvesting in Cognitive Massive MIMO Systems With Underlay Spectrum Sharing [J].
Al-Hraishawi, Hayder ;
Baduge, Gayan Amarasuriya Aruma .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (01) :134-137
[2]   Enhancing Secrecy Rate in Cognitive Radio Networks via Stackelberg Game [J].
Al-Talabani, Ali ;
Deng, Yansha ;
Nallanathan, Arumugam ;
Nguyen, Huan X. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (11) :4764-4775
[3]  
[Anonymous], 2000, TABLE INTEGRALS SERI
[4]   Joint Power Allocation and Route Selection for Outage Minimization in Multihop Cognitive Radio Networks with Energy Harvesting [J].
Banerjee, Avik ;
Paul, Anal ;
Maity, Santi Prasad .
IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2018, 4 (01) :82-92
[5]   Artificial Noise-Aided User Scheduling for Optimal Secrecy Multiuser Diversity [J].
Bang, Inkyu ;
Kim, Su Min ;
Sung, Dan Keun .
IEEE COMMUNICATIONS LETTERS, 2017, 21 (03) :528-531
[6]   Practical Non-Linear Energy Harvesting Model and Resource Allocation for SWIPT Systems [J].
Boshkovska, Elena ;
Ng, Derrick Wing Kwan ;
Zlatanov, Nikola ;
Schober, Robert .
IEEE COMMUNICATIONS LETTERS, 2015, 19 (12) :2082-2085
[7]   Mode Selection in MU-MIMO Downlink Networks: A Physical-Layer Security Perspective [J].
Chen, Xiaoming ;
Zhang, Yu .
IEEE SYSTEMS JOURNAL, 2017, 11 (02) :1128-1136
[8]   Secrecy Rate Optimization for Cooperative Cognitive Radio Networks Aided by a Wireless Energy Harvesting Jammer [J].
Chen, Xueyan ;
Guo, Li ;
Li, Xingwang ;
Dong, Chao ;
Lin, Jiaru ;
Mathiopoulos, P. Takis .
IEEE ACCESS, 2018, 6 :34127-34134
[9]   Improving Secrecy Performance of a Wirelessly Powered Network [J].
Chen, Zhuo ;
Hadley, Lucinda ;
Ding, Zhiguo ;
Dai, Xuchu .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (11) :4996-5008
[10]   Secure Communication in Uplink Transmissions: User Selection and Multiuser Secrecy Gain [J].
Deng, Hao ;
Wang, Hui-Ming ;
Yuan, Jinhong ;
Wang, Wenjie ;
Yin, Qinye .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (08) :3492-3506