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 is achieved. Performance analyses and simulations are presented in this paper, and demonstrate that our proposed scheme has much better performance than RBS in terms of both synchronization delay and synchronization error.
Proc. of 2006-Spring IEEE Vehicular Technology Conference