Distributed clock synchronization over wireless networks: Algorithms and analysis
A Giridhar, PR Kumar - … of the 45th IEEE Conference on …, 2006 - ieeexplore.ieee.org
A Giridhar, PR Kumar
Proceedings of the 45th IEEE Conference on Decision and Control, 2006•ieeexplore.ieee.orgWe 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.
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.
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果