Abstract

In the framework of the consensus-based time synchronization (CBTS) algorithm structure, this paper gives a constant gain approach to the design of time synchronization algorithms for wireless sensor networks (WSNs) with random bounded communication delays. Under the assumption that the asynchronous updating topology is uniformly rooted (UR), it is proved that this design can ensure the asymptotic convergence of drift estimations and the boundedness of the global synchronization errors even if we do not compensate the offsets. A numerical experiment is presented to illustrate the effectiveness of this algorithm.

Full Text
Published version (Free)

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