{'fraction_non_alphanumeric': 0.01733232856066315, 'fraction_numerical': 0.0, 'mean_word_length': 4.928571428571429, '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 low overhead routing protocol for ad hoc networks

The Ad hoc network is a type of wireless network characterized by its dynamic and flexible nature. At any moment, the network members are able to change their positions which makes the topological information hard to maintain up to date. Also, unlike the standard wireless network, this type of network doesn't need a preset infrastructure to operate. The essence of the auto-organization feature of the Ad hoc network is the routing protocol. In order to build and maintain the paths between the mobile users, the Ad hoc routing protocol is executed in a distributed fashion. To manage the random topology changes, the routing information is advertised periodically to update the topological view of the network members. As a result, this type of protocol consumes a portion of the network resources. Considering that the Ad hoc network is usually composed of mobile devices equipped with restricted resources, it's necessary to limit the complexity of the routing protocol. In this paper, we present an algorithm for a proactive protocol, that is able to maintain the connectivity between all the network members without generating a huge volume of overhead. Moreover, we compare the results obtained from the tests of the proposed algorithm with other existing protocols.