Clock synchronization and estimation in highly dynamic networks: An information theoretic approach

Ofer Feinerman, Amos Korman

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

Abstract

We consider the External Clock Synchronization problem in dynamic sensor networks. Initially, sensors obtain inaccurate estimations of an external time reference and subsequently collaborate in order to synchronize their internal clocks with the external time. For simplicity, we adopt the drift-free assumption, where internal clocks are assumed to tick at the same pace. Hence, the problem is reduced to an estimation problem, in which the sensors need to estimate the initial external time. In this context of distributed estimation, this work is further relevant to the problem of collective approximation of environmental values by biological groups. Unlike most works on clock synchronization that assume static networks, this paper focuses on an extreme case of highly dynamic networks. We do however impose a restriction on the dynamicity of the network. Specifically, we assume a non-adaptive scheduler adversary that dictates an arbitrary, yet independent, meeting pattern. Such meeting patterns fit, for example, with short-time scenarios in highly dynamic settings, where each sensor interacts with only few other arbitrary sensors. We propose an extremely simple clock synchronization (or an estimation) algorithm that is based on weighted averages, and prove that its performance on any given independent meeting pattern is highly competitive with that of the best possible algorithm, which operates without any resource or computational restrictions, and further knows the whole meeting pattern in advance. In particular, when all distributions involved are Gaussian, the performances of our scheme coincide with the optimal performances. Our proofs rely on an extensive use of the concept of Fisher information. We use the Cramér-Rao bound and our definition of a Fisher Channel Capacity to quantify information flows and to obtain lower bounds on collective performance. This opens the door for further rigorous quantifications of information flows within collaborative sensors.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings
EditorsChristian Scheideler
PublisherSpringer Verlag
Pages16-30
Number of pages15
ISBN (Print)9783319252575
DOIs
StatePublished - 2015
Externally publishedYes
Event22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 - Montserrat, Spain
Duration: 14 Jul 201516 Jul 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9439
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015
Country/TerritorySpain
CityMontserrat
Period14/07/1516/07/15

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2015.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Clock synchronization and estimation in highly dynamic networks: An information theoretic approach'. Together they form a unique fingerprint.

Cite this