{'fraction_non_alphanumeric': 0.015056461731493099, 'fraction_numerical': 0.0, 'mean_word_length': 5.384, '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}}
Barrier coverage mechanism for traffic count in wireless sensor networks

Barrier coverage refers to the coverage problem where a set of sensors aims to detect the invalid crossing of the boundaries. Many papers have discussed the issues of barrier coverage problem. However, most of them applied the applications of boundary surveillance problem and used the Boolean Sensing Model (BSM) as their sensing model. This paper investigates the new barrier issue which considers the traffic count application and uses the Probabilistic Sensing Model (PSM) where the detection probability depends on the distance between the sensor and object. Simulation results show that the proposed algorithm has better performance, as compared with existing work, in terms of surveillance quality and hardware cost.