Distributed timing synchronization for sensor networks with coupled discrete-time oscillators

Physical layer-based distributed timing synchronization among nodes of a wireless network is currently being investigated in the literature as an interesting alternative to packet synchronization. In this paper, we analyze the convergence properties of such a system through algebraic graph theory, by modelling the nodes as discrete-time oscillators and taking into account the specific features of wireless channels (e.g., reciprocity, fading). The analysis is corroborated by numerical results and by comparison with the performance of a practical implementation of the distributed synchronization algorithm over a bandlimited noisy channel