{'fraction_non_alphanumeric': 0.03154205607476635, 'fraction_numerical': 0.0, 'mean_word_length': 5.301470588235294, '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 Clustering-Based K-Coverage Algorithm for Mobile Wireless Sensor Networks

To obtain more accurate and comprehensive information from target monitoring area in mobile wireless sensor networks (mWSN), multiple area coverage is often considered. However, it may cause coverage holes and inefficiencies in a mWSN due to sensor nodes' moving, energy loss, physical damage, errors, failures or other factors. To address this problem, a k-coverage algorithm for mobile wireless sensor network based on clustering(k-mWSN) is proposed in this paper, it not only can accurately monitor coverage holes in the target network, but also can rapidly repair and achieve uniform k-coverage . Simulation results show, by applying this algorithm to mWSNs, it can perform effectively in achieving uniform k-coverage, thus can increase coverage area and extend network life.