{'fraction_non_alphanumeric': 0.006880733944954129, 'fraction_numerical': 0.0, 'mean_word_length': 5.613636363636363, '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}}
Simulation and Analysis of Delay Handling Mechanisms in Sensor Networks

Distributed sensor networks have found numerous real life applications. However the endemic ambiguity of real environments can disrupt the communication such that measurements arrive late at the active agent responsible for estimating the dynamics of the measured phenomenon. In this paper we simulate different types of delays and demonstrate the merit of using algorithms that choose to fuse only those delayed measurements that are expected to have considerable utility for the estimation procedure. Simulated results suggest that this approach can lead to energy savings since extra communication steps are avoided. There is also a strong implication that protocols for sensor networks should be coupled with the estimation procedure to facilitate packet-routing based on estimation performance.