The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fundamental Limits on Synchronizing Clocks Over Networks
Abstract
We characterize what is feasible concerning clock synchronization in wireline or wireless networks. We consider a net work of n nodes, equipped with affine clocks relative to a designated clock that exchange packets subject to link delays. Determining all unknown parameters, i.e., skews and offsets of all the clocks as well as the delays of all the communication links, is impossible. All nodal skews, as well as all round-trip delays between every pair of nodes, can be determined correctly. Also, every transmitting node can predict precisely the time indicated by the receiver's clock at which it receives the packet. However, the vector of unknown link delays and clock offsets can only be determined up to an (n - 1)-dimensional subspace, with each degree of freedom corresponding to the offset of one of the (n - 1) clocks. Invoking causality, that packets cannot be received before they are transmitted, the uncertainty set can be reduced to a polyhedron. We also investigate structured models for link delays as the sum of a transmitter-dependent delay, a receiver-dependent delay, and a known propagation delay, and identify conditions which permit a unique solution, and conditions under which the number of the residual degrees of freedom is independent of the network size. For receiver-receiver synchronization, where only receipt times are available, but no time-stamping is done by the sender, all nodal skews can still be determined, but delay differences between neighboring communication links with a common sender can only be characterized up to an affine transformation of the (n - 1) un known offsets. Moreover, causality does not help reduce the uncertainty set.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Cited by
Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
He, J., Cheng, P., Shi, L., Chen, J., & Sun, Y. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2286893 · Cited by 306
A˚ström, K. J., & Kumar, P. R. (2014) · Automatica · doi:10.1016/j.automatica.2013.10.012 · Cited by 304
Self-citationBlockchain-based secure time protection scheme in IoT
Fan, K., Wang, S., Ren, Y., Yang, K., Yan, Z., Li, H., & Yang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2874222 · Cited by 78
Metadata
- Authors
- Freris, N. M., Graham, S. R., & Kumar, P. R.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-06
- Volume
- 56
- Issue
- 6
- Pages
- 1352-1364
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2105856476
- Cited by
- 212
- References
- 1
- FWCI
- 17.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.