Distributed Clock Synchronization over Wireless Networks: Algorithms and Analysis
Arvind Giridhar, Praveen Kumar · 2006
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.