Abstract
In recent years, wireless sensor networks have been an interesting and important research area. The time synchronization is an important problem for wireless sensor networks. In this paper, a novel time synchronization scheme in wireless sensor networks is proposed. First, we create a spanning tree of all the nodes in the network by broadcasting children-find packets. Then, the spanning tree is divided into multiple subtrees, in which two subtree synchronization algorithms can be performed. After that, time synchronization of the whole network will be achieved. Performance analyses and simulations are presented in this paper, and demonstrate that our proposed scheme has much better performance than RBS [4] in terms of both synchronization delay and synchronization error.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
