Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

Characterising failures and attacks in average consensus

Characterising failures and attacks in average consensus Consensus algorithms turned out to be effective methodologies in all those situations involving a distributed merging of information such as the collaborative estimation performed by a set of agents. This method, however, is not able to cope with node disruptions, and requires the agents to continue to communicate until an agreement is reached. In some cases, such an assumption may not be verified, e.g., due to the disruption of some nodes. Moreover, the unwanted presence of some additional nodes may compromise the estimate. In this paper, the effect of removing nodes during the consensus protocol with respect to the time instant of disconnection is addressed. Moreover, the case of spurious or malicious nodes connected to the network with the aim to interfere with the consensus is also considered. Simulations to corroborate the theoretical findings are provided. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Systems, Control and Communications Inderscience Publishers

Loading next page...
 
/lp/inderscience-publishers/characterising-failures-and-attacks-in-average-consensus-LTcpJ0jEma

References (19)

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1755-9340
eISSN
1755-9359
DOI
10.1504/IJSCC.2014.062798
Publisher site
See Article on Publisher Site

Abstract

Consensus algorithms turned out to be effective methodologies in all those situations involving a distributed merging of information such as the collaborative estimation performed by a set of agents. This method, however, is not able to cope with node disruptions, and requires the agents to continue to communicate until an agreement is reached. In some cases, such an assumption may not be verified, e.g., due to the disruption of some nodes. Moreover, the unwanted presence of some additional nodes may compromise the estimate. In this paper, the effect of removing nodes during the consensus protocol with respect to the time instant of disconnection is addressed. Moreover, the case of spurious or malicious nodes connected to the network with the aim to interfere with the consensus is also considered. Simulations to corroborate the theoretical findings are provided.

Journal

International Journal of Systems, Control and CommunicationsInderscience Publishers

Published: Jan 1, 2014

There are no references for this article.