Distributed relative clock synchronization for wireless sensor networks

Publication Type:
Conference Proceeding
IFAC Proceedings Volumes (IFAC-PapersOnline), 2011, 44 (1 PART 1), pp. 11265 - 11270
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
1-s2.0-S1474667016454248-main.pdfPublished version305.68 kB
Adobe PDF
This paper considers an important problem in sensor networks, i.e. clock synchronization in wireless sensor networks with a focus on those scenarios where the inter-node time-of-arrival measurements are noisy. Initially, a simple convex, constraint based, optimization protocol for the problem of relative clock synchronization in wireless (sensor) networks is presented. Later, we provide a distributed discrete-time solution to the same problem and show exponential convergence. Then we provide a similar algorithm for achieving the same solution in continuous-time. Both the discrete-time algorithm and the continuous-time algorithm are distributed in that each node in the network requires very little information from its neighbours in the network. In the end, we provide a modification of the continuous time algorithm that achieves a finite-time convergence to the desired solution under some additional requirements. © 2011 IFAC.
Please use this identifier to cite or link to this item: