{'fraction_non_alphanumeric': 0.01662971175166297, 'fraction_numerical': 0.0, 'mean_word_length': 5.02, '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 simple routing algorithm for Multi-hop Wireless Network

Routing plays a critical role in determining the performance of a multi-hop wireless mesh network. When there are a large number of nodes available the task of communication becomes quite challenging. Our main concern is energy-efficient routing. Energy conservation is a critical issue in wireless networks for node and network lifetime, as the nodes are powered by batteries only. One major approach for energy conservation is to establish a communication session which consumes the lowest total transmission energy. This optimization problem is referred as minimum-energy routing. Our work, we have considered a simple routing algorithm which can be implemented in both centralized and distributed manner. Energy consumed in each of the route is calculated. The route in which energy consumption is the less is chosen for the communication.