This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
11
Message Oriented Message Oriented Middleware and Hierarchical Middleware and Hierarchical
Cluster head for the current round if the random Cluster head for the current round if the random number is less than the following thresholdnumber is less than the following threshold p is the desired percentage of cluster headsp is the desired percentage of cluster heads r is the current roundr is the current round G is the set of nodes that have not been cluster heads in G is the set of nodes that have not been cluster heads in
Cluster Heads at time t Cluster Heads at time t + d
2020
Drawbacks of LEACHDrawbacks of LEACH
Single-hop routing – each node Single-hop routing – each node transmits directly to the cluster-transmits directly to the cluster-head and cluster-head directly to head and cluster-head directly to the sinkthe sink
Dynamic clustering – extra Dynamic clustering – extra overheadoverhead
2121
Power-Efficient Gathering in Power-Efficient Gathering in Sensor Information System Sensor Information System
must transmitmust transmit Limits the no. of transmissions and Limits the no. of transmissions and
receptions among all nodesreceptions among all nodes Only one transmission to the BS per Only one transmission to the BS per
roundround
2222
Chaining in PEGASISChaining in PEGASIS
C0,C1,C3,C4 - Non-leader nodes
C2- Leader Node
Each node communicates only with the closest neighbor
Gathered data moves from node to node, get fused and sent to the BS by the designated leader node
Nodes take turns being the leader ( I mod N)
Chaining is done using the greedy approach
When a node dies chaining is done again
2323
Hierarchical PEGASIS with Hierarchical PEGASIS with CDMACDMA
Constructs a chain of nodes, that Constructs a chain of nodes, that forms a tree like hierarchyforms a tree like hierarchy
Data transmitting in parallel Data transmitting in parallel Tree is balanced, the delay will be in Tree is balanced, the delay will be in
O (log N)O (log N)
2424
Nodes at even positions transmit data to their right
Nodes receiving at each level rise to next level in hierarchy
2525
Comparison of PEGASIS with Comparison of PEGASIS with LEACHLEACH
PEGASIS has been shown to PEGASIS has been shown to outperform LEACH by about 100 to outperform LEACH by about 100 to 300% for different network sizes and 300% for different network sizes and topologiestopologies
2626
Threshold sensitive Energy Threshold sensitive Energy Efficient sensor Network Efficient sensor Network
protocolprotocol
2727
Threshold sensitive Energy Threshold sensitive Energy Efficient sensor Network Efficient sensor Network
protocolprotocol
Responsive to sudden changes in the Responsive to sudden changes in the sensed attributes such as temperaturesensed attributes such as temperature
Cluster head broadcasts to the nodesCluster head broadcasts to the nodes AttributesAttributes Hard threshold Hard threshold Soft threshold.Soft threshold.
TEEN is not good for applications TEEN is not good for applications where periodic reports are neededwhere periodic reports are needed
2828
Adaptive Threshold sensitive Adaptive Threshold sensitive Energy Efficient sensor Energy Efficient sensor
Network protocolNetwork protocol Captures both periodic data and Captures both periodic data and
reacts to time-critical eventsreacts to time-critical events Historical, to analyze past data valuesHistorical, to analyze past data values one-time, to take a snapshot view of one-time, to take a snapshot view of
the networkthe network Persistent, to monitor an event for a Persistent, to monitor an event for a
period of timeperiod of time
2929
Threshold sensitive Energy Threshold sensitive Energy Efficient sensor Network Efficient sensor Network
protocolprotocol
Time line for the operation of TEEN Time line for the operation of TEEN and APTEENand APTEEN
3030
Drawbacks of TEEN and Drawbacks of TEEN and APTEENAPTEEN
Overhead and complexity of forming Overhead and complexity of forming clusters in multiple levelsclusters in multiple levels