ABSTRACT
This paper conducts a comprehensive comparative analysis of three prominent routing algorithms, Ad Hoc On-Demand Distance Vector (AODV), Destination-Sequenced Distance Vector (DSDV), and Dynamic Source Routing (DSR), within the NS2 (Network Simulator 2) framework. The study aims to provide insights into the performance characteristics and suitability of these routing protocols for ad hoc and wireless network scenarios.
The research evaluates the algorithms across diverse metrics including packet delivery ratio, end-to-end delay, throughput, and energy consumption. By employing varying network topologies, mobility patterns, and traffic loads, the comparative analysis explores the strengths and weaknesses of AODV, DSDV, and DSR under different conditions, offering a nuanced understanding of their behavior.
The paper discusses the simulation setup in NS2, detailing the chosen parameters and configurations to ensure a realistic emulation of ad hoc network scenarios. Results from the simulations are analyzed to draw meaningful conclusions about the protocols’ efficiency, scalability, and adaptability in dynamic wireless environments.
