{'fraction_non_alphanumeric': 0.013868613138686132, 'fraction_numerical': 0.00145985401459854, 'mean_word_length': 4.858974358974359, '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 new routing algorithm for energy reduction in wireless sensor networks

Wireless sensor networks are set of thousands or more micro sensor nodes that one of the most important constraints of them is energy consumption of these sensor nodes .Since these nodes have very small dimensions, energy production needs batteries with limited power. It is obvious that the problem of energy reduction was always one of the biggest challenge in these networks. In these networks, routing is data-centric. On the other hand, in these networks it is only important to receive the data packet by the BS. In this paper we propose a new method for routing in wireless sensor networks that instead of using the traditional routing methods attempts to add nodes which have the minimum distances from each other. In our innovative method, we define node arrangement such that always data packets which are sent, arrive to destination through the shortest path which cause to reduce the total energy consumption. Since the sensor nodes which are near to each other have many redundant data, we can aggregate data packet continuously in the network. Simulation results show that our proposed algorithm works very well in spaces with large dimensions (size) and can reduce the total energy consumption more than the best traditional algorithms such as PEGASIS and leach with factor of 34%.