An algorithm for WSN clock synchronization: Uncertainty and convergence rate trade off
06 Jul 2009-pp 74-79
TL;DR: A synchronization algorithm based on a linear controller is used to dynamically compensate both mutual offsets and drifts of the clock associated with the nodes of a WSN, which explicitly takes into account the inter-node communication latencies.
Abstract: -Achieving tight time synchronization between wireless sensor network (WSN) nodes is essential to coordinate the activities of different devices. In this paper, a synchronization algorithm based on a linear controller is used to dynamically compensate both mutual offsets and drifts of the clock associated with the nodes of a WSN. This approach, compared with other existing solutions based on control theory, explicitly takes into account the inter-node communication latencies. Furthermore, it presents on optimal (fastest convergence) controller in the case of full visibility among nodes. In the case of noise in both the clock measurements and the clock drifts, a controller that reduces the noise effect on the synchronization accuracy is also proposed and compared to the optimal one. In all cases, the correct operation of the algorithm has been proved through simulations.
Citations
More filters
TL;DR: The node availability and WSN availability are formulated with the assumption that the information arrival is a Poisson process and the age-based replacement model is applied to obtain the optimal reallocation interval with lowest long run expected cost rate.
Abstract: A wireless sensor network is applied for detecting information, by nodes, then generates and transfers the packets to the clustering head for further transmission. In practice, due to the influence of environmental factors, traffic loads of nodes and barrier, a node may fail to detect the information which occurs within its sensing area. Thus, the redundant deployment is often conducted. There are some frequent questions need to be considered when deploying the WSN: (1) how many nodes are required for obtaining a confident coverage of the area; (2) how well does the WSN perform as time goes by, because it is an energy consumption technique; (3) when is the best opportunity to reallocate the nodes. To answer the above questions, we conduct this research. We use $$k$$
-out-of-
$$n$$
model to calculate the $$k$$
-coverage probability, which determines the minimal number of nodes that are needed to be deployed in the monitored area. We formulate the node availability and WSN availability with the assumption that the information arrival is a Poisson process. By applying the age-based replacement model, we obtain the optimal reallocation interval with lowest long run expected cost rate.
35 citations
17 Dec 2010
TL;DR: This paper considers a group as being a set of nodes sensing the same type of data and proposes an efficient secure group communication scheme that enables group management and secure group key distribution based on a logical ring architecture.
Abstract: It is worth noting that securing group communication in Wireless Sensor Networks (WSNs) has recently been extensively investigated. Although many works have addressed this problem, they have considered the concept of grouping differently. In this paper, we consider a group as being a set of nodes sensing the same type of data and we alternatively propose an efficient secure group communication scheme that enables group management and secure group key distribution. The proposed scheme is based on a logical ring architecture, which permits to alleviate the task of the group controller in maintaining the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack and gives solution to detect and eliminate the compromised nodes. Finally, our implementation shows that the proposed scheme is highly efficient and secure.
12 citations
TL;DR: This paper aims to study the reliability of a data flow in event-driven wireless sensor networks with multiple sending transmission approach without acknowledgments, and analyzes the network reliability, the wireless link reliability and the node energy availability.
Abstract: Reliability analysis is an important issue in wireless sensor networks (WSNs). This paper aims to study the reliability of a data flow in event-driven wireless sensor networks with multiple sending transmission approach without acknowledgments. Initially, an event-driven wireless sensor network model is described in terms of limited node battery energy and shadowed fading channels. Then, in order to analyze the network reliability, the wireless link reliability and the node energy availability are investigated, respectively. Furthermore, the analytical expressions of the instantaneous network reliability and the mean time to failure (MTTF) are derived. Finally, the simulation results validate the correctness and accuracy of the analytical results.
6 citations
Cites background from "An algorithm for WSN clock synchron..."
...cn 1National Mobile Communications Research Laboratory, Southeast University, Nanjing 211111, China Full list of author information is available at the end of the article In the past few years, intensive researches for WSNs have been conducted in many aspects, such as localization [5], synchronization [6,7], deployment [8], and communication protocol [9]....
[...]
12 Dec 2011
TL;DR: The design, implementation and evaluation of a trustful infrastructure for the Internet of Things (IoT) based on EPOS Mote is described, which features an ARM processor and an IEEE 802.15.4 radio transceiver.
Abstract: This article describes the design, implementation and evaluation of a trustful infrastructure for the Internet of Things (IoT) based on EPOS Mote The infrastructure was built around EPOS' second generation of motes, which features an ARM processor and an IEEE 802154 radio transceiver It is presented to end users through a trustful communication protocol stack compatible with TCP/IP Trustfulness was tackled at MAC level by extending C-MAC, EPOS native MAC protocol, with Advanced Encryption Standard (AES) capabilities that were subsequently used to encrypt and authenticate packets containing IP data grams Our authentication mechanism encompasses temporal information to protect the network against replay attacks The infrastructure was designed bearing in mind the severe resource limitation typical of IoT devices The prototype implementation was assessed for processing, memory, and energy consumption and strongly confirmed our assumptions
5 citations
Cites background from "An algorithm for WSN clock synchron..."
...When an activity is removed, its inputs are forwarded to the activity targeted by its outputs, still maintaining the original flow semantics....
[...]
03 May 2010
TL;DR: A new synchronization procedure based on a distributed Proportional Integral (PI) consensus controller is described, designed to avoid the election of any fixed time reference node, thus potentially improving the robustness of the whole synchronization procedure.
Abstract: Time synchronization of Wireless Sensor Network (WSN) nodes is essential in those applications requiring distributed task scheduling or data aggregation and fusion. In this paper, a new synchronization procedure based on a distributed Proportional Integral (PI) consensus controller is described. Compared to other similar solutions, the proposed approach keeps into account the effect of random communication and processing delays and it is expected to have lower communication overhead. Also, it is designed to avoid the election of any fixed time reference node, thus potentially improving the robustness of the whole synchronization procedure. Some simulation results show that the procedure works correctly even in different network traffic conditions.
5 citations
Cites background from "An algorithm for WSN clock synchron..."
..., 1] , a variety of solutions exists which trade convergence speed for noise robustness [14]....
[...]
References
More filters
09 Dec 2002
TL;DR: Reference Broadcast Synchronization (RBS) as discussed by the authors is a scheme in which nodes send reference beacons to their neighbors using physical-layer broadcasts, and receivers use their arrival time as a point of reference for comparing their clocks.
Abstract: Recent advances in miniaturization and low-cost, low-power design have led to active research in large-scale networks of small, wireless, low-power sensors and actuators. Time synchronization is critical in sensor networks for diverse purposes including sensor data fusion, coordinated actuation, and power-efficient duty cycling. Though the clock accuracy and precision requirements are often stricter than in traditional distributed systems, strict energy constraints limit the resources available to meet these goals.We present Reference-Broadcast Synchronization, a scheme in which nodes send reference beacons to their neighbors using physical-layer broadcasts. A reference broadcast does not contain an explicit timestamp; instead, receivers use its arrival time as a point of reference for comparing their clocks. In this paper, we use measurements from two wireless implementations to show that removing the sender's nondeterminism from the critical path in this way produces high-precision clock agreement (1.85 ± 1.28μsec, using off-the-shelf 802.11 wireless Ethernet), while using minimal energy. We also describe a novel algorithm that uses this same broadcast property to federate clocks across broadcast domains with a slow decay in precision (3.68 ± 2.57μsec after 4 hops). RBS can be used without external references, forming a precise relative timescale, or can maintain microsecond-level synchronization to an external timescale such as UTC. We show a significant improvement over the Network Time Protocol (NTP) under similar conditions.
2,537 citations
03 Nov 2004
TL;DR: The FTSP achieves its robustness by utilizing periodic flooding of synchronization messages, and implicit dynamic topology update and comprehensive error compensation including clock skew estimation, which is markedly better than that of the existing RBS and TPSN algorithms.
Abstract: Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper describes the Flooding Time Synchronization Protocol (FTSP), especially tailored for applications requiring stringent precision on resource limited wireless platforms. The proposed time synchronization protocol uses low communication bandwidth and it is robust against node and link failures. The FTSP achieves its robustness by utilizing periodic flooding of synchronization messages, and implicit dynamic topology update. The unique high precision performance is reached by utilizing MAC-layer time-stamping and comprehensive error compensation including clock skew estimation. The sources of delays and uncertainties in message transmission are analyzed in detail and techniques are presented to mitigate their effects. The FTSP was implemented on the Berkeley Mica2 platform and evaluated in a 60-node, multi-hop setup. The average per-hop synchronization error was in the one microsecond range, which is markedly better than that of the existing RBS and TPSN algorithms.
2,267 citations
Book•
01 Jan 1987
TL;DR: Discrete-time control systems, Discrete- time control systems , مرکز فناوری اطلاعات و ا�ل squares رسانی, کسورزی.
Abstract: Discrete-time control systems , Discrete-time control systems , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی
2,098 citations
"An algorithm for WSN clock synchron..." refers background in this paper
...Such a discrete time system, dubbed as dead beat in control literature, reaches the desired value after two steps, since the closed loop system is of the second order [12]....
[...]
01 Jul 2000
TL;DR: In this paper, the authors introduce the concept of hybrid systems and some of the challenges associated with the stability of such systems, including the issues of guaranteeing stability of switched stable systems and finding conditions for the existence of switched controllers for stabilizing switched unstable systems.
Abstract: This paper introduces the concept of a hybrid system and some of the challenges associated with the stability of such systems, including the issues of guaranteeing stability of switched stable systems and finding conditions for the existence of switched controllers for stabilizing switched unstable systems. In this endeavour, this paper surveys the major results in the (Lyapunov) stability of finite-dimensional hybrid systems and then discusses the stronger, more specialized results of switched linear (stable and unstable) systems. A section detailing how some of the results can be formulated as linear matrix inequalities is given. Stability analyses on the regulation of the angle of attack of an aircraft and on the PI control of a vehicle with an automatic transmission are given. Other examples are included to illustrate various results in this paper.
1,647 citations
"An algorithm for WSN clock synchron..." refers background or methods in this paper
...In general, the performance of a switching system may be so severely lowered that even stability may be destroyed, although each compounding closed loop system is asymptotically stable [11]....
[...]
...In this way, referred to as an average dwell time approach in switching system literature [11], the rate of γk changes is lowered down to ensure global stability....
[...]
27 Sep 2004
TL;DR: A protocol is provided in this standard that enables precise synchronization of clocks in measurement and control systems implemented with technologies such as network communication, local computing, and distributed objects.
Abstract: A protocol is provided in this standard that enables precise synchronization of clocks in measurement and control systems implemented with technologies such as network communication, local computing, and distributed objects. The protocol is applicable to systems communicating via packet networks. Heterogeneous systems are enabled that include clocks of various inherent precision, resolution, and stability to synchronize. System-wide synchronization accuracy and precision in the sub-microsecond range are supported with minimal network and local clock computing resources. Simple systems are installed and operated without requiring the management attention of users because the default behavior of the protocol allows for it.
1,428 citations