The ever-increasing number of WSN deployments based on a large number of battery-powered, low-cost sensor nodes, which are limited in their computing and power resources, puts the focus of WSN time synchronization research on three major aspects, i.e., accuracy, energy consumption and computational complexity. In the literature, the latter two aspects have not received much attention compared to the accuracy of WSN time synchronization. Especially in multi-hop WSNs, intermediate gateway nodes are overloaded with tasks for not only relaying messages but also a variety of computations for their offspring nodes as well as themselves. Therefore, not only minimizing the energy consumption but also lowering the computational complexity while maintaining the synchronization accuracy is crucial to the design of time synchronization schemes for resource-constrained sensor nodes. In this paper, focusing on the three aspects of WSN time synchronization, we introduce a framework of reverse asymmetric time synchronization for resource-constrained multi-hop WSNs and propose a beaconless energy-efficient time synchronization scheme based on reverse one-way message dissemination. Experimental results with a WSN testbed based on TelosB motes running TinyOS demonstrate that the proposed scheme conserves up to 95% energy consumption compared to the flooding time synchronization protocol while achieving microsecond-level synchronization accuracy.

A Beaconless Asymmetric Energy-Efficient Time Synchronization Scheme for Resource-Constrained Multi-Hop Wireless Sensor Networks

The ever-increasing number of WSN deployments based on a large number of battery-powered, low-cost sensor nodes, which are limited in their computing and power resources, puts the focus of WSN time synchronization research on three major aspects of accuracy, energy consumption, and computational complexity. In the literature, the latter two aspects haven’t received much attention compared to the accuracy of WSN time synchronization. Especially in multi-hop WSNs, intermediate gateway nodes are overloaded with tasks for not only relaying messages but also a variety of computations for their offspring nodes as well as themselves. Therefore, not only minimizing the energy consumption but also lowering the computational complexity while maintaining the synchronization accuracy is crucial to the design of time synchronization schemes for resource-constrained sensor nodes. In this paper, focusing on the three aspects of WSN time synchronization, we introduce a framework of reverse asymmetric time synchronization for resource-constrained multi-hop WSNs and propose a beaconless energy-efficient time synchronization scheme based on reverse one-way message dissemination. Experimental results with a WSN testbed based on TelosB motes running TinyOS demonstrate that the proposed scheme conserves up to 95% energy consumption compared to the flooding time synchronization protocol while achieving microsecond-level synchronization accuracy.

Multi-hop time synchronization is essential to large-scale deployment of IoT and wireless sensor networks. Its performance, however, is affected by the processing delays at intermediate gateway nodes, which cause cumulative synchronization error. To address this, we propose a per-hop delay compensation scheme as a simple and effective multi-hop extension option based on packet-relaying gateway nodes for energy-efficient time synchronization in wireless sensor networks. Experimental results on a real testbed demonstrate that the per-hop delay compensation scheme significantly improves the multi-hop time synchronization performance when applied to the state-of-the-art beaconless asymmetric energy-efficient time synchronization scheme and the conventional flooding time synchronization protocol.

Per-Hop Delay Compensation in Time Synchronization for Multi-Hop Wireless Sensor Networks Based on Packet-Relaying Gateways

Slow convergence is a major drawback of average-based consensus time synchronization protocols, particularly in large or sparse wireless sensor networks. The convergence speed can be increased by adding more nodes or increasing the transmission range of nodes, because the network becomes strongly connected. However, these solutions are not always feasible owing to hardware constraints. In this article, a virtual topology-based time synchronization protocol (VTSP) is proposed to address the aforementioned drawback of consensus-based protocols. Notably, VTSP performs the consensus process on a virtual topology that has a stronger algebraic connectivity than a physical one. Therefore, VTSP can significantly accelerate convergence speed without modifying the physical structure of the network. The virtual topology is formed by creating virtual links between each node and its two-hop neighbors. Moreover, two optimization techniques are suggested for reducing data redundancy, which is caused during the creation of the virtual links, in timing messages and for speeding up the convergence by excluding edge nodes from the consensus process. Simulation results demonstrate that VTSP can achieve convergence three times faster than the gradient time synchronization protocol, a well-known consensus-based time synchronization protocol, in various topologies while preserving the same level of accuracy.

Fast Consensus-Based Time Synchronization Protocol Using Virtual Topology for Wireless Sensor Networks

