{'fraction_non_alphanumeric': 0.0199468085106383, 'fraction_numerical': 0.0, 'mean_word_length': 5.459227467811159, '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}}
Low-coordination wake-up algorithms for multiple connected-covered topologies in sensor nets

It is likely that low-cost energy constrained sensor devices will be prone to failure. This necessitates that these devices must be deployed in higher densities than required. At a high level, the simplest strategy that can be exploited to prolong network lifetime is to activate only a subset of nodes at a time, while keeping the other nodes asleep, so that the topology formed by the active nodes is connected and provides coverage of the area of interest. Providing diversity in the connected sets of nodes also improves network lifetime significantly. We propose and evaluate different distributed, random and pattern-based wake-up policies for sensor nodes to construct connected-covered topologies. Through analysis and simulations we demonstrate that in dense sensor deployment scenarios, these policies can construct near-optimal topologies with minimal coordination between nodes, as long as location information is available at the individual sensor nodes. Based on these observations, we develop and evaluate a few simple distributed, wake-up based topology construction algorithms that can realise similar performance bounds in realistic sensor deployments, with varying node densities. These algorithms differ in terms of the required level of coordination and the use of sensor location information, and generate connected-covered topologies efficiently, with very low message-exchange overhead.