Abstract
Recent studies exploited external periodic synchronous signals to synchronize a pair of network nodes to address a threat of delaying the communications between the nodes. However, the sensing-based synchronization may yield faults due to nonmalicious signal and sensor noises. This paper considers a system of N nodes that will fuse their peer-to-peer synchronization results to correct the faults. Our analysis gives the lower bound of the number of faults that the system can tolerate when N is up to 12. If the number of faults is no greater than the lower bound, the faults can be identified and corrected. We also prove that the system cannot tolerate more than N - 2 faults. Our results can guide the design of resilient sensing-based clock synchronization systems.
Original language | English |
---|---|
Title of host publication | Proceedings - 2018 IEEE 24th International Conference on Parallel and Distributed Systems, ICPADS 2018 |
Publisher | IEEE Computer Society |
Pages | 894-902 |
Number of pages | 9 |
ISBN (Electronic) | 9781538673089 |
DOIs | |
Publication status | Published - Jul 2 2018 |
Externally published | Yes |
Event | 24th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2018 - Singapore, Singapore Duration: Dec 11 2018 → Dec 13 2018 |
Publication series
Name | Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS |
---|---|
Volume | 2018-December |
ISSN (Print) | 1521-9097 |
Conference
Conference | 24th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2018 |
---|---|
Country/Territory | Singapore |
City | Singapore |
Period | 12/11/18 → 12/13/18 |
Bibliographical note
Publisher Copyright:© 2018 IEEE.
ASJC Scopus Subject Areas
- Hardware and Architecture
Keywords
- bounds
- Clock synchronization
- fault tolerance