{'fraction_non_alphanumeric': 0.011780104712041885, 'fraction_numerical': 0.0, 'mean_word_length': 5.12, '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}}
A power efficient routing protocol based on balanced tree in wireless sensor networks

A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime. In this paper, we propose a routing protocol based on a balanced tree, called BATR (balanced aggregation tree routing), which uses near optimal minimal spanning tree for balancing the power consumptions over all nodes. Our key idea is that a near optimal data aggregation can be achieved in terms of network lifetime when power consumption at each node can be nicety balanced. Simulation results show that the BATR can lengthen system lifetime as compared with the conventional data aggregation protocols.