{'fraction_non_alphanumeric': 0.01763409257898604, 'fraction_numerical': 0.0, 'mean_word_length': 5.776119402985074, '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}}
Joint optimization of transmission scheduling and relay assignment for cooperative communications

Cooperative communication (CC) has been proposed to increase the wireless channel capacity and reliability by employing multiple single-antenna nodes to form a virtual antenna array. Many efforts focus on exploiting the benefits of CC among multiple source-destination pairs with an unrealistic assumption that each of them communicates over a dedicated channel without interference. In this paper, we investigate the transmission scheduling problem for multiple source-destination pairs under the assistance of a set of dedicated relay nodes on a single channel. By applying the protocol interference model, we propose a concept of cooperative link to characterize the interference regions of CC. Due to the NP-completeness of optimal scheduling, LP (linear programming) based heuristic algorithms are proposed to maximize the minimum transmission rate under a given relay assignment. Then, without specifying a relay node for each source-destination pair, we study the max-min rate problem by jointly considering transmission scheduling and relay assignment. Heuristic algorithms are proposed to solve this more challenging problem. Finally, extensive simulations are conducted to show that the proposed algorithm outperforms direct transmission substantially.