Resilient Asymptotic Consensus in Robust Networks

@article{LeBlanc2013ResilientAC,
  title={Resilient Asymptotic Consensus in Robust Networks},
  author={Heath J. LeBlanc and Haotian Zhang and Xenofon D. Koutsoukos and Shreyas Sundaram},
  journal={IEEE Journal on Selected Areas in Communications},
  year={2013},
  volume={31},
  pages={766-781}
}
This paper addresses the problem of resilient in-network consensus in the presence of misbehaving nodes. Secure and fault-tolerant consensus algorithms typically assume knowledge of nonlocal information; however, this assumption is not suitable for large-scale dynamic networks. To remedy this, we focus on local strategies that provide resilience to faults and compromised nodes. We design a consensus protocol based on local information that is resilient to worst-case security breaches, assuming… 

Figures from this paper

Resilient asymptotic consensus in asynchronous robust networks
TLDR
The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes and is robust, which is an important property for analyzing the behavior of resilient distributed algorithms that use only local information.
Improving Network Connectivity and Robustness Using Trusted Nodes With Application to Resilient Consensus
TLDR
This paper extends two fundamental metrics of structural robustness with the notion of trusted nodes, network connectivity, and $r$-robustness, and shows that any desired connectivity and robustness can be achieved without adding extra links.
Resilient consensus protocol in the presence of trusted nodes
TLDR
In this paper, a scheme for a resilient distributed consensus problem through a set of trusted nodes within the network is proposed to guarantee distributed consensus despite any number of adversarial attacks, even in sparse networks.
Resilient distributed consensus for tree topology
TLDR
This paper proposes a Range-based Adversary Resilient Consensus Protocol (R.ARC-P), which operates on the tree topology, it distinguishes between trustworthiness of nodes in the immediate neighborhood, and it uses a valid value range in order to reduce the number of nodes considered as outliers.
Formally verified asymptotic consensus in robust networks
TLDR
This paper formalizes and mechanically check a consensus algorithm widely used in the distributed controls community: the Weighted-Mean Subsequence Reduced (W-MSR) algorithm proposed by Le Blanc et al, which is the first mechanical proof of an asymptotic consensus algorithm.
Resilient Vector Consensus: An Event-based Approach
TLDR
An Event-based Safe Kernel protocol is developed in this paper, which increases the network resilience while saves its communication costs and provides sufficient topological conditions for E-SK to guarantee the resilient consensus while reducing the unnecessary communications.
Resilient Consensus of Discrete-Time Complex Cyber-Physical Networks Under Deception Attacks
TLDR
This article considers the resilient consensus problems of discrete-time complex cyber-physical networks under $F$-local deception attacks and generalizes the notion of network robustness and presents the necessary and sufficient condition for the achievement of resilient consensus in the presence of trusted edges.
Resilient consensus for time-varying networks of dynamic agents
TLDR
This paper proposes an approach that provides resilience for networks of dynamic agents whose communication graphs are time-varying and shows that in the case where the required connectivity constraints cannot be satisfied at all times, it can resort to a consensus protocol that guarantees resilience.
Secure Consensus with Distributed Detection via Two-hop Communication
...
...

References

SHOWING 1-10 OF 61 REFERENCES
Consensus of multi-agent networks in the presence of adversaries using only local information
TLDR
This paper provides necessary and sufficient conditions for the normal nodes to reach consensus despite the influence of the malicious nodes under different threat assumptions, stated in terms of a novel graph-theoretic property referred to as network robustness.
Network Robustness: Diffusing Information Despite Adversaries
TLDR
This report introduces a topological property termed as network robustness and shows that this concept, together with its variants, is the key property to characterize the behavior of a class of resilient algorithms that use purely local information.
Robustness of information diffusion algorithms to locally bounded adversaries
TLDR
A topological property known as r-robustness of a graph is introduced, and this property provides improved bounds on tolerating malicious behavior, in comparison to traditional concepts such as connectivity and minimum degree.
Consensus Computation in Unreliable Networks: A System Theoretic Approach
TLDR
This paper characterize the set of inputs that allow misbehaving agents to affect the consensus network while remaining undetected and/or unidentified from certain observing agents, and designs three algorithms to detect and identify misbehave agents.
Low complexity resilient consensus in networked multi-agent systems with adversaries
TLDR
This paper defines the adversarial asymptotic agreement problem, which requires that the uncompromised agents asymPTotically align their states while satisfying an invariant condition in the presence of adversaries, and designs a low complexity consensus protocol, the Adversarial Robust Consensus Protocol (ARC-P), which combines ideas from distributed computing and cooperative control.
Low complexity resilient consensus in networked multi-agent systems with adversaries
TLDR
This paper defines the adversarial asymptotic agreement problem, which requires that the uncompromised agents asymPTotically align their states while satisfying an invariant condition in the presence of adversaries, and designs a low complexity consensus protocol, the Adversarial Robust Consensus Protocol (ARC-P), which combines ideas from distributed computing and cooperative control.
Resilient network coding in the presence of Byzantine adversaries
  • S. Jaggi, M. Langberg, M. Effros
  • Computer Science
    IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
  • 2007
TLDR
This paper introduces the first distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes, and presents algorithms that target adversaries with different attacking capabilities.
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
TLDR
The topology of the network completely characterizes the resilience of linear iterative strategies to this kind of malicious behavior and it is shown that node xi is guaranteed to be able to calculate any arbitrary function of all node values when the number of malicious nodes is f or less.
Consensus in networked multi-agent systems with adversaries
TLDR
The Adversarially Robust Consensus Protocol (ARC-P) is presented, which combines ideas from consensus algorithms that are resilient to Byzantine faults and from linear consensus protocols used for control and coordination of dynamic agents and solves the consensus problem in complete networks whenever there are more cooperative agents than adversaries.
Gossip-based computation of aggregate information
  • D. Kempe, A. Dobra, J. Gehrke
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
TLDR
This paper analyzes the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms, and shows that this diffusion speed is at the heart of the approximation guarantees for all of the above problems.
...
...