{'fraction_non_alphanumeric': 0.013848396501457727, 'fraction_numerical': 0.0, 'mean_word_length': 5.665048543689321, '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}}
Mobile Localization Techniques for Wireless Sensor Networks: Survey and Recommendations

This paper provides a comprehensive survey of pioneer and state-of-the-art localization algorithms based on the mobility of the network. The basic concepts of the localization task in a wireless sensor network are revisited and the most common techniques suitable for random mobility are reviewed. This survey compiles and discusses the most relevant algorithms regarding localization in mobile networks, focusing on scenarios where nodes have no control over their mobility and hardware restrictions are imposed, including recent advances in learning-based solutions. It focuses on presenting techniques that do not rely on human intervention or a specialized field configuration. This unpredictability brings challenges that are not present in a static network nor in a mobile network built upon robotic entities. The basis for theoretical concepts of localization algorithms is gathered and organized in a comprehensive way, so researchers may quickly get started in this field. Significant aspects addressed throughout the article, such as mobility pattern, range scheme, and computational complexity are organized and discussed as well as performance data for quantitative analysis alongside related ponderations. This survey concludes by pointing out current and future trends.