It's a ppt on "Evaluation of different performance matrices of wireless sensor network using DSR routing protocol using Ns2 simulator

1. “Evaluation of different performance
matrices of wireless sensor network using
DSR Routing protocol using NS2
simulator"
Submitted to:
Mr.Sandeep Kr. Poonia
Asst.Proff. ( HOD CS)
Submitted By:
Shruti Gupta
Computer Science Department

2. Objective
 Proposed Work
 Wireless Sensor Network
 Application Of Sensor Network
 Wireless Sensor Network Architecture
 Routing Protocols in WSN
 Design Constraint for routing in WSN
 DSR
 Network Simulator
 Simulation Parameters
 Analysis & Results

3. Proposed work
The study of wireless sensor network is challenging in that
it requires a huge breadth of knowledge from an huge
variety of disciplines for evaluating performance of
different parameters like Packet Delivery Fraction,
Average Throughput , Average End-End Delay,
normalized routing load(NRL) and packet loss[%] in
small, and very large terrain areas.
In this ,we present a survey of protocols and algorithms
proposed thus far for sensor networks. Our aim is to
provide a better understanding of the current research
issues in this field.

4. Wireless sensor network
A sensor network is composed of a
large number of sensor nodes, which
are densely deployed either inside the
phenomenon or very close to it.

5. WSN have the following distinctive
characteristics
 Power consumption constrains for nodes using
batteries or energy harvesting
 They can be deployed on large scale.
 These networks are scalable; the only limitation is
the bandwidth of gateway node.
 Wireless sensor networks have the ability to deal
with node failures.
 Mobility of nodes is a unique feature of WSN.

6. A wireless sensor node in a network consists
of the following components:
 Microcontroller.
 Radio transceiver.
 Energy source (battery).

7. Applications of sensor networks
 temperature
 humidity
 vehicular movement
 lightning condition
 pressure
 soil makeup
 noise levels
 the presence or absence of certain kinds of
objects

8. More applications
 Mechanical stress levels on attached objects
 Military applications
 Environmental applications
 Health applications
 Home applications

9. WIRELESS SENSOR NODE
ARCHITECTURE

10. A basic sensor node typically comprises of five
main components and they are namely controller,
memory, sensors and actuators, communication
device and power supply.
 A controller is to process all the relevant data,
capable of executing arbitrary code. Memory is
used to store programs and intermediate data

11.  Sensors and actuators are the actual interface
to the physical world. These devices observe or
control physical parameters of the environment.
 The communication device sends and receives
information over a wireless channel.
 And power supply is necessary to provide
energy. In WSN, power consumption efficiency is
one of the most important design considerations.

12. ROUTING PROTOCOLS IN WSN
 Routing techniques are required for sending
data between sensor nodes and the base
stations for communication.
 Routing Protocols can be classified :
 Based on Mode of functioning and type of
target applications into Proactive, Reactive
and Hybrid.
 Based on Participation style of the nodes into
as Direct Communication, Flat and Clustering
Protocols .
 Depending on the Network Structure as
Hierarchical, Data Centric and Location based

13. Proactive, Reactive and Hybrid
 In a Proactive Protocol the nodes switch on
their sensors and transmitters, sense the
environment and transmit the data to a BS
through the predefined route.
 e.g. The Low Energy Adaptive Clustering hierarchy
protocol (LEACH).
 In Reactive Protocol if there are sudden
changes in the sensed attribute beyond some
pre-determined threshold value, the nodes
immediately react. This is used in time critical
applications
 e.g. The Threshold sensitive Energy Efficient sensor
Network(TEEN).

14.  Hybrid Protocols Incorporate both Proactive and
Reactive concepts.
 They first compute all routes and then improve
the routes at the time of routing.
 E.g. Adaptive Periodic TEEN(APTEEN)

15. Direct Communication, Flat and
Clustering Protocols
 In Direct Communication Protocols, any node
can send information to the BS directly.
 In large network, the energy of sensor nodes
