Distributed clock synchronization for wireless sensor networks using belief propagation

In this paper, we study the global clock synchronization problem for wireless sensor networks. Based on belief propagation, we propose a fully distributed algorithm which has low overhead and can achieve scalable synchronization. It is also shown analytically that the proposed algorithm always converges for strongly connected networks. Simulation results show that the proposed algorithm achieves better accuracy than consensus algorithms. Furthermore, the belief obtained at each sensor provides an accurate prediction on the algorithm's performance in terms of MSE. © 2011 IEEE.published_or_final_versio

Adaptive Synchronization of Robotic Sensor Networks

The main focus of recent time synchronization research is developing power-efficient synchronization methods that meet pre-defined accuracy requirements. However, an aspect that has been often overlooked is the high dynamics of the network topology due to the mobility of the nodes. Employing existing flooding-based and peer-to-peer synchronization methods, are networked robots still be able to adapt themselves and self-adjust their logical clocks under mobile network dynamics? In this paper, we present the application and the evaluation of the existing synchronization methods on robotic sensor networks. We show through simulations that Adaptive Value Tracking synchronization is robust and efficient under mobility. Hence, deducing the time synchronization problem in robotic sensor networks into a dynamic value searching problem is preferable to existing synchronization methods in the literature.Comment: First International Workshop on Robotic Sensor Networks part of Cyber-Physical Systems Week, Berlin, Germany, 14 April 201

Fully-distributed joint clock synchronization and ranging in wireless sensor networks under exponential delays

In this paper, we study the global clock synchro- nization and ranging problem for wireless sensor networks in the presence of unknown exponential delays using the two- way message exchange mechanism. Based on the Alternating Direction Method of Multipliers (ADMM), we propose a fully- distributed synchronization and ranging algorithm which has low communication overhead and computation cost. Simulation results show that the proposed algorithm achieves better accuracy than consensus algorithm, and can always converge to the centralized optimal solution.published_or_final_versio

Synchronization of multihop wireless sensor networks at the application layer

Time synchronization is a key issue in wireless sensor networks; timestamping collected data, tasks scheduling, and efficient communications are just some applications. From all the existing techniques to achieve synchronization, those based on precisely time-stamping sync messages are the most accurate. However, working with standard protocols such as Bluetooth or ZigBee usually prevents the user from accessing lower layers and consequently reduces accuracy. A receiver-to-receiver schema improves timestamping performance because it eliminates the largest non-deterministic error at the sender’s side: the medium access time. Nevertheless, utilization of existing methods in multihop networks is not feasible since the amount of extra traffic required is excessive. In this article, we present a method that allows accurate synchronization of large multihop networks, working at the application layer while keeping the message exchange to a minimum. Through an extensive experimental study, we evaluate the protocol’s performance and discuss the factors that influence synchronization accuracy the most.Ministerio de Ciencia y Tecnología TIN2006-15617-C0