{'fraction_non_alphanumeric': 0.015783540022547914, 'fraction_numerical': 0.0, 'mean_word_length': 5.626865671641791, '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}}
On the Design of Scheduling Algorithms for Wireless Navigation Networks

Network navigation is a promising paradigm for providing accurate location-awareness in wireless environments, where mobile nodes estimate their locations based on inter- and intra-node measurements. In the presence of limited wireless resources, only a subset rather than all of the node pairs can perform inter-node measurements. Therefore, it is crucial to design efficient scheduling algorithms for selecting node pairs at different times for inter-node measurements. This paper develops a framework for the design of scheduling algorithms based on random access for network navigation. The proposed algorithms are suitable for practical operation of wireless navigation networks due to their distributed nature, and the optimized access probabilities of the agents lead to significant performance improvement.