Simple, accurate time synchronization for wireless sensor networks
Abstract
Time synchronization is important for any distributed system. In particular, wireless sensor networks make extensive use of synchronized time in many contexts (e.g. for data fusion, TDMA schedules, synchronized sleep periods, etc.). Existing time synchronization methods were not designed with wireless sensors in mind, and need to be extended or redesigned. Our solution centers around the development of a deterministic time synchronization method relevant for wireless sensor networks. The proposed solution features minimal complexity in network bandwidth, storage and processing and can achieve good accuracy. Highly relevant for sensor networks, it also provides tight, deterministic bounds on both the offsets and clock drifts. A method to synchronize the entire network in preparation for data fusion is presented. A real implementation of a wireless ad-hoc network is used to evaluate the performance of the proposed approach.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Native time synchronization methods supported by these protocols cannot satisfy the required high sampling rate of common bioelectric systems.
“However, the native time synchronization methods supported by these protocols cannot satisfy the required high sampling rate of common bioelectric systems [22].”
From Comparison between Two Time Synchronization and Data Alignment Methods for Multi-Channel Wearable Biosensor Systems Using BLE Protocol (2023) · cites this paper as [22]
Cited by
Sorted by citations
Wang, H., Li, J., McDonald, B. E., Farrell, T. R., Huang, X., & Clancy, E. A. (2023) · Sensors · doi:10.3390/s23052465 · Cited by 18 · see citing works
Collection and curation of a large reference dataset for activity recognition
Calatroni, A., Roggen, D., & Troster, G. (2011) · 2011 IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2011.6083638 · Cited by 13 · see citing works
- Authors
- Sichitiu, M. L., & Veerarittiphan, C.
- Affiliations
- North Carolina State University (US)
- ORCID
- Sichitiu, M.L.
- Venue
- 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003.
- Publisher
- IEEE
- Published
- 2004-01-24
- Volume
- 2
- Pages
- 1266-1273
- ISSN
- 1525-3511 (ISSN-L)
- OpenAlex
- W2122690764
- Cited by
- 490
- References
- 0
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 4 · 2023: 9 · 2022: 8 · 2021: 10 · 2020: 15 · 2019: 9 · 2018: 13 · 2017: 17 · 2016: 19 · 2015: 22 · 2014: 41 · 2013: 27 · 2012: 24
- FWCI
- 17.41
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Wireless Communications and Networking Conference (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Time Synchronization Technologies
- Physical Sciences › Computer Science › Computer Networks and Communications › Energy Efficient Wireless Sensor Networks
- Social Sciences › Sociology and Political Science › Multimedia Communication and Technology
- Keywords
- clock synchronization, wireless sensor networks, clock drift, data fusion, TDMA scheduling, ad hoc networks, synchronization accuracy
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