A cooperative timestamp-free clock synchronization scheme based on fast unscented Kalman filtering for time-sensitive networking

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
{"title":"A cooperative timestamp-free clock synchronization scheme based on fast unscented Kalman filtering for time-sensitive networking","authors":"","doi":"10.1016/j.comnet.2024.110711","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624005437","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

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.

基于快速无特征卡尔曼滤波的合作式无时间戳时钟同步方案,适用于时间敏感型网络
建立在经典双向信息交换方案基础上的时钟同步是时敏网络(TSN)正常运行的关键前提。在实际的 TSN 中,环境变化引起的振荡器不完善会导致时钟参数漂移。此外,多跳网络中的同步误差会不断累积,使得网络边缘的节点难以实现精确的同步性能。此外,在一些工业和车载场景中,时钟同步的能耗和复杂性也是需要考虑的重要因素。针对这些问题,本文提出了一种基于快速无cented 卡尔曼滤波器(FUKF)的协同同步时钟偏移和时钟偏移联合跟踪算法。为了进一步减少时钟同步带来的计算量和能耗,我们引入了随机奇异值分解和无时间戳交换。前者使用小的子矩阵近似来替代极高维矩阵,从而减少了英国卡尔曼滤波器更新阶段的计算时间。后者通过在接收端设置响应间隔来减少能耗,从而消除了同步过程中的时间戳交换需求。因此,该算法可以实现长期同步,而无需过多的计算和通信开销。结果表明,所提出的方法在保持精度不变的情况下,随着观测次数的增加,运行时间减少了 20% 至 90%,从而验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信