Resilience Bounds of Sensing-Based Network Clock Synchronization

09/10/2018
by   Rui Tan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2022

Optimal Clock Synchronization with Signatures

Cryptographic signatures can be used to increase the resilience of distr...
research
07/13/2018

A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids

Synchronizing clocks in a distributed system in which processes communic...
research
02/21/2019

Fault Tolerant Gradient Clock Synchronization

Synchronizing clocks in distributed systems is well-understood, both in ...
research
05/15/2020

Time- and Space-Optimal Clock Synchronization in the Beeping Model

We consider the clock synchronization problem in the (discrete) beeping ...
research
10/21/2019

Clock synchronization over networks using sawtooth models

Clock synchronization and ranging over a wireless network with low commu...
research
03/24/2023

On the Susceptibility of QDI Circuits to Transient Faults

By design, quasi delay-insensitive (QDI) circuits exhibit higher resilie...
research
01/12/2023

Gradient TRIX

Gradient clock synchronization (GCS) algorithms minimize the worst-case ...

Please sign up or login with your details

Forgot password? Click here to reset