 Research Article
 Open Access
DiscreteTime SecondOrder Distributed Consensus Time Synchronization Algorithm for Wireless Sensor Networks
 Gang Xiong^{1} and
 Shalinee Kishore^{1}Email author
https://doi.org/10.1155/2009/623537
© G. Xiong and S. Kishore. 2009
 Received: 14 April 2008
 Accepted: 7 September 2008
 Published: 16 October 2008
Abstract
This paper proposes a novel discretetime secondorder distributed consensus time synchronization (SODCTS) algorithm for wireless sensor networks. The consensus properties and convergence rates of the SODCTS algorithm are analyzed for both directed and undirected networks. Additionally, the convergence region and optimal convergence rate of the SODCTS algorithm are determined for undirected networks and this convergence rate is shown to be superior to that of the firstorder DCTS (FODCTS) algorithm under careful algorithm design. Furthermore, the asymptotic expectation and mean square synchronization error are investigated for the SODCTS algorithm when there is Gaussian delay between network nodes. Finally, simulation results are provided to verify these analytical results.
Keywords
 Wireless Sensor Network
 Medium Access Control
 Network Node
 Error Vector
 Synchronization Error
1. Introduction
Wireless sensor networks are typically comprised of inexpensive, smallsized, powerlimited terminals. In a variety of applications, these sensor nodes are collectively required to maintain accurate time synchronization, for example, moving object acquisition and tracking, habitat monitoring, reconnaissance and surveillance, environmental monitoring, traffic control, and so forth [1]. This necessitates network algorithms that achieve and maintain global time synchronization at all network nodes, that is, algorithms that align all network nodes to a common notion of time.
Due to imperfections in lowcost hardware nodes and the decentralized nature of wireless sensor networks, global time synchronization has been recognized as a particularly challenging task. Conventional synchronization protocols such as timesynchronization protocol for sensor networks (TPSNs) [2], reference broadcast synchronization (RBS) [3], and flooding time synchronization protocol (FTSP) [4] aim to perform centralized global synchronization for all nodes in wireless sensor network [5]. These protocols achieve synchronization via timestamped packet exchanges with a root node or a data fusion center and are thus vulnerable to failure of these central nodes.
Recently, several distributed time synchronization algorithms have been proposed. One important class of such algorithms is referred to as distributed consensus time synchronization (DCTS) [6]. In the DCTS approach, a global time consensus can be sufficiently reached within a connected network by averaging pairwise local time information at network nodes. In [7], OlfatiSaber et al, established a theoretical framework for the analysis of consensus synchronization algorithms. Later, a fully distributed, asynchronous DCTS algorithm was proposed in [8]; this scheme was designed to reach agreement on time offset and skew offset between network nodes using media access control (MAC) layer timestamped packet exchanges. As an alternative, a physical layerbased DCTS algorithm was introduced in [9] by modeling sensor nodes as coupled discretetime oscillators. In particular, the algorithm adopts instantaneous received powers as weighted coefficients when updating local clocks.
To the best of our knowledge, existing literature on DCTS methods assumes that local timing update at each node is done using only current timing information, that is, via a firstorder DCTS (FODCTS) approach. In contrast, a secondorder DCTS (SODCTS) algorithm would utilize not only current timing information but also that available from the previous iteration of the algorithm to update local clocks. Such an extension to the basic consensus algorithm was first reported for a continuous time approach in [10]. Subsequent papers have analyzed this secondorder continuous time consensus method assuming fixed network topologies [11], time delay [12], and switching topologies [13]. In this paper, we apply the principles of the secondorder consensus approach to the distributed timing synchronization problem in wireless sensor networks. Specifically, we propose a novel discretetime SODCTS algorithm for wireless sensor networks and examine its convergence properties.
The major contribution of this paper is the theoretical analysis of the convergence characteristics of the SODCTS algorithm for both directed and undirected networks. Moreover, we investigate the convergence region and optimal convergence rate of the SODCTS algorithm in undirected networks and claim that the optimal convergence rate of the SODCTS algorithm is superior to that of the FODCTS algorithm under an appropriate algorithm design. Finally, we present the asymptotic expectation and mean square synchronization error of the SODCTS algorithm when the timing offset between network nodes is Gaussian distributed.
This paper is outlined as follows. Section 2 describes the system model and background for the proposed SODCTS algorithm. Section 3 presents the convergence properties of the SODCTS algorithm in directed and undirected networks. Section 4 discusses the convergence region and optimal convergence rate of the SODCTS algorithm in undirected networks. In Section 5, we present some convergence results for the SODCTS method when network nodes have Gaussian delay between each other. Simulation results are presented in Section 6, and we conclude our discussion in Section 7.
2. Background and System Model
2.1. Proposed SoDcts Algorithm
Timing information between network nodes can be exchanged either using timestamped packets at the MAC layer or by estimating arrival times of neighboring nodes' physical layer pulse signals. In the following, we describe the SODCTS method regardless of whether it is implemented at the MAC or physical layers. In each iteration of the SODCTS algorithm, each node processes and decodes the timestamped message from its neighbors or estimates the arrival time of its neighbors' pulse signals. Each node then updates its local clock using the weighted average of the current time differences between itself and its neighboring nodes as well as stored time differences from the previous iteration of the algorithm. It should be noted that in the SODCTS algorithm, each node needs to store time information from its neighbor nodes for both the previous and current iterations; this is in contrast to the FODCTS approach where only the current time information is processed in the current iteration.
where is the local time at node during iteration ; is the set of neighboring nodes that can communicate reliably with node ; is a constant step size; is a constant for each iteration. We assume that initial conditions of the SODCTS algorithm are , where is initial time offset for node . It is worth mentioning that when , the SODCTS algorithm reduces to the FODCTS algorithm.
2.2. Network Model and Some Preliminaries
In the following, we model a wireless sensor network as a graph , consisting of a set of nodes and a set of edges . Each edge is denoted as where and are head and tail of the edge , respectively. In a wireless sensor network, the presence of an edge indicates that node can communicate with node reliably. We assume here a connected graph; that is, there exists a directed path connecting any pair of distinct nodes in the network. Throughout our discussion, we assume a timeinvariant and connected network unless otherwise stated.
Then, the indegree and outdegree of a node (denoted as and , resp.,) are given as , and Specifically, is also equal to the number of neighbors of node from which it can receive information reliably, that is, .
Next, we let be the graph Laplacian matrix of which is defined as , where is the degree matrix of . Given this matrix , we can show that , where , and . In particular, for a connected graph, the rank of is . Furthermore, for a balanced directed network, the indegree and outdegree of a node are equal, that is, , thus we see that .
For an undirected network, the presence of an edge indicates that nodes and can communicate with each other reliably. Under this condition, we can also show that . Additionally, in this case, is a symmetric positive semidefinite matrix (implying that its eigenvalues are nonnegative), and its eigenvalues can be arranged in increasing order as [14].
with the initial conditions , where . Here, denotes the identity matrix.
3. Convergence Properties of The SoDcts Algorithm
In this section, we investigate the consensus properties of the SODCTS algorithm in directed and undirected networks. Additionally, we discuss the convergence rate of the SODCTS algorithm in such networks.
3.1. Consensus Analysis of The SoDcts Algorithm
The main result regarding the average consensus property of the SODCTS algorithm in directed networks is stated in the following theorem.
Theorem 1.
where denotes the spectral radius of a matrix.
Proof.
This completes the proof.
According to Theorem 1, we see that in general, although average consensus is not achieved for directed networks, all nodes in the network can still reach a global agreement. By "average consensus" we mean that all nodes converge to the same timing which is determined by the average of the initial timing differences between the nodes. However, when the SODCTS algorithm is employed in either an undirected network or a balanced directed network, average consensus can be achieved asymptotically. We show this via the following theorem.
Theorem 2.
We know that in a timeinvariant, connected, directed balanced or undirected network, and . The rest of proof is similar to that of Theorem 1 and thus omitted here.
3.2. Convergence Rate for SoDcts Algorithm
One of the most important measures of any distributed iterative algorithm is its convergence speed. As we show next, the convergence speed of the SODCTS algorithm is determined by the spectral radius of , which is similar to the FODCTS algorithm [17].
Given this dynamic of the disagreement vector, we note the following Lemma.
Lemma 1.
where denotes the norm of a vector.
Proof.
which is equivalent to (16). This completes the proof.
Therefore, we see that the convergence rate for the SODCTS algorithm in both directed and undirected networks is determined by the spectral radius of .
4. Convergence Region and Optimal Convergence Rate for SoDcts Algorithm in Undirected Networks
In this section, we investigate more specific convergence results (i.e., the convergence region and optimal convergence rate) for the SODCTS algorithm in undirected networks. Without loss of generality, we assume that and are real values, and .
4.1. Convergence Region for SoDcts Algorithm in Undirected Networks
where , and .
4.2. Optimal Convergence Rate for SoDcts Algorithm in Undirected Networks
As we show next, the convergence rate of the SODCTS algorithm can be superior to that of the FODCTS algorithm by choosing suitable and . However, as stated in the following lemma, the convergence rate of the FODCTS algorithm is faster under some circumstances.
Lemma 2.
For the SODCTS algorithm in (4) in a timeinvariant, connected, undirected network with initial conditions and in (20), if , the convergence rate of the SODCTS algorithm is less than that of the FODCTS algorithm with the optimal constant step size in (21).
The proof of this lemma is omitted here since it can be readily extended from the following result. Consider two real values and with , then . Thus, we have , which implies .
We see that and only when . Thus, we have the following theorem for the convergence rate of the SODCTS algorithm.
Theorem 3.
For the SODCTS algorithm in (4) in a timeinvariant, connected, undirected network with initial conditions and in (20), there exists a pair of and such that the convergence rate of the SODCTS algorithm is greater than or equal to that of the FODCTS algorithm with the optimal constant step size in (21).
5. SoDcts Algorithm with Gaussian Delay in Undirected Networks
In this section, we investigate the convergence properties of the SODCTS algorithm in undirected networks when there is both deterministic and random (Gaussian) delay between network nodes during local time information exchange. In [19], we motivate why the Gaussian assumption is appropriate to model the undeterministic timing differences between nodes exchanging either MAC layer or physical layer timing information. We do not reiterate those arguments here but rather present convergence results for the SODCTS algorithm when such timing differences exist. We have separately examined the performance of the SODCTS algorithm considering alternate delay distributions, for example, exponential delay distribution [20]. Results show similar performance bounds as those presented in this paper for the Gaussian assumption. For this reason, we constrain our discussion here to the more common Gaussian delay model.
where .
We now define and , where . Then, the noise vector in (28) is given as .
Recall that for undirected networks, the average value in each iteration is . Thus, the mean and variance of the average value are given in the following lemma.
Lemma 3.
The proof of this lemma is straightforward and thus omitted from this paper. It can be seen that as iteration time increases, both mean and variance in (30) increase linearly with the time index , that is, as the algorithm evolves. Furthermore, the variance of increases linearly with the variance of the random Gaussian delay, . As we will see in our numerical results, although the average value grows linearly with iteration time when there is Gaussian delay in the network, an average consensus may still be achievable under certain network topologies.
5.1. Expectation and Second Central Moment of Error Vector
In order to understand the convergence property of SODCTS algorithm with Gaussian delay, we first quantify the overall impact of uncertainty by computing the first two moments of the disagreement vector.
where and . Then, we have the following lemma.
Lemma 4.
where
The proof of this lemma is straightforward and thus omitted from this paper.
Given these definitions, we next note Lemma 5.
Lemma 5.
The proof of this lemma is similar to [19] and thus omitted from the paper.
5.2. Asymptotic Expectation of Global Synchronization Error
The above equation holds because . Before we investigate the convergence property of SODCTS algorithm with Gaussian delay, we give the following lemma for block matrix inversion.
lemma 5.4.
For this , we can show the following theorem.
Theorem 4.
In an undirected network with fixed connected topology, in (39) is a constant vector independent of the constant values of and .
Proof.
Therefore, does not depend on and . This completes the proof.
Hence, the maximum asymptotic expectation of the global synchronization error between any two nodes is Then, we have the following definition.
Definition 1.
A connected network is called "average consensus achievable with tolerable synchronization error" if the maximum asymptotic expectation of the global time synchronization error is less than a predefined threshold when applying the SODCTS algorithm in (28), that is, when .
Similar to [19], we have Definition 2.
Definition 2.
or equivalently, .
5.3. Asymptotic Mean Square Time Synchronization Error
6. Simulation Results
In the following simulation results, we assume that the initial time offset of node is , where microseconds unless otherwise stated (trends similar to the ones noted below were observed when initial time offsets between nodes were arbitrary (e.g., when they were uniformly distributed over [0,T]). We use this fixed offset assumption here for comparison purposes).
6.1. Structured Networks
In our simulations, we examine the convergence performance of the FODCTS and SODCTS algorithms for several structured, undirected networks. Specifically, we study the following network topologies.
Definition 3.
"A Ring Network with Equal Distance ": A ring network is a network that consists of a single cycle. The ring network with equal distance is a ring network that has nodes, edges, and for and .
Definition 4.
"A Path Network with Equal Distance ": A path network is a network that consists of edge set . The path network with equal distance is a path network that has nodes, edges and for and .
Definition 5.
"A Star Network with Equal Distance ": A star network is a network that consists of edge set . The star network with equal distance is a star network that has nodes, edges, and for and .
Optimal Convergence Rate
Numerical results comparing convergence rates of FODCTS and SODCTS algorithms in , , .


 

