2018/09/10 by Rui Tan, Tan, Rui, Linshan Jiang +5
Computer Science · #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Mobile Agent-Based Network Management #Network Time Synchronization Technologies #Parallel #and Cluster Computing (cs.DC) #cs.DC
paper · pdf · doi:10.48550/arxiv.1809.03165
arxiv created 2018/09/10 · openalex publication_date 2018/09/10 · arxiv updated 2018/09/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.