{'fraction_non_alphanumeric': 0.030434782608695653, 'fraction_numerical': 0.0026086956521739132, 'mean_word_length': 5.430167597765363, '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}}
SPC12-5: Relay Selection in Multi-Node Cooperative Communications: When to Cooperate and Whom to Cooperate with?

In this paper, we propose a new cooperative communication protocol, which achieves high bandwidth efficiency while guaranteeing full diversity order. The proposed scheme considers relay selection via the available partial channel state information (CSI) at the source and the relays. More precisely, the source determines when it needs to cooperate with one relay only among arbitrary N relays and which relay to cooperate with in case of cooperation, i.e., "When to cooperate?" and "Whom to cooperate with?". In case of cooperation, the source employs the optimal relay, which has the maximum instantaneous scaled harmonic mean function of its source-relay and relay-destination channels' gains. For the symmetric scenario, we prove that full diversity is guaranteed and that a significant increase of the bandwidth efficiency is achieved. Furthermore, we show the tradeoff between the achievable bandwidth efficiency and the corresponding error rate. Finally, the obtained analytical results are verified through computer simulations.