1 / 35

Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks

Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks. Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg, University of Nebraska at Lincoln Jong-Hoon Youn Department of Computer Science, University of Nebraska at Omaha ICC 2005. Outline.

howard-walker
Download Presentation

Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg, University of Nebraska at Lincoln Jong-Hoon Youn Department of Computer Science, University of Nebraska at Omaha ICC 2005

  2. Outline • Introduction • Hierarchical data dissemination schemes (HDDS) • Basic scheme • FDDD • FSDD • LSDD • Handle node failures • Simulation • Conclusion

  3. Introduction --- background • A main communication pattern is data from sensor nodes to a sink node • Sink nodes may be mobile • Monitor enemy in a battlefield • Sensors detect enemy tanks • A soldier carries a wireless communication device to collect information

  4. Introduction --- previous work Title: TTDD: A Two-tier Data Dissemination Model for Large-scale Wireless Sensor Networks Authors: Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang From: IEEE Mobicom 2002

  5. Introduction --- previous work Record a upstream dissemination node towards the source mobile sink source dissemination node

  6. Introduction --- previous work Immediate dissemination node Primary Agent mobile sink source dissemination node

  7. Introduction --- previous work Immediate dissemination node Primary Agent mobile sink source dissemination node

  8. Introduction --- previous work • Advantage • Source can effectively deliver data to mobile sinks • Disadvantages • The grid construction and maintenance per each source leads to a considerable overhead • Some dissemination nodes have high overhead • Some dissemination nodes does not use

  9. Introduction --- motivations and goals • Motivations • Propose efficient grid construction • Balance dissemination nodes overhead • Goals • Scalable and efficient data dissemination • Decrease power consumption

  10. HDDS --- assumptions • Sensors are evenly and densely scattered over the sensor field • All sensors know the dimension of sensor field and their location • Sensors are stationary but some of sinks may be mobile • Sensors use simple greedy forwarding to deliver packets to destination

  11. HDDS --- overview • Basic scheme • The non-uniform grid construction is based on sink density • Three schemes for data dissemination • FDDD • FSDD • LSDD • Handle node failures

  12. HDDS --- basic scheme source Sensor field

  13. HDDS --- basic scheme (l, w) (l/2+ε, w/2+ε) (l/2-ε, w/2-ε) Computed Field (CF) source (0,0) Sensor field

  14. HDDS --- basic scheme (l, w) (l/2+ε, w/2+ε) (l/2, w/2) Primary dissemination node (l/2-ε, w/2-ε) Computed Field (CF) The Source send a request to a randomly selected location within the CF source (0,0) Sensor field

  15. HDDS --- basic scheme (l, w) (l/2+ε, w/2+ε) The primary dissemination node can serve a limited number of sinks (l/2, w/2) The primary dissemination node broadcasts message containing its location and coordinates of coverage area ( sensor field) (l/2-ε, w/2-ε) source (0,0) Sensor field

  16. HDDS --- basic scheme Level 1 dissemination node (l/4, 3w/4) (3l/4, 3w/4) (l/2, w/2) Primary dissemination node (3l/4, w/4) (l/4, w/4) source Sensor field

  17. HDDS --- basic scheme Level 1 dissemination node broadcasts message containing its location and coordinates of coverage area (1/4 sensor filed) Forwarding agent The mobile sink receives the message, it replies with a subscription message that contains the location of its current forwarding agent

  18. HDDS --- basic scheme Level 2 dissemination node Level 1 dissemination node Primary dissemination node source Sensor field

  19. HDDS --- basic scheme Level 2 dissemination node Level 1 dissemination node Primary dissemination node source Sensor field

  20. HDDS --- FDDD • FDDD (Fully Distinct Data Dissemination) • Use distinct data dissemination hierarchy for each source • Each source selects a new primary dissemination node within the CF • Each source may have a different set of nodes that facilitate forwarding of data

  21. HDDS --- FSDD • FSDD (Fully Sharing Data Dissemination) • Use fully sharing data dissemination hierarchy for each source • The first primary dissemination node aggregates data

  22. HDDS --- FSDD • The first primary dissemination node broadcasts a message within the CF • All sensors within the CF know the primary dissemination node existence sensor Computed Field (CF) source Sensor field

  23. HDDS --- LSDD • LSDD (Limited Sharing Data Dissemination) • Use limited sharing data dissemination hierarchy for each source • A primary dissemination node can serve a limit number of sources

  24. HDDS --- FSDD • When this limit is reached, a new primary dissemination node is selected • The new primary dissemination node then forms distinct data dissemination hierarchy sensor sensor Computed Field (CF) source Sensor field

  25. HDDS --- handle node failures • Dissemination node fails • Sink node fails • Forwarding agent fails

  26. HDDS---dissemination node fails When a sensor node is a dissemination node, it selects one or more of its neighbors to be its backup nodes Level 1 dissemination node Primary dissemination node A backup nodes takes over as the dissemination node and notifies all the nodes that need to know about the change

  27. HDDS --- sink node fails If the forwarding agent does not receive sink update message within the fixed amount of time Level 1 dissemination node Forwarding agent Primary dissemination node The forwarding agent transmits information to the dissemination node to stop sending data to the sink

  28. HDDS ---Forwarding agent fails If the sink does not receive data from the forwarding agent within the fixed amount of time Level 1 dissemination node Forwarding agent Primary dissemination node The sink starts the process of selecting a new forwarding agent

  29. Simulation • Ns-2 simulator • 200 sensor nodes random deployment • Sensor field : 2000m by 2000m • 0.5% to 4% nodes are sources • Each source node : 1 packet/s • The number of sinks varies from 5 to 20

  30. Simulation • The CF region is set to 20m by 20m, is located at the center of the sensor field • A dissemination node can serve 3 sinks

  31. Simulation Energy Consumption variation by changing number of sources and sinks

  32. Simulation Overhead = the number of control packet/ the number of data packet Overhead variation by changing number of sources and sinks

  33. Simulation Delay variation by changing number of sources and sinks

  34. Simulation Throughput variation by changing number of sources and sinks

  35. Conclusion • Propose energy efficient schemes for data dissemination in sensor networks • The non-uniform grid can be constructed to disseminate data based on sink density

More Related