Near-Optimal Modulo-and-Forward Scheme for the Untrusted Relay Channel

被引:19
作者
Zhang, Shengli [1 ,2 ,3 ]
Fan, Lisheng [4 ]
Peng, Mugen [5 ]
Poor, H. Vincent [6 ]
机构
[1] Shenzhen Univ, Sch Informat Engn, Shenzhen 518060, Peoples R China
[2] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710126, Peoples R China
[3] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
[4] Shantou Univ, Dept Elect Engn, Shantou 515063, Peoples R China
[5] Beijing Univ Posts & Telecommun, Minist Educ, Key Lab Univ Wireless Commun, Beijing 100876, Peoples R China
[6] Princeton Univ, Sch Engn & Appl Sci, Princeton, NJ 08544 USA
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Untrusted relay; lattice codes; modulo-and-forward; physical layer security; SECRECY CAPACITY; WIRETAP; SELECTION; SYSTEMS; CODES;
D O I
10.1109/TIT.2016.2530080
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional amplify-and-forward (AF) scheme shows poor performance in this situation because of the interference power dilemma. Providing better security by using stronger artificial noise will consume more power of the relay, impairing the confidential message's transmission. To solve this problem, this paper proposes a modulo-and-forward (MF) operation at the relay with nested lattice encoding at the source. For the proposed MF scheme with full channel state information at the transmitter (CSIT), theoretical analysis shows that the MF scheme approaches the secrecy capacity within 1/2 bit for all channel realizations, and, hence, achieves full generalized security degrees of freedom (G-SDoF). In contrast, the AF scheme can only achieve a small fraction of the G-SDoF. For the MF scheme without CSIT, the total outage event, defined as either connection outage or secrecy outage, is introduced. Based on this total outage definition, analysis shows that the proposed MF scheme achieves the full generalized secure diversity gain (G-SDG) of order one. On the other hand, the AF scheme can achieve a G-SDG of only 1/2 at most.
引用
收藏
页码:2545 / 2556
页数:12
相关论文
共 31 条
[1]   Nested Polar Codes for Wiretap and Relay Channels [J].
Andersson, Mattias ;
Rathi, Vishwambhar ;
Thobaben, Ragnar ;
Kliewer, Jorg ;
Skoglund, Mikael .
IEEE COMMUNICATIONS LETTERS, 2010, 14 (08) :752-754
[2]  
[Anonymous], 2011, P IEEE INT C COMM WO
[3]   Secrecy capacity of wireless channels [J].
Barros, Joao ;
Rodrigues, Miguel R. D. .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :356-+
[4]   Wireless information-theoretic security [J].
Bloch, Matthieu ;
Barros, Joao ;
Rodrigues, Miguel R. D. ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2515-2534
[5]   Lattices which are good for (almost) everything [J].
Erez, U ;
Litsyn, S ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) :3401-3416
[6]   Achieving 1/2 log(1+SNR) on the AWGN channel with lattice encoding and decoding [J].
Erez, U ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2293-2314
[7]   On the secrecy capacity of fading channels [J].
Gopala, Praveen Kumar ;
Lai, Lifeng ;
El Gamal, Hesham .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) :4687-4698
[8]   End-to-End Secure Multi-Hop Communication with Untrusted Relays [J].
He, Xiang ;
Yener, Aylin .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (01) :1-11
[9]   Providing Secrecy with Lattice Codes [J].
He, Xiang ;
Yener, Aylin .
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :1199-1206
[10]   Secure Communication Via an Untrusted Non-Regenerative Relay in Fading Channels [J].
Huang, Jing ;
Mukherjee, Amitav ;
Swindlehurst, A. Lee .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (10) :2536-2550