Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , , , |
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/3421 |
Resumo: | We address the problem of a consensus system in the presence of Byzantine faults seen as an attacker injecting a perturbation in the state of the nodes. We propose the use of Set-Valued Observers to detect if the state observations are compatible with the system dynamics. The method is extended to the stochastic case by introducing a strategy 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 while also enabling the a priori computation of the largest magnitude of a disturbance that an attacker can inject without being detected. |
id |
RCAP_ede1ea6d5c2d4b78e465dd91f349dc87 |
---|---|
oai_identifier_str |
oai:repositorio.ual.pt:11144/3421 |
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 |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observersstochastic systemsdistributed algorithmsWe address the problem of a consensus system in the presence of Byzantine faults seen as an attacker injecting a perturbation in the state of the nodes. We propose the use of Set-Valued Observers to detect if the state observations are compatible with the system dynamics. The method is extended to the stochastic case by introducing a strategy 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 while also enabling the a priori computation of the largest magnitude of a disturbance that an attacker can inject without being detected.IEEE2018-02-07T10:33:24Z2013-12-01T00:00:00Z2013-12info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/11144/3421eng0191-221610.1109/CDC.2013.6760562Silvestre, DanielRosa, P.Cunha, R.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:07:49Zoai:repositorio.ual.pt:11144/3421Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-08-01T02:07:49Repositó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 |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
title |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
spellingShingle |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers Silvestre, Daniel stochastic systems distributed algorithms |
title_short |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
title_full |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
title_fullStr |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
title_full_unstemmed |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
title_sort |
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers |
author |
Silvestre, Daniel |
author_facet |
Silvestre, Daniel Rosa, P. Cunha, R. Hespanha, J.P. Silvestre, C. |
author_role |
author |
author2 |
Rosa, P. Cunha, R. Hespanha, J.P. Silvestre, C. |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Silvestre, Daniel Rosa, P. Cunha, R. Hespanha, J.P. Silvestre, C. |
dc.subject.por.fl_str_mv |
stochastic systems distributed algorithms |
topic |
stochastic systems distributed algorithms |
description |
We address the problem of a consensus system in the presence of Byzantine faults seen as an attacker injecting a perturbation in the state of the nodes. We propose the use of Set-Valued Observers to detect if the state observations are compatible with the system dynamics. The method is extended to the stochastic case by introducing a strategy 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 while also enabling the a priori computation of the largest magnitude of a disturbance that an attacker can inject without being detected. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-12-01T00:00:00Z 2013-12 2018-02-07T10:33:24Z |
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/3421 |
url |
http://hdl.handle.net/11144/3421 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0191-2216 10.1109/CDC.2013.6760562 |
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 |
IEEE |
publisher.none.fl_str_mv |
IEEE |
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_ |
1817546655454461952 |