Distributed Clock Synchronization over Wireless Networks: Algorithms and Analysis
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
We analyze the spatial smoothing algorithm of Solis, Borkar and Kumar [1] 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 algorithm. 2006 IEEE.
name of conference
Proceedings of the 45th IEEE Conference on Decision and Control