{'fraction_non_alphanumeric': 0.017361111111111112, 'fraction_numerical': 0.0, 'mean_word_length': 5.588571428571429, '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}}
Performance Analysis of Dynamic Probabilistic Flooding in On-Demand Routing Protocols for MANETs

Ad hoc network protocols use flooding as the basic mechanism to disseminate control packets. As such, the simple flooding algorithm aggravates a high number of superfluous packet rebroadcasts, causing contention, packet collisions and ultimately wasting valuable limited bandwidth. The efficiency of broadcasting protocol can dramatically affect the performance of the entire network. In a large network, with heavy load, this extra overhead can have severe impact on performance and should be eliminated. In this paper, we proposed a dynamic probabilistic approach when nodes move according to way point mobility and evaluate it against simple flooding and fixed probabilistic scheme. We assess the performance of our approach by comparing it with the ad hoc on-demand distance vector (AODV) protocol (which is based on simple flooding) as well as a fixed probabilistic approach. Moreover, the results indicate that the dynamic probabilistic technique demonstrates better performance as compared to the simple flooding and fixed probabilistic technique.