mw 2522122216

7/31/2019 Mw 2522122216

http://slidepdf.com/reader/full/mw-2522122216 1/5

Harpreet Singh, Gurpreet Singh Josan / International Journal of Engineering Research andApplications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 5, September- October 2012, pp.2212-2216

2212 | P a g e

Performance Analysis of AODV & DSR Routing Protocols inWireless Sensor Networks

Harpreet Singh*, Gurpreet Singh Josan**

*(Department of Computer Science, Punjabi University, Patiala)** (Asst.Prof. Department of Computer Science, Punjabi University, Patiala)

ABSTRACTAs deployment of sensor networks are

increasing either manually or randomly tomonitor physical environments in differentapplications such as military, agriculture,medical transport, industry etc. In monitoring of physical environments, the most importantapplication of wireless sensor network ismonitoring of critical conditions. The most

important in monitoring application like criticalcondition is the sensing of information duringemergency state from the physical environmentwhere the network of sensors is deployed. A bigchallenge to sensor networks is a fast, reliableand fault tolerant channel during emergencyconditions to sink (base station) that receives theevents. Our focus is to discuss and evaluate theperformance of two different routing protocolslike Ad hoc On Demand Distance Vector (AODV)[1] and Dynamic Source Routing (DSR) formonitoring of critical conditions with the help of important metrics like network load and media

access delay in different scenarios for both stableand mobile nodes. On the basis of results derivedfrom simulation a conclusion is drawn on thecomparison between these two different routingprotocols with parameters like media access delayand network load .

Keywords - Ad hoc On Demand Distance Vector(AODV), Dynamic Source Routing (DSR), Mediaaccess delay, Network load, OPNET.

1. INTRODUCTION The advancements in wireless

communication technologies enabled large scalewireless sensor networks (WSNs) [2] deployment. AWireless Sensor Networks consists of spatiallydistributed sensor to monitor physical orenvironmental conditions. As from the name ratherthan gathering sensed data through wired data busesWSN employs a wireless backhaul to transmitsensor reading to central location for aggregationand further processing.

Wireless Sensor Networks can be generallydescribed as a network of nodes that cooperativelysense and may control the environment enablinginteraction between persons or computers and thesurrounding environment. The design of energyefficient communication protocols is a very peculiar

issue without significant precedent in wirelessnetwork history .The nodes can be mobile orimmobile, location-aware or location-unaware andhomogenous or heterogeneous. Sensor nodes arelimited in energy supply and bandwidth. Theseconstraints combined with scalability determine thedesign and management of sensor networks. Theissues related to physical and link layers are unique

for all kind of sensor applications, therefore theresearch on these areas has been focused on system-level power awareness such as dynamic voltagescaling, radio communication hardware, low dutycycle issues, system partitioning, energy awareMAC protocols.

One of the necessary requirements of awireless sensor network is to deliver data reliablyagainst the dynamic and lossy nature of wirelesstransmissions. In wireless sensor networks theenergy dissipation in transmission of data directlydepends on the routing algorithm. Hence, resourceconstraint Sensor Networks requires an optimum

algorithm for routing.

2. ROUTING PROTOCOL A routing protocol is a protocol that

specifies how routers communicate with each other,disseminating information that enables them toselect routes between any two nodes on a computernetwork, the choice of the route being done byrouting algorithms. Each router has a prioriknowledge only of networks attached to it directly.A routing protocol shares this information firstamong immediate neighbours, and then throughoutthe network. This way, routers gain knowledge of

the topology of the network. The term routingprotocol may refer specifically to one operating atlayer three of the OSI model, which Similarlydisseminates topology information between routers.As we are comparing AODV and DSR routingprotocols for mobile and stable nodes in wirelesssensor networks are discussed below:

AODV (Ad hoc On-demand Distance Vector):AODV is a reactive routing protocol and a

route from one node to another node can be foundwhen required. Each intermediate node in thenetwork forwards the Route Request (RREQ)

message until it reaches the destination node. The

http://en.wikipedia.org/wiki/Protocol_%28computing%29

http://en.wikipedia.org/wiki/Router_%28computing%29

http://en.wikipedia.org/wiki/Node_%28networking%29

http://en.wikipedia.org/wiki/Computer_network


http://en.wikipedia.org/wiki/Routing

http://en.wikipedia.org/wiki/OSI_model

http://en.wikipedia.org/wiki/OSI_model

http://en.wikipedia.org/wiki/Routing




http://en.wikipedia.org/wiki/Node_%28networking%29

http://en.wikipedia.org/wiki/Router_%28computing%29

http://en.wikipedia.org/wiki/Protocol_%28computing%29

7/31/2019 Mw 2522122216



2213 | P a g e

destination node responds to the RREQ message bytransmitting the Route Reply (RREP) message.

As the RREP flows through the network, itdetermines the route from source node to destinationnode. The sequence number is increased by eachoriginating node and used to determine whether the

received message is the most recent one. The olderrouting table entries are replaced by the newer ones.Active nodes in the networks are determined by