FODCTS Alg.  0.9267  0.0762  0.9808  0.0194  0.8824  0.1252 
SODCTS Alg.  0.8634  0.1469  0.9623  0.0384  0.7895  0.2364 
Convergence Properties of SoDcts Algorithm with Gaussian Delay
In our simulations of the SODCTS algorithm with Gaussian delay, we assume microseconds and the optimal values of and from (24). The simulation results and the asymptotic mean square time synchronization errors for the , , and networks are shown in Figure 5. For each network topology, the asymptotic mean square time synchronization error is calculated from (48). It can be seen that as time index increases, mean square time synchronization error approaches the steadystate value when utilizing SODCTS algorithm with Gaussian delay. Additionally, we see that the SODCTS algorithm performs poorest in a path network where it has the largest value of and the slowest convergence speed. This is not surprising since in such networks information flow from node 1 to node requires hops.
Table 2 summarizes the asymptotic results of the SODCTS algorithm for structured networks. As expected, the maximum asymptotic expectation of global time synchronization error for is 0 since is a time delay balanced network. Furthermore, the SODCTS algorithm in has the largest because of its highly unbalanced time delay structure. It is worth mentioning that the SODCTS algorithm in star networks has relatively small values of and . In fact, the SODCTS algorithm for a star network can be seen as a type of centralized time synchronization algorithm in which a root node determines and propagates the average of local time information of all other nodes in the network.
Asymptotic results for the SODCTS algorithm in structured networks with Gaussian delay.


 

 0  35  8.75 
 305.8075  13329  84.2996 
