{'fraction_non_alphanumeric': 0.02699662542182227, 'fraction_numerical': 0.003374578177727784, 'mean_word_length': 4.894039735099338, '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}}
Efficient backup routing scheme in AODV with unidirectional links

Ad hoc on Demand Distance Vector Routing Protocol (AODV) is an on-demand routing protocol for mobile ad hoc network with low power consumption as well as low-bandwidth overhead. The routing table in AODV, however, maintains only one route to the specified node. Therefore, the source node needs to re-initiate route discovery process whenever route failure occurs which leads to increase in routing overhead and end-to-end delay. This paper presents a mechanism based on Backup paths, to overcome the route failures and selective flooding mechanism to minimize the average end-to-end delay in AODV with unidirectional links. Proposed mechanism is implemented in NS-2 simulator, and, on an average 40% reduction in average end-to-end delay is achieved and routing load is reduced when compared to the work reported earlier.