{'fraction_non_alphanumeric': 0.01944652206432311, 'fraction_numerical': 0.0, 'mean_word_length': 5.109589041095891, '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}}
Coverage-aware self-scheduling in sensor networks

One important measurement of a sensor network's performance is how well the sensor network can monitor a covered area, namely network coverage. We propose a scheme to improve the network coverage of a sensor network. We assume that each sensor can probabilistically detect a nearby event, and build a probabilistic model of network coverage by considering the data correlation among neighboring sensors. We also define the sensing denomination (SD) of a sensor using the network coverage model. A sensor's SD is regarded as the measurement of its contribution to the network coverage. The more the contribution of a sensor to the network coverage, the higher the sensor's SD is. Based on the location information of neighboring sensors, each sensor can calculate its SD value in a distributed manner. We then propose coverage-aware self-scheduling, in which sensors periodically calculate their SD values and probabilistically schedule their active and hibernating states according to their SD values, so that sensors with higher SD values have more chance to stay active. With the same amount of energy consumed, better network coverage can be achieved by applying the scheme. We then demonstrate through a numerical study that the scheme improves sensor network coverage considerably.