{'fraction_non_alphanumeric': 0.02991026919242273, 'fraction_numerical': 0.0, 'mean_word_length': 5.435897435897436, '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}}
Generalized User-Relay Selection in Network-Coded Cooperation Systems

We study the performance of generalized user-relay selection (GURS) scheme in network-coded cooperation systems. In particular, we propose the most general case of user-relay selection mechanism that selects any arbitrary subsets of users and relays subject to any practical constraints such as load balancing conditions, scheduling policy, and other factors. Our results thus can be applied to a large set of situations and include all existing results in the literature as special cases. We develop performance characterizations of the system under consideration in terms of outage probability over non-identically and independently distributed (n.i.i.d.) Rayleigh fading channels. The asymptotic outage expressions at high signal-to-noise ratio (SNR) regime are further derived and then, based on the derived expressions, we quantify the diversity order. The theoretical derivations are validated through Monte-Carlo simulations.