Visible to the public Resilient consensus protocol in the presence of trusted nodesConflict Detection Enabled

TitleResilient consensus protocol in the presence of trusted nodes
Publication TypeConference Paper
Year of Publication2014
AuthorsWaseem Abbas, Yevgeniy Vorobeychik, Xenofon Koutsoukos
Conference Name7th International Symposium on Resilient Control Systems (ISRCS)
Date PublishedAug
Conference LocationDenver, CO
Keywordsadversarial attacks, adversary, Buildings, connected dominating set, consensus, dominating set, graph robustness, network theory (graphs), Network topology, nonlocal information access, Protocols, resilience, resilient consensus protocol, resilient distributed consensus problem, Robustness, Topology, Tree graphs, trusted nodes notion, Vanderbilt

In this paper, we propose a scheme for a resilient distributed consensus problem through a set of trusted nodes within the network. Currently, algorithms that solve resilient consensus problem demand networks to have high connectivity to overrule the effects of adversaries, or require nodes to have access to some non-local information. In our scheme, we incorporate the notion of trusted nodes to guarantee distributed consensus despite any number of adversarial attacks, even in sparse networks. A subset of nodes, which are more secured against the attacks, constitute a set of trusted nodes. It is shown that the network becomes resilient against any number of attacks whenever the set of trusted nodes form a connected dominating set within the network. We also study a relationship between trusted nodes and the network robustness. Simulations are presented to illustrate and compare our scheme with the existing ones.

Citation Key6900100