One-way-broadcast-based flooding time synchronization algorithms are commonly used in wireless-sensor networks (WSNs). However, the packet delay and clock drift pose a challenge to accuracy, as they entail serious by-hop error accumulation problems in the WSNs. To overcome this, a rapid-flooding multibroadcast time synchronization with real-time delay compensation (RDC-RMTS) is proposed in this article. By using a rapid-flooding protocol, flooding latency of the referenced time information is significantly reduced in the RDC-RMTS. In addition, a new joint clock skew-offset maximum-likelihood estimation (MLE) is developed to obtain the accurate clock parameter estimations and the real-time packet delay estimation. Moreover, an innovative implementation of the RDC-RMTS is designed with an adaptive clock offset estimation. The experimental results indicate that the RDC-RMTS can easily reduce the variable delay and significantly slow the growth of by-hop error accumulation. Thus, the proposed RDC-RMTS can achieve accurate time synchronization in large-scale complex WSNs. 

A Novel Rapid-Flooding Approach With Real-Time Delay Compensation for Wireless-Sensor Network Time Synchronization

Average consensus theory is intensely popular for building time synchronization in wireless sensor network (WSN). However, the average consensus-based time synchronization algorithm is based on the iteration that poses challenges for efficiency, as they entail high communication cost and long convergence time in large-scale WSN. Based on the suggestion that the greater the algebraic connectivity the faster the convergence, a novel multihop average consensus time synchronization (MACTS) is developed with innovative implementation in this article. By employing multihop communication model, it shows that virtual communication links among multihop nodes are generated and algebraic connectivity of the network increases. Meanwhile, a multihop controller is developed to balance the convergence time, accuracy, and communication complexity. Moreover, the accurate relative clock offset estimation is yielded by delay compensation. Implementing the MACTS based on the popular one-way broadcast model and taking multihop over short distances, we achieve hundreds of times the MACTS convergence rate compared to average TimeSync (ATS).

Fast Convergence Time Synchronization in Wireless Sensor Networks Based on Average Consensus

One-way-broadcast-based flooding time synchronization algorithms are commonly used in wireless-sensor networks (WSNs). However, the packet delay and clock drift pose a challenge to accuracy, as they entail serious by-hop error accumulation problems in the WSNs. To overcome this, a rapid-flooding multibroadcast time synchronization with real-time delay compensation (RDC-RMTS) is proposed in this article. By using a rapid-flooding protocol, flooding latency of the referenced time information is significantly reduced in the RDC-RMTS. In addition, a new joint clock skew-offset maximum-likelihood estimation (MLE) is developed to obtain the accurate clock parameter estimations and the real-time packet delay estimation. Moreover, an innovative implementation of the RDC-RMTS is designed with an adaptive clock offset estimation. The experimental results indicate that the RDC-RMTS can easily reduce the variable delay and significantly slow the growth of by-hop error accumulation. Thus, the proposed RDC-RMTS can achieve accurate time synchronization in large-scale complex WSNs.

A Novel Rapid-Flooding Approach With Real-Time Delay Compensation for Wireless-Sensor Network Time Synchronization.

The robust average consistency theory is ideal for building time synchronization in the dynamic and distributed networks, however it remains the major challenge due to the iteration. Existing consensus-based approaches converge slowly, although they are reliable even in dynamic networks. It is thus unreasonable to implement these algorithms in a large-scale wireless network. Motivated by this consideration, we note that the graph theory-based theory suggests that the greater the algebraic connectivity, the faster the convergence, thereby leading to the proposal of multi-hop average consensus time synchronization (MACTS) with innovative implementation in consideration of the features of wireless sensor network. To accelerate the synchronization convergence without changing the network topology, we present a packet fast forwarding model to generate virtual communication links among multi-hop nodes, meanwhile, an attenuation methods for the forwarding model is designed to balance the accuracy and cost of synchronization. We compensate relative clock offset estimates by transmitting delay estimates to achieve accurate synchronization. Moreover, based on the popular one-way broadcast model, the proposed MACTS is easy to implement. The experimental results indicate that MACTS is more accurate and converges much faster than the typical average consistency synchronization algorithm.

Lili Ran

Papers

Fast Convergence Time Synchronization in Wireless Sensor Networks Based on Average Consensus

A Novel Rapid-Flooding Approach With Real-Time Delay Compensation for Wireless-Sensor Network Time Synchronization.

Fast Convergence Average Consensus-Based Time Synchronization with Innovative Implementation