{'fraction_non_alphanumeric': 0.019583843329253364, 'fraction_numerical': 0.0, 'mean_word_length': 5.341085271317829, '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}}
Investigation of the polar coordinate system for wireless self-organizing networks

This electronic document proposes the use of a polar coordinate system for routing in wireless self-organizing networks. For this, algorithms were formulated for constructing a polar axis and a central node, for assigning polar coordinates to network nodes and routing using the greedy advance method. The developed method is compared with other known routing algorithm (neighborhood method). To solve this problem, a simulator has been developed, that operates with integer data in the Cartesian coordinate system, angle and radius vector in the polar coordinate system. In this program, experiments were conducted to build a route, which showed the features of using the method of greedy advancement in the polar coordinate system.