broadcasting a “Hello” message periodically in thenetwork. If a node fails to reply a link break isdetected and a Route Error (RERR) message istransmitted which is used to invalidate the route as itflows through the network. A node also generates aRERR message if it gets message destined to a nodefor which a route is unavailable.Types of messages in AODV:1. Route Request (RREQ) message: It is used toform a route from one node to another node in anetwork.2. Route Reply (RREP) message: It is used toconnect destination node to source node in anetwork.3. Route Error (RERR) message: It is used toindicate any route broken or node failure.4. HELLO message: It is used to determine theactiveness of the network.The transmission of data depends on route discoveryand route maintenance in AODV. The routediscovery depends on RREQ and RREP messages, if a node initiate’s request of route it will form routeafter getting the RREP. The route will be maintainedby sending HELLO messages to neighbour nodes, if any link failure it will indicate using RERR message

(TEEN) Threshold - sensitive Energy Efficientsensor Network protocol:

TEEN is a reactive protocol proposed fortime-critical applications. BASE STATIONbroadcasts the attribute, Hard Threshold (HT) andSoft Threshold (ST) values to its cluster members.The sensor nodes starts sensing and transmits thesensed data when it exceeds HT. HT is the minimumattribute range above which the values are expected.The transmitted sense value is stored in an internalvariable called Sensed Value. The cluster nodesagain starts sensing, when its value exceeds the ST.The minimum change in the sensed value it switcheson its transmitter and transmits. The energy isconserved since the sensor nodes in the clustersenses continuously but transmits only when thesensed value is above HT. The ST further reducesthe transmission which could have been occurredwhen there is a little change or no change in sensedattribute. As the cluster heads (CH) need to performextra computations it consumes more energycompared to other nodes. The main drawback of thisprotocol is that the transmission from nodes to CHwill not be there when the sensed value is not greaterthan HT, hence the CH will never come to know

even when any one of the sensor node dies. Accurateand clear picture of the network can be obtained byfixing the ST as smaller value even though itconsumes more energy due to frequent transmissions[3].

3. SIMULATION AND ENVIRONMENTIn simulation the different types of

scenarios are consider based upon mobile and fixednodes on OPNET simulator. OPNET(OptimizedNetwork Engineering Tool) Modeler. 14.5 is usedfor the design and implementation of this work.

3.1 OPNETOPNET is a network simulator that

provides virtual network communicationenvironment. It is appropriate for the researchstudies, network modeling and engineering, R & DOperation and performance analysis. OPNETModular 14.5 [4] is chosen because it is one of theleading environments for network modeling andsimulation. It offers easy graphical interface,possibility to develop and run this simulationenvironment, validity of the simulation results. Thistool is highly reliable, robust and efficient [8]. Itsupports large number of built-in industry standardnetwork protocols, devices, and applications.

3.1.1 OPNET Features It provides virtual real time environment for

networks with GUI. Useful in evaluation of designs for new

network models and architectures. Good for performance study of existing

systems based on users conditions. Easy for understanding the network

behaviour in various scenarios.

3.2 Simulation StepsSimulation with OPNET is generally

divided into four parts, network model design,applying statistics, run simulation and then toview results and to analyze the results, if theresults are not correct then it has to be re-modeled

and then to apply new statistics. The basic work flow of OPNET [5] can be seen in the flowchartshown in figure 1.

7/31/2019 Mw 2522122216



2214 | P a g e

Fig 1: Simulation Steps

3.3 Simulation Environment & ParametersIn this research work the simulation tool

OPNET Modeler 14.5 is used, which is verycommon in practice now a days. This simulationstudy focuses on the performance of routingprotocols with fixed and mobile nodes. Therefore,eight simulation scenarios consisting of 20 nodeseach (mobile and fixed) are considered for tworouting protocols AODV & DSR. The area chosenfor this setup is 100*100 meters. FTP (File TransferProtocol) traffic is generated using the Applicationand Profile Configuration. The simulationparameters used in this study are as below:

Table 1: Simulation Parameters Attribute ValueMaximum Simulation

Time600 sec

Interface Type Wireless(ad-hoc)Network Area 100*100 metersMobility Model Random Way PointData Rate(bps) 11MbpsTransmit Power(W) 0.030Buffer Size(bits) 256000No. of Nodes 20Protocols AODV, DSRTraffic Generation

ApplicationFTP

Fig 2: An example of network model design of 20nodes

1.Media Access Delay

Fig 3: Media access Delay in AODV& DSR forfixed nodes (20 nodes)

Apply

Configuration

and statistics

Run

Simulation

Collecting

Results

Network Model

Design

7/31/2019 Mw 2522122216



2215 | P a g e

Fig 4: Media access Delay in AODV& DSR formobile nodes (20 nodes)

As it is clear from the figure 3 that mediaaccess delay of AODV protocol is more than DSR incase of fixed nodes but only in the beginning, but asthe time increases delay of DSR goes increases thanAODV. In figure 4 media access delay of DSR ismore than AODV while the nodes are mobile. SoAODV protocol performs better than DSR for highernumber of nodes in both fixed and mobile nodesbecause delay is less except the initial state of AODV in case of fixed nodes [5].

