A general discrete-time method to achieve resilience in consensus algorithms
In this paper, we approach the problem of a set of network agents reaching resilient consensus in the presence of a subset of attacked nodes. We devise a generalized method, with polynomial time complexity, which receives as input a discrete-time, synchronous-communication consensus algorithm, a dyn...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/11144/4658 |
| Country: | Portugal |
| Oai: | oai:repositorio.ual.pt:11144/4658 |