{'fraction_non_alphanumeric': 0.016666666666666666, 'fraction_numerical': 0.0, 'mean_word_length': 5.761261261261262, '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}}
Research on connectivity to Localized Area Coverage algorithm In wireless Sensor Networks

In wireless sensor networks, the area coverage sensing technology is the one of the key foundation technologies. IT is concerned about how to prolong the network lifetime based on meeting user sensing demands. Among the study of area coverage sensing technology, localized area coverage algorithm is gradually attracting wide attention for its less traffic and lower single-node computation. At present, the existing localized area coverage algorithms mainly depends on connectivity critical condition proposed by Xing. This condition is concerned about how to improve the perceived quality to coverage full area, ignores further studying for the network node connectivity. So, this connectivity condition is from the perspective of single node connectivity, resulting in limited conditions for algorithm application. For above issues, firstly, the coverage node set connectivity is introduced for localized area coverage algorithm in this paper. Secondly, the loose connectivity critical condition to ensure coverage and connectivity is re-analyzed from the perspective of network connectivity. Finally, a circle intersection localized coverage algorithm under different conditions to maintain connectivity is designed, to extend the application scene. Simulation results show that the algorithm, under different conditions, can maintain network node connectivity on the basis of ensuring full area coverage.