This paper addresses a security problem in robotic multi–agent systems, where agents are supposed to cooperate according to a shared protocol. A distributed Intrusion Detection System (IDS) is proposed here, that detects possible non–cooperative agents. Previous work by the authors showed how single monitors embedded on–board the agents can detect non– cooperative behavior, using only locally available information. In this paper, we allow such monitors to share the collected information in order to overcome their sensing limitation. In this perspective, we show how an agreement on the type of behavior of a target–robot may be reached by the monitors, through execution of a suitable consensus algorithm. After formulating a consensus problem over non–scalar quantities, and with a generic update function, we provide conditions for the consensus convergence and an upper bound to its transient duration. Effectiveness of the proposed solution is finally shown through simulation of a case study.
Fagiolini, A., Pellinacci, M., Valenti, G., Dini, G., Bicchi, A. (2008). Consensus-based Distributed Intrusion Detection for Secure Multi-Robot Systems. In Proceedings of IEEE Conference on Robotics and Automation (pp. 120-127) [10.1109/ROBOT.2008.4543196].
Consensus-based Distributed Intrusion Detection for Secure Multi-Robot Systems
FAGIOLINI, Adriano;
2008-01-01
Abstract
This paper addresses a security problem in robotic multi–agent systems, where agents are supposed to cooperate according to a shared protocol. A distributed Intrusion Detection System (IDS) is proposed here, that detects possible non–cooperative agents. Previous work by the authors showed how single monitors embedded on–board the agents can detect non– cooperative behavior, using only locally available information. In this paper, we allow such monitors to share the collected information in order to overcome their sensing limitation. In this perspective, we show how an agreement on the type of behavior of a target–robot may be reached by the monitors, through execution of a suitable consensus algorithm. After formulating a consensus problem over non–scalar quantities, and with a generic update function, we provide conditions for the consensus convergence and an upper bound to its transient duration. Effectiveness of the proposed solution is finally shown through simulation of a case study.File | Dimensione | Formato | |
---|---|---|---|
04543196.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
593.18 kB
Formato
Adobe PDF
|
593.18 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.