Abstract

Clock synchronization, built on the classical two-way message exchange scheme, is the key prerequisite for the normal operation of time-sensitive networking (TSN). In practical TSN, the imperfect oscillator caused by environmental changes leads to clock parameters drift. Moreover, synchronization errors accumulate in multi-hop networks, making it difficult for nodes at the edge of the network to achieve precise synchronization performance. Additionally, in some industrial and vehicular scenarios, the energy consumption and complexity of clock synchronization are important factors that need to be considered. To address these problems, this paper proposes a cooperative synchronization clock offset and clock skew joint tracking algorithm based on fast Unscented Kalman filter (FUKF). To further reduce the computation and energy consumption caused by clock synchronization, we introduce randomized singular value decomposition and timestamp-free exchange. The former uses small sub-matrices approximations to replace extremely high-dimensional matrices, reducing computational time in the update stage of the UKF. The latter reduces energy consumption by setting response intervals at the receiving end, eliminating the need for timestamp exchange during the synchronization process. Therefore, this algorithm can achieve long-term synchronization without requiring excessive computational and communication overhead. The results show that the proposed method, while maintaining accuracy unchanged, reduced the running time by 20% to 90% as the number of observations increased, thus verifying the effectiveness of the algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.