{'fraction_non_alphanumeric': 0.02191464821222607, 'fraction_numerical': 0.0, 'mean_word_length': 5.477611940298507, '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}}
Network Formation Game for Routing in Unmanned Aerial Vehicle Networks

With the development of electronics, sensors, and communications, the widespread deployment of unmanned aerial vehicles (UAVs) is rapidly growing in various applications, such as collecting and transmitting data to the ground station, which may be located far from the operational area. The wireless channels may generally degrade due to long distance or line-of-sight obstacles. In this paper, based on the network formation game, a distributed routing algorithm is proposed to maximize considering the achievable data rate, wireless latency and energy consumption comprehensively. To solve this game, each UAV plays its best response in a decentralized manner that a stable network can be achieved. Finally, some comparisons are provided to illustrate the efficiency of the proposed algorithm.