drained quickly. Its scalability is very small.
 E.g. SPIN.
 In Flat Protocols, if any node needs to transmit
data, it first searches for a valid route to the BS
and then transmits the data.
 Nodes around the base station may drain their
energy quickly. Its scalability is average.
 E.g. Rumor Routing.

16.  In clustering protocol, the total area is divided
into numbers of clusters.
 Each and every cluster has a cluster head (CH)
and this cluster head directly communicates with
the BS.
 All nodes in a cluster send their data to their
corresponding Cluster Head.
 E.g. Threshold sensitive Energy Efficient sensor
Network(TEEN).

17. Data Centric, Hierarchical and
Location based
 Data centric protocols are query based and
they depend on the naming of the desired data,
thus it eliminates much redundant transmissions.
 The BS sends queries to a certain area for
information and then only required information is
sensed and transmit to the BS.
 E.g. SPIN was the first data centric protocol

18. Continue..
 Hierarchical routing is used to perform energy
efficient routing.
 Higher energy nodes process and send the
information and low energy nodes sense the area
of interest
 examples: LEACH, TEEN, APTEEN
 Location based routing protocols need some
location information of the sensor nodes.obtained
from GPS signals, received radio signal strength,
etc.
 E.g. GEAR.

19. DESIGN CONSTRAINTS FOR ROUTING IN
WIRELESS SENSOR NETWORKS
 Autonomy: The statement of a referred unit that
controls the radio and routing resources does not place
in wireless sensor networks as it could be an easy point
of attack.
 Scalability: Wireless sensor networks are composed of
hundred of nodes so routing protocols should work with
this amount of nodes.
 Resilience: Sensors may unpredictably stop operating
due to environmental reasons or to the battery utilization.
Routing protocols must manage through this eventuality
so when a current-in-use node fail, an option route
possibly will be discovered.
 Device Heterogeneity: The use of nodes with dissimilar
processors, transceivers, power units or else sensing
component can improve the characteristics of the system

20. DYNAMIC SOURCE ROUTING
(DSR)
Dynamic Source Routing (DSR) is an on demand reactive
routing protocol based on the concept of source routing . That
is, the sender knows the complete hop-by-hop route to the
destination for data packets to be transverse in the whole
network. These routes are stored in a route cache. The data
packets carry the source route in the packet header.
 The nodes can dynamically discover a source route across
multiple network hops to any destination in the network. This
makes the network completely self-organizing and self-
configuring without the need for a network infrastructure or
administration.

21.  The DSR protocol is composed of two main
mechanisms in the ad hoc network:
 Route Discovery
 Route Maintenance

22. Route Discovery is the mechanism by which a
node S wishing to send a packet to a destination
node D obtains a source route to D. Route
Discovery is used only when S attempts to send
a packet to D and does not already know a
route to D.
Route Discovery

23. Route Maintenance
Route maintenance is use to detect any link breaks.
It is due to the fact that some node in the route has moved out
of wireless transmission range of the previous node in the
route.
When a link on the source route is broken, a Route Error
(RERR) identifying this broken link is returned to the original
sender.
The original sender then removes this broken link from its
route cache. For subsequent packets to this same destination,
the sender may use an alternate route that it may already have
in its route cache.
It may re invoke route discovery to discover a new source
route to the destination.

24. NETWORK SIMULATION
 Network simulation shows behavior of network models
extracted from information provided by network entities
(packets, data links, and routers) by using some
calculations.
 The network simulator provides the following functions:
 Realistic model of wireless statement:
 Software compatibility
 Bridging connections between real and effective
devices
 Ns-2 uses two languages, C++ and OTcl .

25.  C++ is fast to run but slower to modify, it is proper for
complete protocol implementation.
 OTcl runs much slower but can be changed very
quickly (and interactively), it is perfect for simulation
arrangement.
 NS-2 uses TCL (Tool Command Language) to write a
front-end of the program. NS-2 simulator uses C++ as
back-end of the program.

26.  Basic use C++:
 If doing anything that requires processing each
