Hello: A Generic Flexible Protocol for Neighbor Discovery
description
Transcript of Hello: A Generic Flexible Protocol for Neighbor Discovery
![Page 1: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/1.jpg)
Hello: A Generic Flexible Protocol
for Neighbor DiscoveryWei Sun, Zheng Yang, Keyu Wang and Yunhao Liu
CSE, Hong Kong University of Science and TechnologySchool of Software and TNList, Tsinghua University
Gaoyang Guan
![Page 2: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/2.jpg)
Motivation• Neighbor discovery is crucial• Better trade-off between duty cycle and discovery
latency
![Page 3: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/3.jpg)
Challenges• Existing protocols’ parameters are highly restricted• Reduce or take advantage of redundant discovery• Existing protocols cannot adjust well to application
demands
![Page 4: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/4.jpg)
Contributions• A neighbor discovery protocol that exhibits the
highest degree of freedom.• An optimality analysis under a generic framework.• A flexible solution to applications dynamics.• Extensive evaluation through simulation and real
world experiments.
![Page 5: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/5.jpg)
Design• A. Schedule Design
![Page 6: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/6.jpg)
Design• A. Schedule Design• Possible solutions• Stay active in the first slots
• Our design• expand the period to cn slots• wakes up at the first slot of each cycle• wakes up at the consecutive slots indexed from 1 to
c/2 in the first cycle
![Page 7: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/7.jpg)
Design• B. Symmetric Discovery Latency• Lemma 1.
The worst-case discovery latency Ls for Hello under symmetric duty cycles with parameter pair (c; n) is cn slots.
![Page 8: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/8.jpg)
Design• C. Duty-Cycle Asymmetry
1) Same c, Different n:
2) Different c:
![Page 9: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/9.jpg)
Design• D. A Generic Framework
![Page 10: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/10.jpg)
Design• E. Optimality Analysis• 1) Optimum for symmetric duty cycles:
Searchlight
![Page 11: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/11.jpg)
Design• 2) Optimum for asymmetric duty cycles:
This result well explains why Disco performs best under asymmetric duty cycles
![Page 12: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/12.jpg)
Design• 3) A compromise:
worst-case latency
U-Connect
![Page 13: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/13.jpg)
Design• G. Redundancy• 1) Redundancy from slot non-alignment
• beaconing at both the beginning and the end of an active slot leads to two discovery opportunities
• 2) Redundancy from repetitive patrols• each patrol is put at a randomly selected cycle (row) but at the
same relative position (column) within the cycle
![Page 14: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/14.jpg)
Evaluation
![Page 15: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/15.jpg)
Evaluation
![Page 16: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/16.jpg)
Evaluation
![Page 17: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/17.jpg)
Evaluation
![Page 18: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/18.jpg)
Evaluation
![Page 19: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/19.jpg)
IMPLEMENTATION
![Page 20: Hello: A Generic Flexible Protocol for Neighbor Discovery](https://reader035.fdocuments.us/reader035/viewer/2022062501/568163ef550346895dd5685a/html5/thumbnails/20.jpg)
Q&A