{'fraction_non_alphanumeric': 0.014785992217898832, 'fraction_numerical': 0.0, 'mean_word_length': 5.21256038647343, '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}}
Data-Coverage Sleep Scheduling in Wireless Sensor Networks

Data samples sensed from a densely deployed sensor network often exhibit strong spatial and temporal correlation. Sampling and transmitting these highly correlated data through wireless channel would result in excessive energy consumption. One way to conserve energy is to set a portion of sensors into sleep mode provided their missing data can be well recovered by sensors that remain active. Different from traditional full area coverage sleep scheduling schemes, we propose a data-coverage scheme based on the ability of active nodes to recover the missing data of sleeping nodes. For this purpose, we present the scheme to extract correlation among sensing data of nodes. We also propose the greedy reduction algorithm (GRA) to select the set of active sensors. The missing data of sleeping nodes is recovered using active nodespsila sensing data as well as the correlation among data of nodes. Using a publicly released sensing data set, we analyze how to implement this data-coverage sleep scheduling scheme. We also evaluate its performance and conduct comparison experiments with the full area coverage scheme. Experimental results indicate that the data-coverage sleep scheduling scheme offers superior performance.