6.2. Random Networks
7. Conclusions
In this paper, we propose a novel discretetime SODCTS algorithm to address the global timing synchronization problem in wireless sensor networks. We analyze several important convergence characteristics of the SODCTS algorithm for directed and undirected networks. Additionally, we investigate the convergence region and optimal convergence rate of the SODCTS algorithm in undirected networks and claim that the optimal convergence rate of the SODCTS algorithm is superior to that of the FODCTS algorithm under an appropriate algorithm design. Furthermore, we investigate the asymptotic expectation and mean square synchronization error of the SODCTS algorithm when there is Gaussian delay between network nodes. In the future, we intend to investigate the effects of skew, link failure, and other practical conditions when utilizing the SODCTS algorithm in wireless sensor networks.
Appendices
A. Convergence Region for SoDcts Algorithm in Undirected Networks
Now, we examine the convergence region for the SODCTS algorithm based on conditions , and .
Case 1.
In the following, we assume that unless otherwise stated.
Case 2.
Here, and . Thus, we only need to examine the convergence region for . In order to satisfy the conditions, we have
By taking the union of in (A.5) and in (A.10) and considering the increasing order of , the convergence region for the SODCTS algorithm in (20) is obtained.
B. Solution for Minimization Problem
Combining (B.3) with (B.4), we get (24).
Declarations
Acknowledgment
This work was supported in part by research grants from Thales Communications, Inc., Md, USA, and the National Science Foundation.
Authors’ Affiliations
References
 Culler D, Estrin D, Srivastava M: Overview of sensor networks. Computer 2004, 37(8):4149.View ArticleGoogle Scholar
 Ganeriwal S, Kumar R, Srivastava MB: Timingsync protocol for sensor networks. Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03), November 2003, Los Angeles, Calif, USA 138149.View ArticleGoogle Scholar
 Elson J, Girod L, Estrin D: Finegrained network time synchronization using reference broadcasts. Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI '02), December 2002, Boston, Mass, USA 147163.View ArticleGoogle Scholar
 Maróti M, Kusy B, Simon G, Lédeczi Á: The flooding time synchronization protocol. Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (SenSys '04), November 2004, Baltimore, Md, USA 3949.View ArticleGoogle Scholar
 Sivrikaya F, Yener B: Time synchronization in sensor networks: a survey. IEEE Network 2004, 18(4):4550. 10.1109/MNET.2004.1316761View ArticleGoogle Scholar
 Giridhar A, Kumar PR: Distributed clock synchronization over wireless networks: algorithms and analysis. Proceedings of the 45th IEEE Conference on Decision and Control (CDC '06), December 2006, San Diego, Calif, USA 49154920.View ArticleGoogle Scholar
 OlfatiSaber R, Fax JA, Murray RM: Consensus and cooperation in networked multiagent systems. Proceedings of the IEEE 2007, 95(1):215233.View ArticleGoogle Scholar
 Schenato L, Gamba G: A distributed consensus protocol for clock synchronization in wireless sensor network. Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07), December 2007, New Orleans, La, USA 22892294.Google Scholar
 Simeone O, Spagnolini U: Distributed time synchronization in wireless sensor networks with coupled discretetime oscillators. EURASIP Journal on Wireless Communications and Networking 2007, 2007:13.Google Scholar
 Tanner HG, Jadbabaie A, Pappas GJ: Flocking in fixed and switching networks. IEEE Transactions on Automatic Control 2007, 52(5):863868.MathSciNetView ArticleGoogle Scholar
 Ren W, Atkins E: Secondorder consensus protocols in multiple vehicle systems with local interactions. Proceedings of the AIAA Guidance, Navigation, and Control Conference (GN&C '05), August 2005, San Francisco, Calif, USA 36893701.Google Scholar
 Lin P, Jia Y, Du J, Yuan S: Distributed consensus control for secondorder agents with fixed topology and timedelay. Proceedings of the 26th Chinese Control Conference (CCC '07), JulyJune 2007, Zhangjiajie, China 577581.Google Scholar
 Ren W: Secondorder consensus algorithm with extensions to switching topologies and reference models. Proceedings of the American Control Conference (ACC '07), July 2007, New York, NY, USA 14311436.Google Scholar
 Horn RA, Johnson CR: Matrix Analysis. Cambridge University Press, Cambridge, UK; 1985.MATHView ArticleGoogle Scholar
 Xiao L, Boyd S: Fast linear iterations for distributed averaging. Proceedings of the 42nd IEEE Conference on Decision and Control, December 2003, Maui, Hawaii, USA 5: 49975002.Google Scholar
 Meyer CD: Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA; 2001.Google Scholar
 OlfatiSaber R, Murray RM: Consensus problems in networks of agents with switching topology and timedelays. IEEE Transactions on Automatic Control 2004, 49(9):15201533. 10.1109/TAC.2004.834113MathSciNetView ArticleGoogle Scholar
 Kar S, Moura JMF: Topology for global average consensus. Proceedings of the 40th Asilomar Conference on Signals, Systems and Computers (ACSSC '06), OctoberNovember 2006, Pacific Grove, Calif, USA 276280.Google Scholar
 Xiong G, Kishore S: Analysis of distributed consensus time synchronization with Gaussian delay over wireless sensor networks. submitted to EURASIP Journal on Wireless Communications and NetworkingGoogle Scholar
 AbdelGhaffar HS: Analysis of synchronization algorithms with timeout control over networks with exponentially symmetric delays. IEEE Transactions on Communications 2002, 50(10):16521661. 10.1109/TCOMM.2002.803979View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.