Distributed relative clock synchronization for wireless sensor networks

Iman Shames*, Adrian N. Bishop

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Citations (Scopus)

    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.

    Original languageEnglish
    Title of host publicationProceedings of the 18th IFAC World Congress
    PublisherIFAC Secretariat
    Pages11265-11270
    Number of pages6
    Edition1 PART 1
    ISBN (Print)9783902661937
    DOIs
    Publication statusPublished - 2011

    Publication series

    NameIFAC Proceedings Volumes (IFAC-PapersOnline)
    Number1 PART 1
    Volume44
    ISSN (Print)1474-6670

    Fingerprint

    Dive into the research topics of 'Distributed relative clock synchronization for wireless sensor networks'. Together they form a unique fingerprint.

    Cite this