Please use this identifier to cite or link to this item: http://hdl.handle.net/11144/3425
Title: Stochastic and deterministic fault detection for randomized gossip algorithms
Authors: Silvestre, Daniel
Rosa, P.
Hespanha, J.P.
Silvestre, C.
Keywords: Fault Detection
Computer Networks
Decentralization
Estimation Theory
Randomized Methods
Linear Parametrically Varying (LPV) methodologies.
Issue Date: Apr-2017
Publisher: Elsevier
Citation: Daniel Silvestre, Paulo Rosa, João P. Hespanha, Carlos Silvestre, Stochastic and deterministic fault detection for randomized gossip algorithms, Automatica, Volume 78, 2017, Pages 46-60, ISSN 0005-1098, https://doi.org/10.1016/j.automatica.2016.12.011.
Abstract: This paper addresses the problem of detecting faults in linear randomized gossip algorithms, where the selection of the dynamics matrix is stochastic. A fault is a disturbance signal injected by an attacker to corrupt the states of the nodes. We propose the use of Set-Valued Observers (SVOs) to detect if the state observations are compatible with the system dynamics for the worst case in a deterministic setting. The concept of Stochastic Set-Valued Observers (SSVOs) is also introduced to construct a set that is guaranteed to contain all possible states with, at least, a pre-specified desired probability. The proposed algorithm is stable in the sense that it requires a finite number of vertices to represent polytopic sets and it allows for the computation of the largest magnitude of the disturbance that an attacker can inject in the network without being detected. Results are presented to reduce the computational cost of this approach and, in particular, by considering only local information and representing the remainder of the network as a disturbance. The case of a consensus algorithm is discussed leading to the conclusion that, by using the proposed SVOs, finite-time consensus is achieved in non-faulty environments. A novel algorithm is proposed that produces less conservative set-valued state estimates by having nodes exchanging local estimates. The algorithm inherits all the previous properties and also enables finite-time consensus computation regardless of the value of the horizon.
Peer Reviewed: yes
URI: http://hdl.handle.net/11144/3425
metadata.dc.identifier.doi: 10.1016/j.automatica.2016.12.011
ISSN: 0005-1098
Appears in Collections:AUTONOMA TECHLAB - Artigos/Papers
DCT - Artigos/Papers

Files in This Item:
File Description SizeFormat 
ssvo_jrnl.pdf200,56 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.