{'fraction_non_alphanumeric': 0.020038167938931296, 'fraction_numerical': 0.003816793893129771, 'mean_word_length': 5.639240506329114, '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}}
Distributed power allocation for device-to-device communications underlaying cellular networks

In recent years, D2D communication technology has been widely used in cellular networks. By introducing D2D users, cellular networks can improve the efficiency of using resources, which can improve the quality of communication. In the system where both D2D users and cellular networks users exist, we studied the method how every user is introduced into the cellular networks to improve the resource utilization. The distributed resource allocation for D2D communications underlying cellular networks is considered. By the game theory, the problem can be considered as a non-cooperative game. Firstly, Nash Equilibrium's existence is proved. Then a distributed algorithm is designed to solve the power allocation problem. Finally, Nash Equilibrium uniqueness and the global convergence of asynchronous distributed algorithm are proved. Simulation results show that the algorithm is convergent,which can get optimal power allocation by iteration method.