The Media Access Delay encountered bythe two routing protocols during the simulationperiod for all scenarios. It is clear from figures thatDSR incurs the highest delay, especially on largesize of nodes. DSR exhibits large packet delaybecause its routes discovery takes more time. Everyintermediate node tries to extract and recordinformation before forwarding a reply. AODV givesthe lower Media Access Delay as compared to DSR.

2. Network LoadFigures 5and 6 shows the Network load inboth the protocols for stable and mobile nodes. Asshown in the figure 5 that Network load of AODV ismore in case of fixed nodes as compare to the DSRprotocol [6]. It depends upon the number of nodes,more the number of nodes more will be network load in both the cases stable and mobile in DSRprotocol. While in the figure 6 Network load of DSRis more in mobile nodes

Fig 5: Network Load in AODV& DSR for fixednodes(20 nodes)

Fig 6: Network Load in AODV& DSR for mobilenodes(20 nodes).

So according to the simulation the

performance analysis of DSR is better in aspect of Network load for mobile and stable nodes in lowernumber of nodes. In aspect of Media

7/31/2019 Mw 2522122216



2216 | P a g e

access delay the performance of AODV is better formobile nodes while for fixed nodes performance of DSR is better in the initial time but as the timeincreases performance of DSR goes down andAODV perform better.

4. CONCLUSION In this work the evaluation of the two

routing protocols for their responses to network scalability with respect to their network load andmedia access delay as their performance metrics.DSR and AODV implemented in different scenariosof executing stable nodes and mobile nodesnetworks. In each scenario all the nodes were usedas source nodes of sending data to a common basestation. So according to the simulation theperformance analysis of DSR is better in aspect of Network load for mobile and stable nodes in lowernumber of nodes case. In aspect of Media accessdelay the performance of AODV is better for mobilenodes while for fixed nodes performance of DSR isbetter in the initial time but as the time increasesperformance of DSR goes down and AODV performbetter. On selected protocols, from the conductedstudy we conclude that in overall performance oneprotocol is superior to other protocol. One protocolmay be far better in performance than other protocolin terms of media access delay and network load.The size of the networks also matters for theperformance of the protocol.

R EFERENCES [1] Peng Liu, Y.Fun Hu, Geyong Min and

Guojun Dai,“Semantization improves theEnergy Efficiency of Wireless Sensor

Networks”, 2010,IEEE[2] Jun Zheng, Abbas Jamalipour,

“Classification of WSNs RoutingProtocol”, a chapter from Wireless sensor networks: a networking perspective, JohnWiley & Sons, 2009.

[3] Hean Kuan Ong, Hean Loong Ong, Elok Robert Tee and R. Sureswaran, “Scala bilitystudy of ad-hoc wireless mobile network routing protocol in sparse and densenetworks” Distributed Frameworks for Multimedia Applications, 2006. The 2ndInternational Conference, Pulau Pinang,May 2006, IEEE.

[4] Suyang Ju and Joseph B. Evans, “Sca lableCognitive Routing Protocol for Mobile Ad-Hoc Networks”, IEEE GlobalTelecommunications Conference, USA, 6-10 Dec. 2010, IEEE.

[5] Prashant Singh, D.K. Lobiyal, “Scalabilityof Routing in MANET”, 2010 SecondInternational Conference onCommunication Software and Networks,Singapore, Feb 2010, IEEE.

[6] Asha Ambhaikar H.R. SharmaV.K.Mohabey, “Scalability Performance of MANET Routing protocols with Referenceto Variable Pause Time”, InternationalJournal on Computer Science andEngineering, Vol. 02, No. 09, PP. 3021-

3024,2010.[7] Arati Manjeshwar and Dharma P.Agarwal:

“A Routing Protocol for EnhancedEfficiency in Wireless Sensor Networks”,International Parallel and DistributedProcessing Symposium (IPDPS), 2001,IEEE.

[8] Introduction to OPNET Modeler, 2007OPNET Technologies.

[9] Wikipedia, “ Introduction of Sensors”. [10] Yogesh Chaba, Yudhvir Singh and Aarti,

“Performance analysis of Scalability andMobility On Routing Protocols inMANET”, International Journal of Information Technology and KnowledgeManagement, Vol. 1,No. 2, PP. 327-336,Jul-Dec,2008.

[11] OPNET University Program:http://www.opnet.com/services/university/

[12] Introduction to OPNET Modeler, 2007OPNET Technologies.

[13] IETF Working Group MANET:http://www.ietf.org/html charters/manet-chart er.html.

[14] Routing Protocol Performance Issues andEvaluationConsiderations:http://www.ietf.org/rfc/rfc2501.txt.

[15] Ad hoc On-Demand Distance Vector(AODV) Routing: http://tools.ietf.org/html/rfc3561

http://www.opnet.com/services/university/

http://www.opnet.com/services/university/

mw 2522122216

Documents