{'fraction_non_alphanumeric': 0.01774622892635315, 'fraction_numerical': 0.0, 'mean_word_length': 5.5964912280701755, '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}}
Partition function game for rate optimization in random interference networks

Interference is one of the main limiting factors in wireless communication networks for system performance nowadays. In this paper, we study a coalitional game approach for rate optimization in a random interference networks where multiple transmission pairs transmit concurrently. We model the rate optimization problem as a partition function game. All transmission pairs form separated coalitions, and the pairs cooperate to transmit within each coalition. An iterative coalition structure generation algorithm is proposed to obtain partitions. This algorithm allows each transmission pair to make individual decision whether to stay in or depart from its current coalition. We prove that the proposed iterative algorithm can achieve a Nash-stable partition. In each coalition, we adopt the duality features of broadcast channel (BC) and multi-access channel (MAC) to maximize the sum-rate. Simulation results show that the proposed algorithm can improve the network performance significantly compared with location-based static partition forms.