Abstract

Average-consensus protocol is one of the ways to develop distributed time-synchronization algorithms in Internet of Things (IoT) networks. However, the large number of iteration leads to a common time notion issue in nodes. This poses a critical challenge in the convergence of the time-synchronization algorithm and resulting asymptotic convergence in the average consensus protocol. In this paper, a parameter-sharing-based average-consensus time-synchronization (PACTS) algorithm is proposed. For fast convergence, the proposed PACTS quickly forwards the time information to multi-hop nodes and employs multi-hop average-consensus instead of single-hop average-consensus. Specifically, a node asynchronously and periodically broadcasts the relative clock offset estimation of neighbors with its local time information. Meanwhile, the relative clock offset estimation of the multi-hop node is calculated and used to estimate the average value. Consequently, an average-consensus among local multi-hop nodes is obtained. As a result, the iteration number and convergence time are significantly reduced over the network. Finally, the experimental results indicate that the proposed PACTS algorithm has low complexity, high accuracy, and quick convergence.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.