Practical timing synchronization for network dynamics in large machine-to-machine networks

Abstract

Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in large-scale machine-to-machine (M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.