Average TimeSync: a consensus-based protocol for time synchronization in wireless sensor networks1

Schenato, Luca; Fiorentin, Federico

doi:10.3182/20090924-3-it-4005.00006

Cited by 50 publications

(18 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the averaging scheme proposed in [5], [6] are proven to converge to the centralized best linear unbiased estimate of the node variables (offsets and skews) even in the presence of temporary node and link failures. The schemes in [7], [8] have similar robustness properties.…”

Section: Introductionsupporting

confidence: 52%

See 1 more Smart Citation

Time-synchronization in mobile sensor networks from difference measurements

Liao

Barooah

2010

49th IEEE Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arbitrary reference clock. Pairs of nodes that can communicate with each other can obtain noisy measurements of the relative skews and offsets between them. We propose a distributed algorithm with which each node can estimate its offset/skew from these noisy relative measurements by communicating only with its neighbors. The algorithm is simple and easy to implement. We model the change in the communication network due to the moving nodes as a Markov chain whose state space is the set of graphs that can occur. Using tools from Markov Jump Linear Systems, we provide a sufficient condition for the mean square convergence of the estimation error. A conjecture on mean square convergence under weaker conditions is discussed. Monte Carlo simulations are provided that corroborate the predictions and justify the conjecture.

show abstract

Section: Introductionsupporting

confidence: 52%

“…These are tree and cluster -based, and not fully distributed. The protocols in [5], [6], [7], [8] are distributed and iterative; nodes iteratively update their current estimates of skew and offset by exchanging information with their neighbors.…”

Section: Introductionmentioning

confidence: 99%

Time-synchronization in mobile sensor networks from difference measurements

Liao

Barooah

2010

49th IEEE Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

show abstract

“…On the opposite, the algorithm proposed in [5] compensates for the clock skews but not for the offsets. Distributed protocols that can compensate for both clock skews and offsets have been proposed in [6], [7]. Of note is the fact that both these strategies are highly nonlinear and do not lead to a simple characterization of the effects of noise on the steady-state performance.…”

Section: Introductionmentioning

confidence: 99%

Networked clock synchronization based on second order linear consensus algorithms

Carli

Zampieri

2010

49th IEEE Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

In this paper a distributed algorithm for clock synchronization is proposed. This algorithm is based on an extension of the consensus algorithm able to synchronize a family of double integrators. Since the various clocks may have different drifts, the algorithm needs to be designed so that it can work also in case of heterogeneous double integrators. Through a robust control analysis it is possible to determine the maximum admissible level of heterogeneity yielding synchronization. The first part of the paper is devoted to the analysis of an unrealistic synchronous implementation of the algorithm. However, in the last part of the paper we propose a realistic pseudo-synchronous implementation which is proved to be a perturbation of the synchronous one. From arguments related the center manifold theorem, the stability of the pseudo-synchronous is finally proved.

show abstract

“…. , N }, the i-th node has a local clock that, according to the notation used in [14], we denote in this subsection as τ i (t), t ∈ R ≥0 ; specifically, τ i (t) = d i t + x i (0) where d i and x i (0) are as in Section II.…”

Section: B Comparison With Other Distributed Strategiesmentioning

confidence: 99%

A randomized linear algorithm for clock synchronization in multi-agent systems

Bolognani¹,

Carli²,

Lovisari³

et al. 2012

2012 IEEE 51st IEEE Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

Abstract-In this paper a randomized linear protocol for time synchronization of clocks in a multi-agent scenario is considered. Clocks are allowed to have different offsets and different rates, and they communicate through an asymmetric broadcast protocol. The contribution of this paper is twofold. It is first shown that, under very mild conditions on the communication graph, it is possible to tune a protocol parameter in such a way that synchronization is achieved in mean-square. Then, via numerical simulations, the proposed strategy is compared with other fully distributed strategies recently proposed in the literature. While being slightly slower to reach the asymptotic synchronization, the proposed strategy significantly outperforms the other strategies in terms of robustness against process and measurement noises and time-varying clock drifts.

show abstract

Average TimeSync: a consensus-based protocol for time synchronization in wireless sensor networks1

Cited by 50 publications

References 10 publications

Time-synchronization in mobile sensor networks from difference measurements

Time-synchronization in mobile sensor networks from difference measurements

Networked clock synchronization based on second order linear consensus algorithms

A randomized linear algorithm for clock synchronization in multi-agent systems

Contact Info

Product

Resources

About