packet of a flow.
 If have to change the behaviour of an existing
C++ class in ways that weren’t anticipated.
 Basic use OTcL:
 For configuration, setup, and “one-time” stuff.
 If you can do what you want by manipulating
existing C++ objects.

27. NS-2 Components
 NS-2 has four main components
 The main component is ns, the real simulator.
This provides the software backup for
programming system models.
 The second component is the network animator
or NAM. This is a simple animator with two-
dimensional (2D) graphics that help the user
visualize and monitor the simulation both.

28.  Pre-Processing and Post-Processing are also
important components of NS-2. Examples of Pre-
Processing are traffic and topology generators.
An example of Post-Processing is simple trace
analysis, i.e., xgraph, often developed using
scripting languages such like awk, Perl & Tcl.

29. SIMULATION PARAMETERS:
The ratio of the number of delivered data packet
to the destination. This illustrates the level of
delivered data to the destination.
∑ Number of packet receive / ∑ Number of
packet send
Packet delivery ratio/fraction-

30. End-to-end Delay
The term end-to-end delay refers to the time taken by a
packet to be transmitted across a network from source node
to destination node that includes all possible delays caused
during route discovery latency, retransmission delays at the
MAC, propagation and transfer times.
∑ ( arrive time – send time ) / ∑ Number of connections

31.  The total number of packets dropped
during the simulation.
 The lower value of the packet lost
means the better performance of the
protocol.
Packet lost = Number of packet send – Number of
packet received
Packet Loss

32. Normalized Routing Load (NRL)
Normalized Routing Overhead is defined as
the total number of routing packet
transmitted per data packet. It is calculated
by dividing the total number of routing
packets sent (includes forwarded routing
packets as well) by the total number of data
packets received.
∑ Number of packet receive / ∑ Number of packet send

33. Throughput
Throughput –
Throughput is the ratio of the total
amount of data that a receiver receives
from a sender to a time it takes for
receiver to get the last packet.
Transmission Time = File Size / Bandwidth (sec)
Throughput = File Size / Transmission Time (bps)

34. ANALYSIS AND RESULTS

35. Pause Time versus Packet Delivery Fraction
When Terrain Areas is 500mx500m, 1000m x
1000m, 1500m x 1500m
60
64
68
72
76
80
84
88
92
96
100
0 20 40 60 80 100
Packet
delivery
fraction
(%)
Pause time (secs)
Packet Delivery Fraction (PDF) DSR-2Km.x1Km.
DSR-2Km.x2Km.
DSR-1500*1500m

36. 35
40
45
50
55
60
65
70
75
80
85
90
95
100
0 20 40 60 80 100
Packet
delivery
fraction
(%)
Pause time (secs)
Histogram Packet Delivery Fraction (PDF)
DSR-2Km.x1Km.
DSR-2Km.x2Km.
DSR-1Km.x1Km.

37. Pause Time versus Average End -to- End Delay When
Terrain Areas is 500m x 500m, 1000m x 1000m, 1500m x
1500m
5
45
85
125
165
205
245
285
0 20 40 60 80 100
Average
delay
(secs)
Pause time (secs)
Average End-End delay DSR-2Km.x1Km.
DSR-2Km.x2Km.

38. 20
190
360
530
700
870
1040
1210
1380
1550
1720
1890
2060
2230
2400
2570
0 20 40 60 80 100
Average
delay
(secs)
Pause time (secs)
Histogram Average End-End delay
DSR-2Km.x1Km.
DSR-2Km.x2Km.
DSR-1Km.x1Km.

39. Pause time versus Packet Loss% when
terrain areas is 500mx500m, 1000m x 1000m,
1500m x 1500m
0.02
3.02
6.02
9.02
12.02
15.02
18.02
21.02
24.02
0 20 40 60 80 100
Packet
Loss
[%]
Pause time (secs)
Packet Loss [%] DSR-2Km.x1Km.
DSR-2Km.x2Km.

