{'fraction_non_alphanumeric': 0.024650780608052588, 'fraction_numerical': 0.0, 'mean_word_length': 5.444444444444445, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Relay-Destination Pair Selection Mechanism for Secure Communications in Wireless Cooperative Relay Networks

This paper investigates the optimal relay-destination pair selection problem in a wireless cooperative relay network comprising one source, multiple Decode-and-Forward (DF) relays, a cluster of destinations and one eavesdropper of available channel information overhearing both the source-relay link and relay-destination link. More specifically, we first propose a new relay-destination pair selection mechanism that maximizes the signal-to-noise ratio (SNR) of the relay-destination link by selecting the optimal relay-destination pair from the pairs formed by the cluster of destinations and a set of relays able to decode the source message with a high level of security. We then derive the closed-from expressions of the outage probability (OP) and the intercept probability (IP) to model the reliability and security performances of the proposed relay-destination pair selection mechanism. Finally, extensive numerical results are provided to illustrate the parameters of network on the OP and IP performances of the proposed mechanism and also to show the inherent trade-off between OP and IP.