Splash: Fast Data Dissemination with Constructive Interference in Wireless Sensor
summary
Claims a protocol called Splash that uses tree pipelining and constructive interference plus channel-cycling, opportunistic overhearing and XOR coding to push a 32 KB object across 90–139-node testbeds in about 25 seconds, versus minutes for DelugeT2. Implementation on TinyOS/Contiki testbeds hits ~97.5% average per-node reliability after three rounds and 100% after local recovery; experiments show a 12–21× speedup and that XOR coding raises full-object completeness from ~37% to ~88%.
AI-written summary · about
chapters (19)
- 0:00Introduction
- 0:50Dissemination
- 1:30Completion Time
- 1:54Splash
- 3:00Tree Pipelining
- 5:02Reception Reliability
- 5:37Scalability
- 7:59Opportunistic Overhearing
- 8:50Channel Cycling
- 9:09Channel Assignment
- 9:36Exploit XR Coding
- 10:28Multichannel Splash
- 11:02Local Recovery
- 11:57Comparison
- 12:26Results
- 14:25Table
- 15:08Summary
- 16:38Conclusion
- 16:54Questions
related talks
45mHow can applications become more secure, private, and dependable
54mzenoh: A Next-Generation Protocol for IoT and Edge Computing
53mComparing Messaging Techniques for the IoT
15mPassive DSSS: Empowering the Downlink Communication for Backscatter Systems
31mTSCH@Zephyr: IEEE 802.15.4 SubG IIoT in the Making
46mEclipse Cyclone DDS: Data Sharing in the IoT Age
42mFUOTA Using LORAWAN and Zephyr: DFU in the 'Real' World
38mContinuous Delivery of IoT Sensors