{'fraction_non_alphanumeric': 0.015184381778741865, 'fraction_numerical': 0.0, 'mean_word_length': 4.76875, '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}}
Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks

Power saving is an important issue in ad-hoc wireless networks, where no centralized communication is issued. Each node works as router to the others to allow the network connectivity. So, each node consumes parts of its energy in a forwarding others packets. In this paper we propose a self adjustment power saving mechanism for routing in ad-hoc wireless networks that results in significant power saving for all the network. Our mechanism is based on TDA (topology discovering algorithm) in which each node knows who are the active nodes in a fraction of the network. By determined simulation experiments, our simulation results show that in a topology like that constructed by TDA, the power consumption in routing is independent on the network size and is related only to the height of the tree built by the algorithm and to the packet size