Stochastic and deterministic fault detection for randomized gossip algorithms

Detalhes bibliográficos
Autor(a) principal: Silvestre, Daniel
Data de Publicação: 2017
Outros Autores: Rosa, P., Hespanha, J.P., Silvestre, C.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/11144/3425
Resumo: 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.
id RCAP_47216282d8b5d4e45d7025c3e8040bd6
oai_identifier_str oai:repositorio.ual.pt:11144/3425
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Stochastic and deterministic fault detection for randomized gossip algorithmsFault DetectionComputer NetworksDecentralizationEstimation TheoryRandomized MethodsLinear Parametrically Varying (LPV) methodologies.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.Elsevier2018-02-07T11:39:23Z2017-04-01T00:00:00Z2017-04info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/11144/3425eng0005-109810.1016/j.automatica.2016.12.011Silvestre, DanielRosa, P.Hespanha, J.P.Silvestre, C.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-08-01T02:04:12Zoai:repositorio.ual.pt:11144/3425Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-08-01T02:04:12Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Stochastic and deterministic fault detection for randomized gossip algorithms
title Stochastic and deterministic fault detection for randomized gossip algorithms
spellingShingle Stochastic and deterministic fault detection for randomized gossip algorithms
Silvestre, Daniel
Fault Detection
Computer Networks
Decentralization
Estimation Theory
Randomized Methods
Linear Parametrically Varying (LPV) methodologies.
title_short Stochastic and deterministic fault detection for randomized gossip algorithms
title_full Stochastic and deterministic fault detection for randomized gossip algorithms
title_fullStr Stochastic and deterministic fault detection for randomized gossip algorithms
title_full_unstemmed Stochastic and deterministic fault detection for randomized gossip algorithms
title_sort Stochastic and deterministic fault detection for randomized gossip algorithms
author Silvestre, Daniel
author_facet Silvestre, Daniel
Rosa, P.
Hespanha, J.P.
Silvestre, C.
author_role author
author2 Rosa, P.
Hespanha, J.P.
Silvestre, C.
author2_role author
author
author
dc.contributor.author.fl_str_mv Silvestre, Daniel
Rosa, P.
Hespanha, J.P.
Silvestre, C.
dc.subject.por.fl_str_mv Fault Detection
Computer Networks
Decentralization
Estimation Theory
Randomized Methods
Linear Parametrically Varying (LPV) methodologies.
topic Fault Detection
Computer Networks
Decentralization
Estimation Theory
Randomized Methods
Linear Parametrically Varying (LPV) methodologies.
description 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.
publishDate 2017
dc.date.none.fl_str_mv 2017-04-01T00:00:00Z
2017-04
2018-02-07T11:39:23Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/11144/3425
url http://hdl.handle.net/11144/3425
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0005-1098
10.1016/j.automatica.2016.12.011
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv mluisa.alvim@gmail.com
_version_ 1817546638134083584