{'fraction_non_alphanumeric': 0.019099590723055934, 'fraction_numerical': 0.001364256480218281, 'mean_word_length': 4.5606060606060606, '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 new multi-path AODV routing based on distance of nodes from the network center

Routing is a very important matter for ad hoc networks which means choosing the suitable and correct path for transferring data from a source node to a destination node. Today, the methods using several paths for routing are attended very much. In this paper, a new plan in multiple paths on-demand distance vector (AODV) routing is presented which its routing is based on the distance of nodes from the center of the network. In this new routing algorithm, the number of dropped packets will be decreased and indeed this will be happened with more balancing in the network. This claim will be proved by some simulations using ns2 (network simulator).