{'fraction_non_alphanumeric': 0.018018018018018018, 'fraction_numerical': 0.005405405405405406, 'mean_word_length': 4.878306878306878, '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}}
Strong Barrier Coverage for Intrusion Detection in Wireless Sensor Network

Due to the feature of self-organization and selfconfiguration of wireless sensor networks, it is very suitable for the application of intrusion detection, such as national boundary monitoring. As for the cost of sensor nodes, deriving the critical density is a fundamental problem for intrusion detection. Recently there has been a lot of research on the problem of intrusion detection by modeling it as a barrier coverage problem. Different from previous works on the distribution of sensor nodes, which usually lead to an upper bound of density, we try to get the critical density for intrusion detection. In this paper, we model the problem of intrusion detection as a strong barrier coverage problem and solve it by a percolation method. We prove that the critical node density for intrusion detection is 2ln2. When the node density is smaller than 2ln2, there is always a crossing path that cannot be detected by sensor networks. By contrary, when the density is larger than 2ln2, there are, with high probability, no such paths.