2022
DOI: 10.1016/j.automatica.2021.110045
|View full text |Cite
|
Sign up to set email alerts
|

Consensus-based time synchronization via sequential least squares for strongly rooted wireless sensor networks with random delays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 31 publications
0
6
0
Order By: Relevance
“…This algorithm can synchronize the skew and offset simultaneously with a faster convergence speed than ATS. In [15], a sequential least squares algorithm based on the recursive solution is applied to estimate the relative skew under bounded communications. The estimator calculates the initial value from direct solution with the same convergence performance.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm can synchronize the skew and offset simultaneously with a faster convergence speed than ATS. In [15], a sequential least squares algorithm based on the recursive solution is applied to estimate the relative skew under bounded communications. The estimator calculates the initial value from direct solution with the same convergence performance.…”
Section: Related Workmentioning
confidence: 99%
“…Subsequently, an average consensus-based scheme [2] utilizes the estimated skew to synchronize the network. Although the proposed algorithms [2,4,10,15] can meet different application requirements, time-consuming and message overload caused by iteration were not well handled.…”
Section: Related Workmentioning
confidence: 99%
“…Reference 1 proposes a delay compensation‐cased time synchronization algorithm to achieve bounded time synchronization under the UR switching network, while no rigorous proof of the drift compensation is given. Reference 2 proposes a sequential least squares based time synchronization algorithm to achieve bounded time synchronization, while the convergence conclusion is built under the strongly rooted topology condition. To the best of our knowledge, though some new time synchronization algorithms have been proposed, the effectiveness proof is either missing or built under the fixed network, which is not completely ahead compared with LSTS algorithm whose effectiveness has been rigorously proved under three types of directed switching networks.…”
Section: Introductionmentioning
confidence: 99%
“…Time synchronization is a fundamental support technology for WSNs. 59 Due to the battery-powered characteristics of WSNs, energy efficiency is a virtual factor to be considered when designing corresponding time synchronization protocols. 10…”
Section: Introductionmentioning
confidence: 99%
“…Time synchronization is a fundamental support technology for WSNs. [5][6][7][8][9] Due to the batterypowered characteristics of WSNs, energy efficiency is a virtual factor to be considered when designing corresponding time synchronization protocols. 10 In WSNs, the energy consumed by sensor nodes for communication (sending, receiving, and so on) is much larger than that consumed for computing, 11 and the information exchange mode can significantly influence the energy consumed for time synchronization.…”
Section: Introductionmentioning
confidence: 99%