Performance analysis for relay selection with secrecy constraints in cooperative networks

In this paper, we consider relay selection based on non-jamming and jamming in cooperative networks with secrecy constraints. The proposed scheme is based on instantaneous channel state information. The expressions are derived for average secrecy rate and outage probability in cooperative networks using Decode-and-Forward (DF) strategy. Monte Carlo simulations are carried out to validate our analysis.

[1]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[2]  John S. Thompson,et al.  Relay selection for secure cooperative networks with jamming , 2009, IEEE Transactions on Wireless Communications.

[3]  Ming Jiang,et al.  Closed-Form Expressions for Relay Selection with Secrecy Constraints , 2010, ArXiv.

[4]  Miguel R. D. Rodrigues,et al.  Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[6]  Björn E. Ottersten,et al.  Collaborative-Relay Beamforming With Perfect CSI: Optimum and Distributed Implementation , 2009, IEEE Signal Processing Letters.

[7]  Hyundong Shin,et al.  Cooperative Communications with Outage-Optimal Opportunistic Relaying , 2007, IEEE Transactions on Wireless Communications.

[8]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[9]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.