{'fraction_non_alphanumeric': 0.010582010582010581, 'fraction_numerical': 0.0, 'mean_word_length': 5.47008547008547, '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}}
Contribution of Broadcast Algorithms to Reactive Ad Hoc Routing

Most reactive routing protocols hoc wireless networks rely on a broadcast algorithm known as flooding for route discovery. With flooding, many copies of each message are retransmitted unnecessarily resulting in a sub-optimal resource consumption. Given that mobile devices usually have limited power and computational resources, it is of the utmost importance to reduce the resource consumption of each route discovery. A number of alternatives to flooding have been presented but their impact on the performance of reactive routing protocols is not well understood. This paper compares and discusses the performance of a routing protocol for MANETs with three distinct broadcast algorithms.