{'fraction_non_alphanumeric': 0.019182652210175146, 'fraction_numerical': 0.004170141784820684, 'mean_word_length': 5.451612903225806, '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 power allocation and relay assignment for max-min fairness in cooperative networks

Cooperative communication is shown to be a promising technology to enhance the capacity of wireless transmission without additional equipments. Under this communication paradigm, both relay selection and power allocation significantly affect the overall system performance. Thus, this paper studies the joint power allocation and relay assignment problem to optimize the Max-Min fairness of cooperative network. We first analyze the trade-off between the bandwidth provision and power consumption for different communication schemes. According to the analytic results, a heuristic algorithm PRF is designed to determine the fairness factor with the binary searching. The analyses show that PRF algorithm can obtain the approximate ratio 1− ξ, where ξ is an arbitrarily small positive constant. Meanwhile, this paper also presents another heuristic algorithm JFAP, which uses the offer-and-gain mechanism to reach the Max-Min fairness. The simulation results show that PRF and JFAP algorithms can improve the fairness factor at least 36% and 32% compared with the direct transmission scheme in many situations.