{'fraction_non_alphanumeric': 0.015184381778741865, 'fraction_numerical': 0.0010845986984815619, 'mean_word_length': 4.95483870967742, '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}}
DyKCo: Dynamic k-coverage in wireless sensor networks

In Wireless Sensor Networks maintaining complete coverage over an area is one of the fundamental problems. The network must be able to provide the requested coverage while maximizing the network lifetime through scheduling sleep for extraneous nodes. The network should also be able to configure itself to provide different levels of coverage for different applications. In this paper we present DyKCo, a probabilistic method to provide dynamic k-coverage on the area of an event. Our proposed method creates 1-coverage on the whole sensing area and creates k-coverage on the area of a detected event. Our simulations show that we can achieve very high energy savings and high coverage which result in longer network lifetime and higher accuracy. Due to probabilistic nature of our approach it needs much less communication than similar methods to provide k-coverage.