Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

被引:28
作者
Bassily, Raef [1 ]
Ulukus, Sennur [2 ]
机构
[1] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
[2] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
Decode-and-forward (DF) scheme; information theoretic security; multiple hop strategies; relay networks; secrecy rate; SECRECY CAPACITY; THEOREMS; CHANNEL; ACCESS;
D O I
10.1109/JCN.2012.6292242
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decode-and-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.
引用
收藏
页码:352 / 363
页数:12
相关论文
共 26 条
[1]  
Bassily R., 2011, P IEEE GLOB
[2]  
Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd ed
[3]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[4]  
DONG L, 2008, P ALL C COMM CONTR C
[5]   Secrecy in Cooperative Relay Broadcast Channels [J].
Ekrem, Ersen ;
Ulukus, Sennur .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (01) :137-155
[6]   Towards an information theory of large networks: An achievable rate region [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (08) :1877-1894
[7]  
He X., 2009, PROVIDING SECRECY ST
[8]  
He X., 2009, SECURING WIRELESS CO
[9]   Cooperation With an Untrusted Relay: A Secrecy Perspective [J].
He, Xiang ;
Yener, Aylin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 57 (08) :3807-3827
[10]  
Huang J., 2010, P IEEE GLOB