Distributed Clock Synchronization over Wireless Networks: Algorithms and Analysis
- 1 January 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4915-4920
- https://doi.org/10.1109/cdc.2006.377325
Abstract
We analyze the spatial smoothing algorithm of Solis, Borkar and Kumar (2005) for clock synchronization over multi-hop wireless networks. In particular, for a model of a random wireless network we show that with high probability the error variance is O(1) as the number of nodes in the network increases. This provides support for the feasibility of time-based computing n large wireless networks. We also provide bounds on the settling time of a distributed algorithmKeywords
This publication has 10 references indexed in Scilit:
- Object Tracking by Scattered Directional SensorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Distributed Clock Synchronization over Wireless Networks: Algorithms and AnalysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Theory of resistor networks: the two-point resistanceJournal of Physics A: General Physics, 2004
- Simple, accurate time synchronization for wireless sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- On geographic routing without location informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Timing-sync Protocol for Sensor NetworksPublished by Defense Technical Information Center (DTIC) ,2003
- Wireless sensor networks for habitat monitoringPublished by Association for Computing Machinery (ACM) ,2002
- Fine-grained network time synchronization using reference broadcastsPublished by Association for Computing Machinery (ACM) ,2002
- Matrix Analysis and Applied Linear AlgebraPublished by Society for Industrial & Applied Mathematics (SIAM) ,2000
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991