Reputation-based Resilient Distributed Algorithms
Autor(a) principal: | |
---|---|
Data de Publicação: | 2019 |
Tipo de documento: | Artigo de conferência |
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/4365 |
Resumo: | In this talk, the problem of designing distributed algorithms is presented and discussed its main challenges. Setting the task of having a distributed algorithm in a multi-agent system to achieve consensus of a variable of interest, we present a discrete-time reputation-based consensus algorithm that eliminates attacked agents' information for the case of a static topology and synchronous communication. Using only local information, agents can compute a reputation for each of its neighbors and assess the relative quality of the received data prior to the update. We show that, for each time step, the proposed method has quadratic complexity on the number of neighbors of each agent. Finally, we illustrate our method with several examples, portraying some attacking schemes successfully dealt by our method that succeed against the state-of-the-art. |
id |
RCAP_ff469d5cf6b494bbb753eaca269b6468 |
---|---|
oai_identifier_str |
oai:repositorio.ual.pt:11144/4365 |
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 |
Reputation-based Resilient Distributed AlgorithmsReputationResilienceDistributed AlgorithmsIn this talk, the problem of designing distributed algorithms is presented and discussed its main challenges. Setting the task of having a distributed algorithm in a multi-agent system to achieve consensus of a variable of interest, we present a discrete-time reputation-based consensus algorithm that eliminates attacked agents' information for the case of a static topology and synchronous communication. Using only local information, agents can compute a reputation for each of its neighbors and assess the relative quality of the received data prior to the update. We show that, for each time step, the proposed method has quadratic complexity on the number of neighbors of each agent. Finally, we illustrate our method with several examples, portraying some attacking schemes successfully dealt by our method that succeed against the state-of-the-art.2019-10-28T10:44:01Z2019-10-01T00:00:00Z2019-10info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectapplication/pdfhttp://hdl.handle.net/11144/4365engSilvestre, Danielinfo: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-01-11T02:18:22Zoai:repositorio.ual.pt:11144/4365Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:33:36.333917Repositó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 |
Reputation-based Resilient Distributed Algorithms |
title |
Reputation-based Resilient Distributed Algorithms |
spellingShingle |
Reputation-based Resilient Distributed Algorithms Silvestre, Daniel Reputation Resilience Distributed Algorithms |
title_short |
Reputation-based Resilient Distributed Algorithms |
title_full |
Reputation-based Resilient Distributed Algorithms |
title_fullStr |
Reputation-based Resilient Distributed Algorithms |
title_full_unstemmed |
Reputation-based Resilient Distributed Algorithms |
title_sort |
Reputation-based Resilient Distributed Algorithms |
author |
Silvestre, Daniel |
author_facet |
Silvestre, Daniel |
author_role |
author |
dc.contributor.author.fl_str_mv |
Silvestre, Daniel |
dc.subject.por.fl_str_mv |
Reputation Resilience Distributed Algorithms |
topic |
Reputation Resilience Distributed Algorithms |
description |
In this talk, the problem of designing distributed algorithms is presented and discussed its main challenges. Setting the task of having a distributed algorithm in a multi-agent system to achieve consensus of a variable of interest, we present a discrete-time reputation-based consensus algorithm that eliminates attacked agents' information for the case of a static topology and synchronous communication. Using only local information, agents can compute a reputation for each of its neighbors and assess the relative quality of the received data prior to the update. We show that, for each time step, the proposed method has quadratic complexity on the number of neighbors of each agent. Finally, we illustrate our method with several examples, portraying some attacking schemes successfully dealt by our method that succeed against the state-of-the-art. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019-10-28T10:44:01Z 2019-10-01T00:00:00Z 2019-10 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11144/4365 |
url |
http://hdl.handle.net/11144/4365 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
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.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 |
|
_version_ |
1799136814543405056 |