{'fraction_non_alphanumeric': 0.01685985247629083, 'fraction_numerical': 0.0, 'mean_word_length': 5.129032258064516, '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}}
Dynamic Clustering Algorithm for Tracking Target with High and Variable Celerity

Target tracking with the wireless sensors networks is to detect and locate a target on its entire path through a region of interest. This application arouses interest in the world of research for its many fields of use. Wireless sensor networks, thanks to their versatility, can be used in many hostile environments and inaccessible to humans. However, with a limited energy, they cannot remain permanently active which can significantly reduce their lifetime. The formation of a cluster network seems an effective mechanism to increase network lifetime ". We propose to build optimal dynamic clusters on the target trajectory. For increasing energy efficiency, our algorithm integrates for the first time, to our knowledge, strategies to avoid overlapping clusters and a model to wake up the sensors, adapting to the context of targets with large and variable speed.