{'fraction_non_alphanumeric': 0.01750291715285881, 'fraction_numerical': 0.0, 'mean_word_length': 4.876712328767123, '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}}
Hole Avoiding in Advance Routing in Wireless Sensor Networks

Energy consumption is a major issue when designing routing protocols in wireless sensor networks. We propose a novel hole avoiding in advance routing protocol (HAIR) to address this issue. In the proposed protocol, a data packet can avoid meeting a "hole" in advance instead of bypassing a hole when it meets the hole as existing hole avoiding re-routing protocols (HARR) do. We prove that the proposed protocol can always find a routing path between a given source node and the sink if such a routing path does exist in the network. Simulation studies show that the proposed HAIR protocol constructs routing paths with shorter routing distance and less energy consumption in comparison with the existing HARR protocols. The proposed protocol can be used in large-scale wireless sensor networks.