1 / 40

Manjunath Doddavenkatappa, Chan Mun Choon and Ben Leong National University of Singapore

Splash: Fast Data Dissemination with Constructive Interference in Wireless Sensor Networks. Manjunath Doddavenkatappa, Chan Mun Choon and Ben Leong National University of Singapore. A Fundamental Service: Data/Program Dissemination.

jud
Download Presentation

Manjunath Doddavenkatappa, Chan Mun Choon and Ben Leong National University of Singapore

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. Splash: Fast Data Dissemination with Constructive Interference in Wireless Sensor Networks Manjunath Doddavenkatappa, Chan Mun Choon and Ben Leong National University of Singapore

  2. A Fundamental Service: Data/Program Dissemination

  3. A dissemination protocol is required throughout the life of a sensor application Dissemination completion time is critical

  4. Completion time for existing protocols is still in the order of minutes Culprit is Contention Resolution

  5. Eliminate the need for contention Constructive Interference [Glossy’2011] Channel Diversity [PIP’2010] SPLASH

  6. Transmission Density Diversity Opportunistic Overhearing Tree Pipelining SPLASH Channel Cycling XOR Coding

  7. P1 P1 P1 P1 P1 P1 P1 P1 Cycle 2 Cycle 1 P1 P1 P2 P2 P1 P1 P2 P2 P1 P1 P2 P2 P2 P1 P1 P2 Cycle 3 Cycle 4 Idling Transmitting Receiving

  8. Transmission Density Diversity Opportunistic Overhearing Tree Pipelining SPLASH Channel Cycling XOR Coding

  9. Transmission Density Diversity Opportunistic Overhearing Tree Pipelining SPLASH Channel Cycling XOR Coding

  10. The problem is more severe in practice Constructive Interference is not Scalable [Wang et al. INFOCOM’12]

  11. Decreasing trend is not always true Constructive Interference is not Scalable

  12. Our results suggest that an increase in no. of transmitters can also improve reliability Effect of the Capture Effect

  13. First round: only non-leaf nodes forward • Typically, more than 50% of the nodes in a tree are leaf nodes [Manjunath et al. RTSS’11] • Nodes benefit from low transmission density • Second round: all nodes transmit • Nodes benefit from high transmission density by exploiting capture effect or sender diversity[Rahul et al. SIGCOMM’10] Splash: Transmission Density Diversity

  14. Transmission Density Diversity Opportunistic Overhearing Tree Pipelining SPLASH Channel Cycling XOR Coding

  15. P1 P1 X P1 P1 Cycle 2 P1 P1 P2 P1 P2 P1 Cycle 3

  16. P1 P1 X P1 P1 Cycle 2 Packet reception chance is doubled P1 P1 P2 P1 P1 P2 P1 P1 Cycle 3

  17. Transmission Density Diversity Opportunistic Overhearing Tree Pipelining SPLASH Channel Cycling XOR Coding

  18. CH4 CH3 CH2 CH1 CH2 CH1 CH4 CH3 Round 1 Round 2

  19. Transmission Density Diversity Opportunistic Overhearing Tree Pipelining SPLASH Channel Cycling XOR Coding

  20. After two rounds, more than 50% of nodes received most but not full object • Third round: every transmission is a XOR sum • Probability that a packet transmission is useful is increased Splash: XOR Coding

  21. Three Rounds of Dissemination Transmission Density Diversity Opportunistic Overhearing Channel Cycling XOR Coding Splash: Summary of Its Three Dissemination Rounds A node in Splash has six chances to receive a packet on up to six different channels

  22. If any missing data is recovered locally • Neighbor querying and data downloading over CSMA/CA • Fact that about 90% of nodes have the full object makes local recovery practical Splash: Local Recovery

  23. Indriya Testbed 139 TelosB nodes Twist Testbed 90 Tmotesky nodes Experimental Setup

  24. DelugeT2 (TinyOS) Other Protocols Splash (Contiki) Deluge (Contiki) Comparison

  25. /12 /21 Summary of Results on Indriya (32 KB dissemination) 25.15s 305s 524s

  26. Summary of Results on Twist (Splash: 32 KB, Deluge: 2KB) 24.73s 418s

  27. Comparison to Other Approaches (Baseline: DelugeT2)

  28. Opportunistic Overhearing XOR coding Evaluation of Individual Techniques Transmission Density Diversity Channel Cycling Local Recovery

  29. XOR Coding: increases percentage of nodes having the full object from 37% to 88% Evaluation of Individual Techniques Opportunistic overhearing: decreases dissemination time by 26%

  30. Channel Cycling: decreases dissemination time by 25% Evaluation of Individual Techniques Transmission Density Diversity: 39% and 18% of nodes benefit from low and high transmission densities respectively

  31. Local Recovery

  32. 8s for 98.8% of 30 KB 12.4s for 1.2% of 30 KB Local Recovery

  33. We designed and implemented Splash, a fast data dissemination protocol • Key factors are constructive interference, channel diversity and techniques for reliability • Splash reduces completion time by an order of magnitude Conclusion

  34. Thank you

  35. Some of the images in these slides are downloaded from Google Images and KalyanVarma’s websitehttp://kalyanvarma.net/ References

More Related