Distributed relative clock synchronization for wireless sensor networks

4Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Shames, I., & Bishop, A. N. (2011). Distributed relative clock synchronization for wireless sensor networks. In IFAC Proceedings Volumes (IFAC-PapersOnline) (Vol. 44, pp. 11265–11270). IFAC Secretariat. https://doi.org/10.3182/20110828-6-IT-1002.03685

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free