No abstract

Clock synchronization is an important component of wireless sensor networks (WSNs) both for co-ordination of node communications and for time stamping sensor data. The previously presented clock sampling mutual network synchronization (CS-MNS) algorithm is simple, has low communication and processing overhead, and allows fully decentralized operation. We present some simulation results that indicate the potential of CS-MNS to achieve high clock synchronization accuracy in mobile multi-hop wireless networks. Past work has shown clock convergence under specific conditions in single-hop networks. We show analytically that in the absence of offset errors, the network clocks converge. In the presence of offset errors, we present conditions on the degree of clock asynchrony under which the network clock rates show convergent behavior. The analysis is applicable as long as the network topology is connected and, thus, is of interest in both single-hop and multi-hop environments. As a side result, we also show how a network designer can use these conditions to add a bias term to the CS-MNS algorithm and, thus, improve the start-up dynamics of the algorithm. Furthermore, we discuss the algorithm from a security standpoint. Finally, we propose a method for adding external reference synchronization that is compatible with our security discussion. protocols [1], power management, and localization techniques among others. The IEEE 802.11 standard [2], for instance, utilizes network synchronization for power management and frequency hopping, whereas the IEEE 802.16 and the IEEE 802.15 [3] standards depend on network synchronization for their timeslotted medium access control (MAC) protocols. In

No abstract

No abstract

Clock synchronization is an important component of wireless sensor networks both for co-ordination of node communications and for time stamping sensor data. The properties of the previously presented clock sampling mutual network synchronization algorithm (CS-MNS) are explored. The desirable properties of this algorithm include simplicity, low communication and processing overhead, and fully decentralized operation. Past simulation and analysis has shown clock convergence under specific conditions in single hop networks. We show that in the absence of offset errors the network clocks converge. In the presence of offset error we present conditions on the degree on clock asynchrony under which the network clock rates show convergent behavior. The analysis is applicable as long as the network topology is connected and thus is of interest in both single-hop and multi-hop environments. We show how the network designer can use these conditions to add a bias term to the CS-MNS algorithm and thus improve the start-up dynamics of the algorithm. Additionally, we discuss the algorithm from a security standpoint. Finally, we propose a method for adding external reference synchronization that is compatible with our security discussion.