{'fraction_non_alphanumeric': 0.027387120651369355, 'fraction_numerical': 0.007401924500370096, 'mean_word_length': 5.1454545454545455, '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 Comparison of Efficient DSDV with DSDV Rutuja

Volume 2, Issue 3 May – June 2013 Page 279 Abstract— The volume of research performed in the domain of Ad Hoc Networks has increased substantially in recent years. This is due to the advancement of fabrication technology of low-power devices containing various sensors along with a wireless interface, allowing costs to be reduced.. In ad hoc networks, routing protocols are expected to implement three main functions: determining and detecting network topology changes (e.g., breakdown of nodes and link failures); maintaining network connectivity and calculating and finding proper routes. In Adhoc networks, up-to-date, less effort has been given to routing protocols, even though it is clear that ad hoc routing protocols (such as temporallyordered routing algorithm (TORA), dynamic source routing (DSR), and ad hoc on-demand distance vector(AODV) are not suited well for Adhoc networks. This paper focuses on Eff-DSDV type of routing protocol which overcomes the problem and thereby improves the performance of regular DSDV. Then comparison of two routing protocols for different network parameters is done using the simulator NS2 and studied the efficient protocol under a particular scenario on the basis of metrics such as Packet delivery ratio, End to end delay and Routing Overhead.