{'fraction_non_alphanumeric': 0.022953328232593728, 'fraction_numerical': 0.0, 'mean_word_length': 4.918552036199095, '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}}
Balanced Tree-Based Energy Aware Routing for Wireless Sensor Networks

Tree Routing (TR) is a simplified routing algorithm suggested for simple low-cost and lowpower wireless sensor networks. Unlike the node in Flooding/Gossiping algorithms, the node in TR transmits the data packets either upwards to its parent node or downwards to one of its children. The major drawback of TR is the energy balancing as compared with more sophisticated energy aware routing protocols. To prolong and maximize the network lifetime, the final objective purpose should be let each sensor in the same level of tree consume their energy at similar rate. However, practically this could be difficult due to the fact that the close nodes to BS will die out first and the leaves nodes will die out last. In this work, we presented Balanced Tree-Based Energy Aware Routing (BTEAR), which is designed to achieve a potential balancing of energy consumption per level in routing tree such that each node in the same level has approximately the same number of children. Simulation results expose that BTEAR not only outperforms TR in terms of network lifespan, but also is more energy-efficient than TR. Keywords— Wireless sensor networks; wireless sensor network routing ; BTEAR; TR; hops count; energy efficiency; network lifetime.