{'fraction_non_alphanumeric': 0.0205078125, 'fraction_numerical': 0.001953125, 'mean_word_length': 4.662983425414365, '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}}
Distributed multi-hop routing algorithm for wireless sensor networks

In a Wireless Sensor Network (WSN), routing is the process of finding a
 cost effective route in terms of power consumption. As an evaluation
 criterion for the WSN performance, network lifetime is directly affected by
 the routing method. In a wide variety of WSNs, different techniques are used
 as routing methods, such as shortest distance path. In this paper, we
 propose a novel algorithm, optimizing power consumption in WSN nodes, based
 on the shortest path algorithm. In this approach, the energy level of nodes
 and their geographical distance from each other contribute to the weight of
 the connecting path. The proposed algorithm is used as a data dissemination
 method in WSNs with randomly scattered nodes. We also apply Dijkstra?s
 shortest path algorithm to the same networks. The results showed that the
 proposed algorithm increases the network lifetime up to 30 % by preventing
 nodes with low charge levels from early disconnection.