{'fraction_non_alphanumeric': 0.015007898894154818, 'fraction_numerical': 0.0, 'mean_word_length': 5.848648648648648, '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}}
Scheduling for Scalable Energy-Efficient Localization in Mobile Ad Hoc Networks

Existing localization schemes in wireless ad hoc networks rely on redundant measurements from multiple devices with known positions in order to reduce error. However, when node density is high this can result in excessive localization messages with minimal improvement on position accuracy. In this work we present a scheduling algorithm to select a subset of active reference nodes to be used in localization, which has the effect of reducing message overhead, increasing network lifetime, and improving localization accuracy in dense mobile networks. We investigate the Cramer-Rao Lower Bound (CRLB) and existing single-hop localization techniques to determine the optimal average node density to ensure sufficient estimation accuracy. The correctness and effectiveness of the proposed scheme is evaluated through extensive simulation results, which show that in dense networks localization messages are greatly reduced and network lifetimes are more than doubled, while maintaining high estimation accuracy. Furthermore, computational time of localization algorithms is reduced, which effectively decreases accumulated error due to computation latency when locating a mobile device.