{'fraction_non_alphanumeric': 0.02619589977220957, 'fraction_numerical': 0.0, 'mean_word_length': 5.104166666666667, '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}}
BER analysis of improved path selection criterion for cluster-based multi-hop cooperative networks

In this paper, we study path selection criteria in cluster-based multi-hop cooperative networks with decode-and-forward relays over Rayleigh fading channels. The hop-by-hop path selection criterion, in which routing is done based on local channel state information, loses diversity gain due to lack of relay selection in the last hop. To overcome this issue, we study an improved path selection strategy, in which final two hops are selected jointly to achieve the maximum spatial diversity. The exact and asymptotic expressions of bit-error-rate are derived for both the path selection schemes. Numerical results show that the improved path-selection criterion performs far better than that of hop-by-hop selection criterion with a little increase in implementation complexity.