{'fraction_non_alphanumeric': 0.026350461133069828, 'fraction_numerical': 0.0, 'mean_word_length': 4.984251968503937, '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}}
AODV route protocol research based on improved ERS algorithm

Global flooding and expanding ring search are two commonly used methods in searching for an interested object in multi-hop wireless networks. Global flooding is not scalable for large networks. To take advantage of expanding ring search, in this paper, we propose an improved algorithm named HP-ERS-AODV which executes an efficient route discovery scheme by predicting current location of destination using hop counts of history. We provide detailed performance evaluation using simulation modeling and compare HP-ERS-AODV with both ERS-AODV and Flood-AODV. Our findings show that HP-ERS-AODV outperforms both ERS-AODV and Flood-AODV by reducing end-to-end delay and by improving routing overhead.