By :Prajwal PanchmahalkarNishant Reddy Kommidi                        1
   Introduction   Problems   Related Research    ◦   LEACH    ◦   POACH    ◦   SAFE    ◦   TTDD    ◦   SPIN   SPMS (Sh...
   Sensor Networks, a particular class of wireless ad-    hoc networks in which the nodes have sensors   Sensor nodes ga...
   Sensor nodes are battery powered and usually    run out of battery    ◦ Reducing energy consumption is an important   ...
   Low Energy Adaptive Clustering Hierarchy   Communicates directly with the respective cluster    head and cluster head...
   Power Aware Caching Heuristics   Determine the servers in the sensor network    at which the data should be cached. ...
   Motivated by two problems    ◦ Implosion – broadcast    ◦ Overlap – redundant data   Use high level descriptors – met...
   SPIN didn’t consider node failure in the    network.   Adjust of power level with respect to distance    to the neigh...
   Energy spent in wireless network is directory proportional to    dα   d – distance between source and destination   ...
   Consider the following multihop routing    between A to C                                        Zone of A            ...
   Knowing the route to destination   Dealing with failures of intermediate nodes                                  ?    ...
   Node neighbor zones are considers    ◦ A region that the node can reach by transmitting at      maximum power level. ...
    Motivated by SPIN1.    Meta-data exchange within zone neighbors2.    The node sends REQ packet to the source using th...
   If the destination node doesn’t receive ADV from the relay    node before the timer the timer expires it sends REQ to ...
adv          B          advA               C                    15
REQ          BA                              C              Waits Tadv to receive ADV from B                              ...
DATA           BA                               C               Waits Tadv to receive ADV from B                          ...
ADV    BA             C                  18
REQ    BA             C                  19
DATA    BA              C                   20
   At each stage, the destination node maintains    a Primary Originator Node (PRONE) and    Secondary Originator Node (S...
REQ    B                 CA                            D        Destination        Source                                22
B        REQA                      D        Destination        Source                          23
   SPMS is cost and energy effective compared    to SPSM   It reduces end-to-end data latency   SPMS shortest distance ...
Upcoming SlideShare
Loading in …5
×

Fault tolerant energy aware data dissemination protocol in WSN

698 views

Published on

Published in: Education, Technology, Business
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
698
On SlideShare
0
From Embeds
0
Number of Embeds
6
Actions
Shares
0
Downloads
8
Comments
0
Likes
1
Embeds 0
No embeds

No notes for slide

Fault tolerant energy aware data dissemination protocol in WSN

  1. 1. By :Prajwal PanchmahalkarNishant Reddy Kommidi 1
  2. 2.  Introduction Problems Related Research ◦ LEACH ◦ POACH ◦ SAFE ◦ TTDD ◦ SPIN SPMS (Shortest Path Minded SPIN) ◦ Design ◦ Failure free case ( Example and Design) ◦ Evaluation  Delay Analysis  Energy Analysis 2
  3. 3.  Sensor Networks, a particular class of wireless ad- hoc networks in which the nodes have sensors Sensor nodes gather and disseminate data about the physical conditions. 3
  4. 4.  Sensor nodes are battery powered and usually run out of battery ◦ Reducing energy consumption is an important design consideration Node failures is evident – due to battery drain or due to physical condition of their deployment environment 4
  5. 5.  Low Energy Adaptive Clustering Hierarchy Communicates directly with the respective cluster head and cluster heads communicate with base station. Does not consider end-to-end latency Assumes that base station is within communicating distance of all nodes. Economic feasibility and the scalability of solutions. 5
  6. 6.  Power Aware Caching Heuristics Determine the servers in the sensor network at which the data should be cached. Aimed at minimizing the cost of data dissemination from the sink node. What if the data cache fails? 6
  7. 7.  Motivated by two problems ◦ Implosion – broadcast ◦ Overlap – redundant data Use high level descriptors – metadata Nodes exchange metadata prior to data exchange What about the cost of dissemination ? 7
  8. 8.  SPIN didn’t consider node failure in the network. Adjust of power level with respect to distance to the neighbor 8
  9. 9.  Energy spent in wireless network is directory proportional to dα d – distance between source and destination α – constant between 2 and 4 SPMS uses multi-hop model for data transmission among nodes with variable transmission power levels 9
  10. 10.  Consider the following multihop routing between A to C Zone of A B 1 1 A C 5 Destination via COST C - 5 C B 2 10
  11. 11.  Knowing the route to destination Dealing with failures of intermediate nodes ? ? ? 11
  12. 12.  Node neighbor zones are considers ◦ A region that the node can reach by transmitting at maximum power level. Each node has a routing table for each of its zone neighbors ◦ Distributed Bellman Ford algorithm is used 12
  13. 13.  Motivated by SPIN1. Meta-data exchange within zone neighbors2. The node sends REQ packet to the source using the shortest path.3. If the source is not the next 1 hop neighbor the REQ is sent through multiple hops4. Relaying between nodes is used and meanwhile the destination nodes wait for the ADV from the 1 hop neighbors before sending the REQ5. Energy is saved here compared to the transmission directly to source node 13
  14. 14.  If the destination node doesn’t receive ADV from the relay node before the timer the timer expires it sends REQ to the source through the shortest path A timer Tadv is used to wait for ADV Expended Energy in SPIN = 2nEr Expended Energy in SPIN = 2kEr (k- relay nodes) Ratio of Reception leads to n>k Another timer TDAT is used to wait for DATA REQ is resent if the timer expires before reception of the data. 14
  15. 15. adv B advA C 15
  16. 16. REQ BA C Waits Tadv to receive ADV from B 16
  17. 17. DATA BA C Waits Tadv to receive ADV from B 17
  18. 18. ADV BA C 18
  19. 19. REQ BA C 19
  20. 20. DATA BA C 20
  21. 21.  At each stage, the destination node maintains a Primary Originator Node (PRONE) and Secondary Originator Node (SCONE). PRONE is the primary choice for the REQ , if PRONE fails SCONE is considered. 21
  22. 22. REQ B CA D Destination Source 22
  23. 23. B REQA D Destination Source 23
  24. 24.  SPMS is cost and energy effective compared to SPSM It reduces end-to-end data latency SPMS shortest distance multi-hop routing for the data transfers which allows energy savings. 24

×