Time Synchronization in WSNs With Random Bounded Communication Delays

Recently, it was pointed out that many popular consensus-based time synchronization algorithms, such as Average TimeSynch (ATS), are all divergent in a network with arbitrarily small random communication delays under any interconnection topology. This note proposes a least-squares estimation-based t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 62; no. 10; pp. 5445 - 5450
Main Author Tian, Yu-Ping
Format Journal Article
LanguageEnglish
Published IEEE 01.10.2017
Subjects
Clocks
consensus
Convergence
Delays
Estimation
Protocols
Synchronization
time synchronization
wireless sensor network
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:Recently, it was pointed out that many popular consensus-based time synchronization algorithms, such as Average TimeSynch (ATS), are all divergent in a network with arbitrarily small random communication delays under any interconnection topology. This note proposes a least-squares estimation-based time synchronization (LSTS for short) algorithm. This algorithm modifies the ATS algorithm in relative drift estimator, low-pass filter, and consensus protocol. By analyzing the mathematic model of the algorithm, it is proved that LSTS ensures asymptotic convergence of the drift estimation and boundedness of the global time synchronization error under random bounded communication delays if the network topology satisfies some connectedness conditions.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2017.2697683