40. 0.04
5.04
10.04
15.04
20.04
25.04
30.04
35.04
40.04
45.04
50.04
55.04
60.04
0 20 40 60 80 100
Packet
Loss
[%]
Pause time (secs)
Histogram Packet Loss [%]
DSR-2Km.x1Km.
DSR-2Km.x2Km.
DSR-1Km.x1Km.

41. Pause Time versus Normalized Routing Load When a
Terrain Area is 500m x 500m, 1000m x 1000m, 1500m x
1500m
0.15
0.65
1.15
1.65
2.15
2.65
3.15
3.65
4.15
4.65
0 20 40 60 80 100
NRL
Pause time (secs)
NRL DSR-2Km.x1Km.
DSR-2Km.x2Km.

42. 0.25
0.75
1.25
1.75
2.25
2.75
3.25
3.75
4.25
4.75
5.25
5.75
6.25
6.75
7.25
7.75
8.25
8.75
9.25
0 20 40 60 80 100
NRL
Pause time (secs)
Histogram NRL DSR-2Km.x1Km.
DSR-2Km.x2Km.
DSR-1Km.x1Km.

43. Pause time versus Average Throughput (kbps), when
Terrain Areas is 500mx500m, 1000m x 1000m, 1500m
x 1500m
50
54
58
62
66
70
74
78
82
86
90
94
98
0 20 40 60 80 100
Average
Throughput
[kbps]
Pause time (secs)
Average Throughput [kbps] DSR-2Km.x1Km.
DSR-2Km.x2Km.

44. 35
40
45
50
55
60
65
70
75
80
85
90
95
0 20 40 60 80 100
Average
Throughput
[kbps]
Pause time (secs)
Histogram Average Throughput [kbps]
DSR-2Km.x1Km.
DSR-2Km.x2Km.
DSR-1Km.x1Km.

45. Conclusion
Our study in this thesis is the evaluation of the DSR
routing protocols for their responses to network
scalability with respect to their five parameters as
their performance metrics in cases of critical
conditions monitoring applications, such as military,
leakage of toxic gases and liquids in industrial plants
etc. Our study provides an optimal result which is
fully based on model and analysis. Each case
explains evaluation of limitation with the help of
generated diagram.

46. Future Work
One of the challenging works is to make a new
sensor network simulator which supports the
simulation in the high level application.
This new simulator should also be possible to
apply for other applications in easy ways of
implementations. OMNeT++ (Objective Modular
Network Test-bed in C++) is a wireless sensor
network simulator which is based on the discrete
event simulation framework.

47.  As the OMNeT++ model collects hierarchy modules, it is
possible to capture the complex system.
 These modules are separated into two types
which are simple and compound. Simple modules
are programmed in C++, while compound
modules which consist of simple modules are
programmed in a high-level language (NED).

48. References
 Shah, Samyak, et al. "Performance evaluation of ad hoc
routing protocols using NS2 simulation." Mobile and
Pervasive Computing (CoMPC–2008) (2008): 167-171.
 Prof. Mohit Dua, Prof. Virender Ranga, Pawan Kardam and
Snehal Mohan,” Performance Evaluation of AODV, DSR,
DSDV mobile ad-hoc protocol of different scenarios”,
department of computer engineering, national institute of
technology, kurukshetra, feb 2012, ISSN 2277-9140.
 Satya Ranjan Rath,” STUDY OF PERFORMANCE OF
ROUTING ROTOCOLS FOR MOBILE ADHOC
NETWORKING IN NS-2” National Institute Of Technology
Rourkela 2009.

49.  D. Johnson, D. Maltz, Y. Hu, “The Dynamic Source
Routing Protocol for Mobile Ad Hoc Networks (DSR)”,
IETF Internet-Draft, July 2004
 J.Yick, B.Mukherjee and D. Ghosal, “Wireless sensor
network survey,” Department of Computer Science,
University of California, Davis, U.S.A, April, 2008.
 http://ntrg.cs.tcd.ie/undergrad/4ba2.05/group11/routing.jpg.