Finite-Time Consensus-Based Clock Synchronization Under Deception Attacks

Wu, Yiming; He, Xiongxiong

doi:10.1109/access.2020.3002577

Cited by 10 publications

(4 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A node identity-based algorithm is proposed called NiSTS by Wang et al in [10] for message manipulation attack detection and elimination. Consensus clock synchronization for WSNs under deception attacks has been analyzed recently [11]. However, many state-of-the-art CTS algorithms [12][13][14][15][16] are not yet studied and analyzed under security threats.…”

Section: Related Workmentioning

confidence: 99%

Security Threat Analysis and Countermeasures on Consensus-Based Time Synchronization Algorithms for Wireless Sensor Network

Jha

Gupta

Panigrahi³

2021

SN COMPUT. SCI.

View full text Add to dashboard Cite

Time synchronization is an indispensable and fundamental requirement for all types of wireless sensor networks (WSNs) protocols and applications. The consistency and correctness of other protocols like localization, routing, etc., are highly dependent on time synchronization. However, due to the hostile deployment of wireless sensor networks, they are prone to cyber-physical attacks that create different threats to time synchronization protocols as well. Recently, consensus-based time synchronization (CTS) algorithms are gaining popularity due to their distributed nature and robustness toward different types of threats such as denial-of-service and node destruction. But, the inherent properties of the consensus-based approach of making in-network averaging make these algorithms vulnerable to message manipulation attacks. In this paper, an in-depth simulation-based analysis is conducted using pymote, a python-based discrete event simulator for WSN, on state-of-the-art CTS algorithms in the presence of message manipulation attacks. A novel and generic algorithm, Message Manipulation Attack Resilient CTS (MMAR-CTS) is proposed embedding which the state-of-the-art algorithms are extensively evaluated based on standard performance metrics, e.g., convergence speed, global synchronization error, and local synchronization error in the presence of the attack, and sufficient observations are derived to show the behavior of these algorithms. The comparison of protocols is validated with simulation results. Simulation results show that MMAR-CTS embedded SATS algorithm is 75% more efficient as compared to other candidate algorithms, measured in terms of convergence speed (number of iterations) and nearly 40% improvement in global and local synchronization error.

show abstract

Section: Related Workmentioning

confidence: 99%

Security Threat Analysis and Countermeasures on Consensus-Based Time Synchronization Algorithms for Wireless Sensor Network

Jha

Gupta

Panigrahi³

2021

SN COMPUT. SCI.

View full text Add to dashboard Cite

show abstract

“…These nodes will be protected from attack at all times so that resilient consensus can be achieved under milder connectivity. A similar edge-oriented version is examined in [19], where trusted links are proposed to improve network robustness and achieve convergence in finite time. Another effort along this line is to endow agents with diverse vulnerabilities or weaknesses [20], where a malicious agent can only attack a particular type of weakness, and hence consensus may be achieved in a relatively sparse network.…”

Section: Introductionmentioning

confidence: 99%

Resilient Consensus for Robust Multiplex Networks with Asymmetric Confidence Intervals

Shang

2021

IEEE Trans. Netw. Sci. Eng.

View full text Add to dashboard Cite

The consensus problem with asymmetric confidence intervals considered in this paper is characterized by the fact that each agent can have optimistic and/or pessimistic interactions with its neighbors. To deal with the asymmetric confidence scenarios, we introduce a novel multiplex network presentation for directed graphs and its associated connectivity concepts including the pseudo-strongly connectivity and graph robustness, which provide a resilience characterization in the presence of malicious nodes. We develop distributed resilient consensus strategies for a group of dynamical agents with locally bounded Byzantine agents in both continuous-time and discrete-time multi-agent systems. Drawing on our multiplex network framework, much milder connectivity conditions compared to existing works are proposed to ensure resilient consensus. The results are further extended to cope with resilient scaled consensus problems which allow both cooperative and antagonistic agreements among agents. Numerical examples are also exhibited to confirm the theoretical results and reveal the factors that affect the speed of convergence in our multiplex network framework.

show abstract

“…In some applications, it is desired that the cooperative tasks be completed in a finite time. Compared with asymptotic consensus, finite-time consensus has such advantages as anti-disturbance (Li et al, 2019; Pei, 2020) and better robustness (Wu and He, 2020). Given this, some researchers turned their attention to the finite-time consensus of MASs, where consensus was reached within limited time.…”

Section: Introductionmentioning

confidence: 99%

Fixed-time consensus of first-order multi-agent systems over signed directed graphs

Wang

Feng

2021

Transactions of the Institute of Measurement and Control

View full text Add to dashboard Cite

This paper studies the fixed-time consensus problems of first-order multi-agent systems over signed directed graphs. Fixed-time consensus protocols are designed for first-order multi-agent systems without/with disturbances and first-order nonlinear multi-agent systems with disturbances, respectively. With proposed protocols, it is proved that multi-agent systems with strongly connected topologies will achieve consensus in a fixed time if the control parameters satisfy certain conditions. Finally, simulation examples are provided to verify the effectiveness of the theoretical results.

show abstract

Finite-Time Consensus-Based Clock Synchronization Under Deception Attacks

Cited by 10 publications

References 39 publications

Security Threat Analysis and Countermeasures on Consensus-Based Time Synchronization Algorithms for Wireless Sensor Network

Security Threat Analysis and Countermeasures on Consensus-Based Time Synchronization Algorithms for Wireless Sensor Network

Resilient Consensus for Robust Multiplex Networks with Asymmetric Confidence Intervals

Fixed-time consensus of first-order multi-agent systems over signed directed graphs

Contact Info

Product

Resources

About