Resilience Bounds of Network Clock Synchronization with Fault Correction

Author:

Jiang Linshan1,Tan Rui1ORCID,Easwaran Arvind1

Affiliation:

1. Nanyang Technological University, Singapore

Abstract

Naturally occurring disturbances and malicious attacks can lead to faults in synchronizing the clocks of two network nodes. In this article, we investigate the fundamental resilience bounds of network clock synchronization for a system of N nodes against the peer-to-peer synchronization faults. Our analysis is based on practical synchronization algorithms with time complexity down to O ( N 3 ) that attempt to correct the faults by checking the consistency among the following three types of data: (1) the estimated faults, (2) the estimated clock offsets among the nodes, and (3) the measured clock offsets from the potentially faulty peer-to-peer synchronization sessions. Our analysis gives the following three major results. First, the maximum number of faults that can be corrected by the algorithms has a tight bound of ⌊ N /2 ⌋ − 1 when every node pair performs a synchronization session. Second, by converting the fault resilience problem to a graph-theoretic edge connectivity problem and applying Menger’s theorem, we develop an algorithm to compute the tight bound when not every node pair performs a synchronization session. Third, the number of synchronization sessions to achieve the capability of correcting any K faults has a lower bound of ⌈ N (2 K +1) / 2 ⌉ ; we also develop an algorithm to schedule the synchronization sessions to approach the lower bound. The above results provide basic understanding and useful guidelines to the design of resilient clock synchronization systems. For instance, our results suggest that, the four-node network achieves the highest degree of resilience that is defined as the ratio of the maximum number of correctable faults to the number of synchronization sessions. Therefore, by organizing a large-scale clock synchronization system into a hierarchy of multiple tiers with each consisting of four-node synchronization groups, we can achieve satisfactory and understood resilience against faults with reduced synchronization sessions.

Funder

National Research Foundation (NRF), Singapore under the Corp Lab @ University Scheme

NTU Start-up Grant

Delta-NTU Corporate Laboratory for Cyber-Physical Systems

Delta Electronics Inc.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Resilient Consensus via Weight Learning and Its Application in Fault-Tolerant Clock Synchronization;IEEE Transactions on Control of Network Systems;2023-12

2. PCube: Scaling LoRa Concurrent Transmissions with Reception Diversities;ACM Transactions on Sensor Networks;2022-11-30

3. PCube;Proceedings of the 27th Annual International Conference on Mobile Computing and Networking;2021-10-19

4. Clustering-Based Data Collection Using Concurrent Transmission in Wireless Sensor Network;2021 9th International Conference on Communications and Broadband Networking;2021-02-25

5. Willingness to quit alcohol use and its associated factors among male outpatients attending urban primary health centers in Delhi;Journal of Education and Health Promotion;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3