{'fraction_non_alphanumeric': 0.024232633279483037, 'fraction_numerical': 0.0032310177705977385, 'mean_word_length': 5.458333333333333, '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}}
Dividing target-coverage graph in Wireless Sensor Networks

In order to reduce the algorithm complexity of the target coverage problem which is a NP-complete problem, we design three approaches to shorten the network scale. We firstly delete redundant sensor nodes, secondly remove the redundant targets, and thirdly divide the target-coverage graph into independent sub-graphs, and present the construct independent sub graph algorithm (CISGA) to divide target-coverage graph. Measurement results show that CISGA could reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem.