Performance Evaluation of DSDV Protocol Using Random Waypoint Mobility Model

Abstract — Mobile ad hoc network is a kind of dynamic network. In this network the mobile nodes dynamically form a temporary network without any centralized administration or the use of any existing network infrastructure. A number of routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance-Vector (DSDV) have been proposed. Destination-Sequenced Distance-Vector Routing (DSDV) is an adaptation of a conventional routing protocol to ad hoc networks. DSDV is based on the Routing Information Protocol, used in some parts of the Internet. DSDV makes use of bidirectional links. In DSDV, packets are routed between nodes using routing tables stored with each node. The routing table, at a particular node, contains a list of the addresses of every other node in the network. In this paper DSDV was studied and its characteristics with respect to the Random Waypoint Mobility Model are analysed based on the packet delivery fraction, routing load, end-to-end delay, PDF, number of packets dropped, throughput and jitter using Network Simulator (NS2) that is employed to run wired and wireless ad hoc simulations. Analyses of the trace files are done in Tracegraph with Matlab