The design of a dynamic allocator is proposed to tackle the presence of undetectable attacks in cyber-physical systems. Generating invisible signals that are capable to maintain the control inputs proximal to the saturation limits, the attacks are naturally discovered due to constraint violation. Two different design schemes are proposed: the first one is a direct allocation method based on a simple linear programming algorithm, while the second one is a dynamic optimization problem with a barrier function. The case-study of a consensus network illustrates the applicability and the efficacy of the proposed policy.

A saturated dynamic input allocation policy for preventing undetectable attacks in cyber-physical systems

Cristofaro, A.;Corradini, M. L.
2018-01-01

Abstract

The design of a dynamic allocator is proposed to tackle the presence of undetectable attacks in cyber-physical systems. Generating invisible signals that are capable to maintain the control inputs proximal to the saturation limits, the attacks are naturally discovered due to constraint violation. Two different design schemes are proposed: the first one is a direct allocation method based on a simple linear programming algorithm, while the second one is a dynamic optimization problem with a barrier function. The case-study of a consensus network illustrates the applicability and the efficacy of the proposed policy.
2018
978-3-9524-2698-2
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/11581/431674
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact