efficient network flooding and time synchronization with glossy federico ferrari, marco zimmerling,...
TRANSCRIPT
![Page 1: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/1.jpg)
Efficient Network Flooding and Time Synchronization with Glossy
Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh
ETH ZurichIPSN 2011 Best Paper Award
Presenter: SY
![Page 2: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/2.jpg)
Outline
• Introduction• Design• Evaluation• Conclusion
![Page 3: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/3.jpg)
Flooding
• Packet transmission from one node to all other
• Challenges– Packet loss– Delay– Flooding storm
![Page 4: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/4.jpg)
Glossy
• Flooding for wireless sensor networks– Fast: 94 nodes within 2.39ms– Reliable: 99.99%– Scalable– Time synchronization at no additional cost
![Page 5: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/5.jpg)
Interference
• Capture effect– Two signals interfere which other– If one is stronger that the other– Or received significantly earlier than the others– Receiver might still receive the packet
• Constructive interference
Δ
1. Identical packet2. Small Δ
![Page 6: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/6.jpg)
Generating Constructive Interference
• Matlab simulations
![Page 7: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/7.jpg)
Related Works
• Capture effect
• Backcast: Dutta et al. 2008– Concurrent ACK transmission
• A-MAC: Dutta et al. 2010– Receiver-initiated link layer protocol
![Page 8: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/8.jpg)
Outline
• Introduction• Design• Evaluation• Conclusion
![Page 9: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/9.jpg)
Overview
• Decouples flooding• Concurrent transmission• Constant slot length
![Page 10: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/10.jpg)
Glossy in Detail
![Page 11: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/11.jpg)
Timeline
![Page 12: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/12.jpg)
Implementation
• Platform– Tmote Sky = Taroko– MSP430F1611 + CC2420– MCU and timer source by DCO• temperature and voltage drifts of -0.38%/◦C and 5%/V
• Challenges– Deterministic execution timing– Start execution at same time– Compensate for hardware variations
![Page 13: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/13.jpg)
Deterministic execution timing
• Start reading content while receiving
• Immediately trigger transmission
![Page 14: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/14.jpg)
Start execution at same time
• SFD interrupt• Variable delay in serving interrupt– Execute NOPs determined at runtime
![Page 15: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/15.jpg)
Compensate for hardware variations
• Synchronizes the DCO every time Glossy starts– with respect to 32.768KHz crystal
• Software delay uncertainty
![Page 16: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/16.jpg)
Outline
• Introduction• Design• Evaluation• Conclusion
![Page 17: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/17.jpg)
Theoretical Analysis• Scenario
• Worst-Case Drift of Radio Clock– Assume an upper/lower bound of radio clock drift– Worst-case scenario:
• one path at highest clock drift, another at lowest
– Model worst-case transmission time uncertainty• Worst-case temporal displacement
– Uncertainty on pair of radio and MCU clock– Worst-case scenario:
• one path at minimum variation, another at maximum
– Worst-case temporal displacement Δ
![Page 18: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/18.jpg)
Results
• Network size
• Node density
![Page 19: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/19.jpg)
Controlled Experiments
• Setup 1– One initiator, two receivers– Delay one receiver by [0,8]us– Non-delay receiver@-20dBm, delayed@-13dBm
![Page 20: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/20.jpg)
Controlled Experiments
• Setup 2– One initiator, variable # of recievers– No delay
![Page 21: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/21.jpg)
Controlled Experiments
• Setup 3– One initiator, four receivers– Start a Glossy phase, computes reference time– Schedules next phase– All nodes activate an external pin when a phase start
![Page 22: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/22.jpg)
Testbed Experiments
• Testbed– Motelab: 94 nodes over three floors– Twist: 92 nodes– Local: 39 nodes
• Metrics– Flooding latency L– Flooding reliability R– Radio on time T
![Page 23: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/23.jpg)
Results
• Node density no noticeable dependency• Performance depends on network size• Increase N significantly enhances flooding
reliability
![Page 24: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/24.jpg)
Performance on Twist
• Larger size, higher latency
• 80% of nodes has 99.99% reliability even with lowest power
• Radio on time increase with network size
![Page 25: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/25.jpg)
Maximum Number of Transmissions
• Vary N
![Page 26: Efficient Network Flooding and Time Synchronization with Glossy Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh ETH Zurich IPSN 2011](https://reader036.vdocuments.site/reader036/viewer/2022062407/56649d145503460f949e8226/html5/thumbnails/26.jpg)
Conclusion
• Flooding and time sync are two important services
• Well written, systematically analysis• Promising results• Detailed implementation• Testbed evaluation• Integrate with application might not be easy