{'fraction_non_alphanumeric': 0.018404907975460124, 'fraction_numerical': 0.0, 'mean_word_length': 5.465346534653466, '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}}
On Exploiting Cooperative, Channel and Multiuser Diversities in Wireless Relay Networks

In this paper, we exploit cooperative diversity, channel diversity and multi-user diversity gains in an OFDMA-based wireless relay network by studying a joint channel and relay assignment problem. This problem turns out to be NP-hard. First, a mixed integer linear programming formulation is presented to provide optimal solutions. We then present a constant factor approximation algorithm and two heuristic algorithms to solve this problem in polynomial time. Extensive simulation results have been presented to justify the efficiency of the proposed algorithms.