Characterising failures and attacks in average consensus
by Gabriele Oliva; Stefano Panzieri; Attilio Priolo; Giovanni Ulivi
International Journal of Systems, Control and Communications (IJSCC), Vol. 6, No. 1, 2014

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.

Online publication date: Sat, 26-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com