Secure Communications with Untrusted Secondary Nodes in Cognitive Radio Networks

被引:34
作者
Jeon, Hyoungsuk [1 ]
McLaughlin, Steven W. [2 ]
Kim, Il-Min [3 ]
Ha, Jeongseok [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Elect Engn, Taejon 305701, South Korea
[2] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
[3] Queens Univ, Dept Elect & Comp Engn, Kingston, ON K7L 3N6, Canada
基金
新加坡国家研究基金会;
关键词
Amplify-and-forward relay protocol; cognitive radio; eavesdropping; information-theoretic secrecy; untrusted secondary users; wiretap channel; WIRE-TAP CHANNEL; SECRECY CAPACITY; OUTAGE PROBABILITY; BROADCAST CHANNELS; ARTIFICIAL NOISE; FADING CHANNELS; POLAR CODES; INTERFERENCE; MESSAGES;
D O I
10.1109/TWC.2013.021214.130089
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider a cooperation scenario between primary users and untrusted secondary users in cognitive radio networks. The secondary users are willing to help the primary users to relay the primary users' messages in reward for being allowed to share the primary users' spectrum bands. However, the primary users might be reluctant to accept this help, since the secondary users are untrustworthy and may try unauthorized decoding of the primary users' messages. This paper will answer the question: when is this cooperation mutually beneficial for primary and secondary users? Taking an approach of information-theoretic secrecy, such as coding techniques for wiretap channels, the primary users can allow the secondary users to sense and relay the message, while ensuring that the secondary users are ignorant of the primary users' messages. We characterize an achievable secrecy rate of primary users with a rate of the secondary users' communication. From the derived rate pairs, an optimization problem is formulated such that the secondary transmitter distributes its transmit power to maximize its data rate while providing a higher secrecy rate to the primary users. We demonstrate that this cooperation can provide a positive secrecy rate, even when a non-cooperative scheme achieves a zero secrecy rate.
引用
收藏
页码:1790 / 1805
页数:16
相关论文
共 46 条
[31]   Secure Communication over MISO Cognitive Radio Channels [J].
Pei, Yiyang ;
Liang, Ying-Chang ;
Zhang, Lan ;
Teh, Kah Chan ;
Li, Kwok Hung .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2010, 9 (04) :1494-1502
[32]   Secure Communication in Stochastic Wireless Networks-Part II: Maximum Rate and Collusion [J].
Pinto, Pedro C. ;
Barros, Joao ;
Win, Moe Z. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (01) :139-147
[33]   Secure Communication in Stochastic Wireless Networks-Part I: Connectivity [J].
Pinto, Pedro C. ;
Barros, Joao ;
Win, Moe Z. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (01) :125-138
[34]  
Rathi V., 2010, ABS10094610 CORR, Vabs/1009.4610
[35]   Outage Probability Based Power Distribution Between Data and Artificial Noise for Physical Layer Security [J].
Romero-Zurita, Nabil ;
Ghogho, Mounir ;
McLernon, Des .
IEEE SIGNAL PROCESSING LETTERS, 2012, 19 (02) :71-74
[36]   COMMUNICATION THEORY OF SECRECY SYSTEMS [J].
SHANNON, CE .
BELL SYSTEM TECHNICAL JOURNAL, 1949, 28 (04) :656-715
[37]   Improving Secrecy Rate via Spectrum Leasing for Friendly Jamming [J].
Stanojev, Igor ;
Yener, Aylin .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (01) :134-145
[38]   Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes [J].
Subramanian, Arunkumar ;
Thangaraj, Andrew ;
Bloch, Matthieu ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2011, 6 (03) :585-594
[39]  
Sureka A., 2010, Proceedings of the Third Annual ACM Bangalore Conference, P1
[40]   Interference Assisted Secret Communication [J].
Tang, Xiaojun ;
Liu, Ruoheng ;
Spasojevic, Predrag ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (05) :3153-3167