{'fraction_non_alphanumeric': 0.014742014742014743, 'fraction_numerical': 0.002457002457002457, 'mean_word_length': 4.992647058823529, '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}}
A ranging scheme for asynchronous location positioning systems

In a real-time locating system which does not require time synchronization among nodes, it takes a very long time to complete a ranging process for a single location estimation. Long ranging time makes mobile nodes consume a significant amount of battery power and limits the number of mobile nodes that a single fixed node can handle during a specific time interval. Therefore, it is crucial to shorten the ranging time in asynchronous locating systems without degradation in ranging or locating accuracy. In this paper, we propose an asynchronous two-way ranging scheme which reduces ranging time by replying with multiple packets to a single ranging request. The algorithm reduces ranging time by 17% or more, compared to that of existing methods.