Professional Documents
Culture Documents
D/A
A/D
Microcontroller
External Memory
Radio Transceiver
Mote
Sensor
Sensor
WSN Applications
Environmental/Habitat monitoring
Acoustic detection
Seismic Detection
Military surveillance
Inventory tracking
Medical monitoring
Smart spaces
Process Monitoring
WSN vs Ad-Hoc
Wire Sensor Network
Ad-Hoc Networks
No data fusion
Classification of Sensor
Network Protocols
Layered Architecture
MAC Protocol
During data transmission phase Distributed TDMA Receiver
Oriented Channel assignment (DTROC) MAC protocol is
used.
Two steps of DTROC are:
Channel Allocation (assignment of channels)
Channel Scheduling (sharing of the channel by
neighbors)
BS assigns a reception channel for each node with channel
reuse.
Nodes schedule transmission slots for all the neighbors and
broadcast the schedule.
It enables collision free transmission and saves energy
Nodes can turn off when they are not in send/receive
operation.
Routing Protocol
Downlink from BS is by direct broadcast on the
control channel.
With the layered architecture nodes forward the data
to BS through multiple hops.
The node to which a packet is to be forwarded is
selected as per the remaining energy
Clustered Architecture
The Sensor nodes are organized into clusters each
governed by a cluster-head
Each node provide information to their cluster-head
and these heads send messages to the BS (BS
connected to a wired network)
Cluster architecture is useful for the sensor networks
because of its inherent suitability for data fusion.
The data gathering by all the members of the cluster
can be fused at cluster-head, and only the resulting
information needs to be communicated to the BS
LEACH (Low-Energy
Adaptive Clustering
Hierarchy) Protocol
Data Dissemination
The process by which queries or data are routed in the sensor
network i.e, to the BS or to the other nodes.
Source: A node that generates data.
Event: The information to be reported.
Sink: A node which is interested in an event and seeks
information.
Data dissemination is done by Dissemination Models which
may be periodic or on-demand.
Data Diffusion: Consists of Interest Propagation and Data
Propagation.
Interest Propagation: particular kind of data or event that a
node is interested such as temp, intrusion or presence of Bio
agents.
Data propagation: Shortest path and strongest path is selected.
Flooding
Each node which receives a packet broadcasts it if the
maximum hop count of the packet is not reached or the node
itself is not the destination.
Disadvantages of Flooding:
Implosion (duplicate messages are sent to same
node)
Overlap (same event sensed by more node due
to overlapping of coverage regions)
Resource blindness (Flooding protocol doesnt
consider the available energy at the nodes and
result in many redundant transmission)
Gossiping
Modified version of Flooding.
Nodes dont broadcast a packet but send it to a randomly
selected neighbor.
It avoids the problem of Implosion.
Problem is that it takes a longer time for a message to
propagate throughout the network
Doesnt guarantee all nodes of the network will receive the
message.
Rumor Routing
Rumor Routing
Sequential Assignment
Routing
DATA GATHERING
Direct Transmission
Binary Scheme
Thank you..