Abstract—An Ad-hoc network consists of wireless nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. An Ad-hoc network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of Ad hoc routing protocols have been proposed and implemented, which include Destination-Sequenced Distance-Vector (DSDV), Ad-hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). In this paper, we examine two on demand routing protocols DSR and AODV to analyze the performance differentials by varying network load, mobility and network size with the help of ns-2 simulator. Simulation results show that the DSR perfectly behaves with smaller networks with lower speed of nodes and AODV reveals more efficient use of bandwidth. The focus of our paper is on those approaches that are relevant to our work.
Index Terms—AODV, DSR, MANET, NS-2.
Shakeel Ahmed is with Computer Science Department, College of Computer Science and Information Technology, King Faisal University, AlHasa, Saudi Arabia (e-mail: shakeel@kfu.edu.sa).
[PDF]
Cite:Shakeel Ahmed, "Performance Analysis of DSR and AODV Routing Protocols," International Journal of Computer Theory and Engineering vol. 5, no. 3, pp. 582-584, 2013.
