{'fraction_non_alphanumeric': 0.021208907741251327, 'fraction_numerical': 0.0042417815482502655, 'mean_word_length': 5.251655629139073, '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}}
A homology-based coverage hole detection algorithm in wireless sensor networks

In wireless sensor networks (WSNs), coverage holes may appear because of sensors' random deployment, sensor destruction or consumption of sensor power. Discovery of boundaries of coverage holes is important for repairing these holes and optimizing the whole network. In this paper, we use Rips complex as system model based on homology knowledge. We adopt a detection algorithm to find non-triangular holes only dependent on the connectivity information between sensors. Rely on the definition promoted, we can find all boundary edges and then initiate the process of finding coverage holes. We prove that our algorithm can reduce computation complexity of coverage holes detection by comparing with another homology-based method. And simulation results show that our algorithm can discover almost all non-triangular holes with the accuracy reaching up to 99.99%.