Skip to main content
Article thumbnail
Location of Repository

Fundamental Limits on Synchronization of Affine Clocks in Networks ∗

By Nikolaos M. Freris and P. R. Kumar

Abstract

We present some impossibility as well as feasibility results on clock synchronization in wireline or wireless networks. We consider a network of n nodes with affine clocks, where one node is taken as a reference, and each other node’s clock is described by a skew (relative speedup with respect to the reference clock), and an offset (say) at time 0 with respect to the reference clock. In order to establish impossibility results, we allow for noiseless communication of messages that may contain any information that the transmitting node knows about current or past packets that the node has sent or received. The synchronization problem consists of estimating all the unknown parameters, skews and offsets of all the clocks, as well as the delays of all the communication links

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8646
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://black.csl.uiuc.edu/~prk... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.