Scribd
Upload
61 views26 pages

Wireless Sensor Networks: by Ravi Kumar Dasari EECE 505 Term Project

This document discusses wireless sensor networks and routing algorithms used within them. It describes sensor networks as consisting of large numbers of sensor devices spread over a wide area and linked wirelessly to perform distributed sensing tasks. Some key applications mentioned include military monitoring, environmental scanning, and tracking vehicle movement. The document then covers topics such as sensor node types, challenges in wireless sensor networks like energy constraints, and various routing protocols used, focusing on SPIN routing which uses data advertisements to reduce redundant transmissions. It concludes by discussing simulation tools for modeling wireless sensor networks and the energy efficiency of the SPIN protocol.

Uploaded by

mountainwater
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
61 views26 pages

Wireless Sensor Networks: by Ravi Kumar Dasari EECE 505 Term Project

This document discusses wireless sensor networks and routing algorithms used within them. It describes sensor networks as consisting of large numbers of sensor devices spread over a wide area and linked wirelessly to perform distributed sensing tasks. Some key applications mentioned include military monitoring, environmental scanning, and tracking vehicle movement. The document then covers topics such as sensor node types, challenges in wireless sensor networks like energy constraints, and various routing protocols used, focusing on SPIN routing which uses data advertisements to reduce redundant transmissions. It concludes by discussing simulation tools for modeling wireless sensor networks and the energy efficiency of the SPIN protocol.

Uploaded by

mountainwater
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

Wireless Sensor Networks

By
Ravi Kumar Dasari
EECE 505
Term Project
Contents
 Introduction
 Applications of WSN
 Sensor Nodes and Network
 Various Routing Algorithms in WSN
 SPIN Routing
 Simulation using SNetSim
 Conclusions
Various wireless Networks
What are WSN?
 Large number of heterogeneous Sensor devices
spread over a large field.
 Wireless sensing + Data Networking. Group of
sensors linked by wireless media to perform
distributed sensing tasks
Applications of WSN

 Military,
Environmental, Health
(Scanning), Space,
Exploration,
Vehicular Movement,
Mechanical stress
levels on attached
objects etc.
Sensor Network and Nodes
 Network Channels: User nodes or gateways
and onward transmission to other network.
 Sensor channels: Communicates among sensor
nodes and targets.
 Sensor Network has three types of Nodes
* Sensor nodes: Monitor immediate environment
* Target Nodes: Generates various stimuli for
sensor nodes.
* User Nodes: Client and Administration of Sensor
Networks.
Sensor Node

• Sense Phenomena
• Process Data
• Communicate Data
Challenges in WSN’s
 Energy
 Computation
 Communication
 Scalability
 Fault Tolerance
 Power Consumption
Routing in WSN
They can be divided into two main
categories
 Address Centric: Finding shortest path
between pairs of addressable end-nodes.
 Data Centric : Finding routes from multiple
sources to a single sink, allowing data
aggregation.
Address Centric

Source 2

Source 1
C

A B

Sink
Data Centric

Source 2

Source 1
C

A B – aggregates
data from 1 & 2
Various Routing Protocols
 Classic Flooding
 Gossiping
 Ideal Dissemination
 SPIN
Classing Flooding
• Send data to all neighbors.

A
C
B

D E

F
G
Classic Flooding Problems
A

B C

• Implosion Problem: A starts by flooding its data to all of its


neighbors. Two copies of the data eventually end at node D.
The system wastes energy and bandwidth.
• Overlap Problem: Two sensors cover an overlapping
graphic region. When the sensors flood their data to node,
the Node receives two copies of the Data.
• Resource Blinding: Resources do not modify their
activities based on the amount of energy they have.
Gossiping
A

C
D

• Gossiping is an alternative to the classic flooding approach


that uses randomization to conserve energy.
• At every step each node only forwards data on to one
neighbor, which it selects randomly. After node D receives
the data, it must forward the data back to sender (B),
otherwise the data would never reach node C
Ideal Dissemination
a A c

a,c

B C

a c
D

• Ideal Dissemination of observed data a and c. Each node in


the figure is marked with its initial data and boxed number
represent the order in which data is disseminated. In Ideal
dissemination both implosion caused by B and C’s common
neighbor and overlap caused by A and C’s overlapping
initial data item do not occur.
SPIN: Sensor Protocols for Information
Negotiation
• One of the most dominant form of routing in the wireless
sensor networks.
• Name data, using meta-data
 Meta Data for each sensor data
 Same senor data -> same meta-data
 Different sensor data -> different meta-data
• Size of meta-data << Size of actual data
• Uses three types of messages:
• ADV – advertise data
• REQ – request for data
• DATA – data message, contains actual sensor data
SPIN1 and SPIN2
SPIN1 : Three way handshaking protocol. ADV, REQ,
DATA.
 Each sensor node has resource manager
• Keeps track of resource consumption
• Applications probe the manager before any activity
• Cut down activity to save energy
SPIN2 : energy constraint
 Adds energy-conservative heuristic to the SPIN1 protocol.
 Node initiates three stage protocol, only if it has enough
energy to complete it.
 If below energy threshold, node can still receive
messages, cannot send/recv DATA messages
• Node B sends a REQ listing all of the data it would like to acquire.
If node B had its own data, it could aggregate this
with the data of node A and advertise.
Nodes need not respond to every message
Simulators available for WSN
 JavaSim: Easy to use, very modular but no
wireless support.
 GlomoSim: Specific for wireless networks, layer
architecture, but too robust to be used for small
networks.
 NS-2: Supports wireless simulations, lots of
good documentation, But difficult to use, we
need to create separate modules for each
protocol.
 SNetSim: New simulation software, mainly for
event driven conditions, simple and easy to use,
can create our own protocols.
SNetSim
• SNetSim is a event-driven simulation software running
on Windows based operating systems. Developed at
Naval Science and Engineering Institute (Turkey)
Conclusions
• SPIN is simple to implement compared with
other protocols.
• SPIN seems to be the best protocol. It is better
than flooding because it overcomes data
implosion and overlap.
• More energy-efficient than flooding or gossiping
while distributing data at the same rate or faster
than either of these protocols.
• These is no redundant data sent through the
network.
Reference
• SNetSim Software from
http://www.dho.edu.tr/enstitunet/snetsim/index.htm

• Routing Issues from


http://www.rystal.uta.edu/~kumar/cse6392/termpapers/Kalyani_paper.pdf

• SPIN issues from


http://www.r2.cs.ucla.edu/seapahn/papers/sensor_nets.pdf
Question?

You might also like