The greater availability and accessibility of IoT sensors, data acquisition systems and computer networks, led to the development of distributed control strategies aimed at monitoring and securing of Cyber-Physical Systems (CPS). In this paper, we propose a distributed asynchronous algorithm for the Secure State Reconstruction (SSR) which relies on a gossip-based procedure to let a network of agents reach a shared estimate of the process state based on measurements taken by the different agents at different time instants. In particular, the procedure aims to reduce measurement noise and provide resilience in the event of cyber attacks that modify the readings of agents or cause their disconnection, combined with the possibility of providing new virtual measurements in real-time. In addition, the gossip-based pair connection is randomly established and subsequently destroyed, making it difficult for an attacker to intercept the information exchange. In detail, we first analytically demonstrate the convergence and correctness of the proposed algorithm, and then we provide a simulation campaign to demonstrate its effectiveness.

Distributed and Asynchronous Secure State Reconstruction for Cyber-Physical Systems

Fioravanti, C;Oliva, G;
2022-01-01

Abstract

The greater availability and accessibility of IoT sensors, data acquisition systems and computer networks, led to the development of distributed control strategies aimed at monitoring and securing of Cyber-Physical Systems (CPS). In this paper, we propose a distributed asynchronous algorithm for the Secure State Reconstruction (SSR) which relies on a gossip-based procedure to let a network of agents reach a shared estimate of the process state based on measurements taken by the different agents at different time instants. In particular, the procedure aims to reduce measurement noise and provide resilience in the event of cyber attacks that modify the readings of agents or cause their disconnection, combined with the possibility of providing new virtual measurements in real-time. In addition, the gossip-based pair connection is randomly established and subsequently destroyed, making it difficult for an attacker to intercept the information exchange. In detail, we first analytically demonstrate the convergence and correctness of the proposed algorithm, and then we provide a simulation campaign to demonstrate its effectiveness.
2022
978-1-6654-0673-4
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12610/73570
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact