Synchronization service integrated into routing layer in wireless sensor networks

The time synchronization problem needs to be considered in a distributed system. In Wireless Sensor Networks (WSNs) this issue must be solved with limited computational, communication and energy resources. Many synchronization protocols exist for WSNs. However, in most cases these protocols are independent entities with specific packets, communication scheme and network hierarchy. This solution is not energy efficient. Because it is very rare for synchronization not to be necessary in WSNs, we advocate integrating the synchronization service into the routing layer. We have implemented this approach in a new synchronization protocol called Routing Integrated Synchronization Service (RISS). Our tests show that RISS is very time and energy efficient and also is characterized by a small overhead. We have compared its performance experimentally to that of the FTSP synchronization protocol and it has proved to offer better time precision than the latter protocol

Understanding the Global in Global Finance and Regulation

A simple and statistically robust method for passive clock synchronization in sensor networks is presented. The method is not limited to passive (one-way communication) synchronization, but this scenario justifies the method. The recursive nature of the method and the targeted passive setup mean that it adds a minimum of requirements on the system in which it is used. Statistical characteristics of the method are quantified and real measurements are used to illustrate the robustness and performance gain relative to a naive Kalman filter based clock synchronization. Finally, C++ code that implements the suggested clock synchronization method, is provided in this article.QC 20140423</p

Multiobjective synchronization of coupled systems

Copyright @ 2011 American Institute of PhysicsSynchronization of coupled chaotic systems has been a subject of great interest and importance, in theory but also various fields of application, such as secure communication and neuroscience. Recently, based on stability theory, synchronization of coupled chaotic systems by designing appropriate coupling has been widely investigated. However, almost all the available results have been focusing on ensuring the synchronization of coupled chaotic systems with as small coupling strengths as possible. In this contribution, we study multiobjective synchronization of coupled chaotic systems by considering two objectives in parallel, i. e., minimizing optimization of coupling strength and convergence speed. The coupling form and coupling strength are optimized by an improved multiobjective evolutionary approach. The constraints on the coupling form are also investigated by formulating the problem into a multiobjective constraint problem. We find that the proposed evolutionary method can outperform conventional adaptive strategy in several respects. The results presented in this paper can be extended into nonlinear time-series analysis, synchronization of complex networks and have various applications

Global synchronization algorithms for the Intel iPSC/860

In a distributed memory multicomputer that has no global clock, global processor synchronization can only be achieved through software. Global synchronization algorithms are used in tridiagonal systems solvers, CFD codes, sequence comparison algorithms, and sorting algorithms. They are also useful for event simulation, debugging, and for solving mutual exclusion problems. For the Intel iPSC/860 in particular, global synchronization can be used to ensure the most effective use of the communication network for operations such as the shift, where each processor in a one-dimensional array or ring concurrently sends a message to its right (or left) neighbor. Three global synchronization algorithms are considered for the iPSC/860: the gysnc() primitive provided by Intel, the PICL primitive sync0(), and a new recursive doubling synchronization (RDS) algorithm. The performance of these algorithms is compared to the performance predicted by communication models of both the long and forced message protocols. Measurements of the cost of shift operations preceded by global synchronization show that the RDS algorithm always synchronizes the nodes more precisely and costs only slightly more than the other two algorithms