Performance Analysis of AODV, DSDV and ZRP Routing Protocols for Wireless Sensor Networks using NS2 Tool

Abstract

This paper presents a literature review on WSN networks, in which the capacity of network nodes is limited with respect to energy supply, restricted computational capacity and communication bandwidth. WSN is a complex set of applications, link technologies, communication protocols, traffic flows and routing algorithms. Simulation is a predominant technique used to study and analyze the performance of a wireless senor network design. To prolong the lifetime of these sensor nodes, designing efficient routing protocols are critical. Basically, the Routing protocols for wireless sensor networks are responsible for maintaining the routes in the network which ensures reliable multi-hop communication. To address this issue, in this paper, various protocols like AODV (Ad-hoc on-demand distance vector routing), DSDV (Destination-Sequenced Distance-Vector Routing) and ZRP (Zone Routing Protocol) are discussed along with various comparative parameters like Throughput, Packet Loss Ratio, End to End Delay and Dropped Packets. The performance of these protocols varies depending on the simulation environment. It will be analyzed in two ways. Firstly, by varying nodes within a margin of 10 to 100 nodes. Another way is by keeping the number of nodes constant and varying the speed of nodes from 10 m/s to 90 m/s.

Untitled

“…The areas in which these protocols differ are the way the routing information is updated, detected and the type of information kept at each routing table [37]. Proactive protocols update route information periodically, while reactive ones establish routes only when needed [35].…”

“…Whenever the topology of the network changes, a new sequence number is necessary before the network re-converges; thus, DSDV is not scalable in Ad hoc networks, which have limited bandwidth and whose topologies are highly dynamic [34]. Routes availability to all destinations implies that much less delay is involved in route setup process [35].…”

“…It is derived in ms (mille second). Smaller values of End-to-end delay carries improved performance [35]. The End-to-end delay is described as:…”

Untitled

“…Whenever the topology of the network changes, a new sequence number is necessary before the network re-converges; thus, DSDV is not scalable in Ad hoc networks, which have limited bandwidth and whose topologies are highly dynamic [34]. Routes availability to all destinations implies that much less delay is involved in route setup process [35]. Figure 2 shows the routing table of DSDV.…”

“…A wireless sensor network architecture is illustrated in figure 1. An Ad-Hoc routing protocol must be able to decide the best path between the nodes, minimize the bandwidth overhead to enable proper routing, minimize the time required to converge after the topology changes [26,35]. Further, it is worth mentioning that node density, speed of nodes and pause time will have significant effect in the performance of the any routing policy due to the fact that an increase in node density will tend to increase the hop count thus changing the topology significantly.…”