Relay Selection Schemes for Decode-and-Forward Cooperative Networks with Secrecy Constraints

We propose three relay selection schemes for a cooper-ative network with secrecy constraints, where a decode-and-forw -ard (DF) relaying policy is employed. The first scheme selects the relay having the minimum instantaneous signal-to-noise ratio (SN - R) to the eavesdropper, the second one is max-min approach and the third scheme is the optimal selection criteria that maximizes t - he achievable secrecy rate. We provide a comprehensive analysis and derive closed-form expressions of the secrecy outage probabil -ity. Finally, numerical results demonstrate that optimal selection has lowest outage probability, but its performance is only slightly better than that of max-min selection criteria.