{'fraction_non_alphanumeric': 0.011098779134295227, 'fraction_numerical': 0.0, 'mean_word_length': 5.263888888888889, '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}}
Energy Efficient Routing in Adhoc Networks

In this paper, we address the problem of energy efficient routing in homogeneous and heterogeneous wireless ad hoc networks aiming at maximize the network lifetime. We define the network lifetime as the number of transmissions the node can perform until the first node fails due to battery exhaustion. In static networks we find a routing (spanning) tree which maximizes the network lifetime without tree update. We have proposed a Global weighted incremental power model and Global weighted post sweep for extending the life time of heterogeneous wireless ad hoc wireless network that gives better performance than the WBIP(weighted broadcast incremental protocol) implementation. We consider the amount of energy the node has compared to the maximum energy in network as the parameter in the cost metric function for constructing a efficient routing tree.