Corpus ID: 235694724

A Discrete-time Reputation-based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications

@article{Ramos2021ADR,
  title={A Discrete-time Reputation-based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications},
  author={Guilherme Ramos and Daniel Silvestre and Carlos Silvestre},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.00431}
}
We tackle the problem of a set of agents achieving resilient consensus in the presence of attacked agents. We present a discrete-time reputationbased consensus algorithm for synchronous and asynchronous networks by developing a local strategy where, at each time, each agent assigns a reputation (between zero and one) to each neighbor. The reputation is then used to weigh the neighbors’ values in the update of its state. Under mild assumptions, we show that: (i) the proposed method converges… Expand

References

SHOWING 1-10 OF 41 REFERENCES
A general discrete-time method to achieve resilience in consensus algorithms
TLDR
A generalized method is devised, with polynomial time complexity, which receives as input a discrete-time, synchronous-communication consensus algorithm, a dynamic network of agents, and the maximum number of attacked nodes, and enables each normal node to detect and discard the values of the attacked agents while reaching the consensus of normal agents for the input consensus algorithm. Expand
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. Expand
Average consensus and gossip algorithms in networks with stochastic asymmetric communications
TLDR
This work considers that a set of distributed agents desire to reach consensus on the average of their initial state values, while communicating with neighboring agents through a shared medium, and proposes a linear distributed algorithm based on a state augmentation technique that achieves average consensus in a stochastic sense. Expand
Consensus of second-order multi-agent systems in the presence of locally bounded faults
TLDR
Under the assumption that the network has sufficient connectivity in terms of robustness, this work develops a resilient algorithm where each agent ignores the neighbors which have large and small position values to avoid being influenced by malicious agents. Expand
Distributed resilient consensus: a non-parametric approach
TLDR
Two parameter-independent fault-tolerant consensus algorithms are proposed to address the consensus problem in the presence of misbehaving agents and it is shown that this algorithm converges if the network of non-faulty agents is (f+1)-robust, where f is the number of faulty agents in the network. Expand
Resilient randomized quantized consensus
TLDR
It will be shown that randomization is essential both in quantization and in the updating times when normal agents interact in an asynchronous manner. Expand
Attack Resilient Distributed Estimation: A Consensus+Innovations Approach
TLDR
The algorithm achieves the same level of resilience as the most resilient centralized estimator – if less than half of the agents' sensors are under attack, then all agents correctly estimate the parameter of interest, regardless of the topology of the inter-agent communication network. Expand
Finite-time average consensus in a Byzantine environment using Set-Valued Observers
TLDR
A novel algorithm is proposed that achieves finite-time consensus, even if the aforementioned requirement is dropped, by intersecting the set-valued state estimates of neighboring nodes, making it suitable for practical applications and enabling nodes to determine a stopping time. Expand
Distributed Averaging Using Periodic Gossiping
TLDR
The main contributions of this paper are first to characterize the classes of periodic gossip sequences which have the same convergence rate and second to prove that if the graph of allowable gossips is a tree with each edge restricted to gossiping once per period, the convergence rate is quite surprisingly, fixed and invariant over all possible periodic gossip sequence the graph allows. Expand
Stochastic and deterministic fault detection for randomized gossip algorithms
TLDR
This paper addresses the problem of detecting faults in linear randomized gossip algorithms, where the selection of the dynamics matrix is stochastic and the use of Set-Valued Observers (SVOs) is proposed to detect if the state observations are compatible with the system dynamics for the worst case in a deterministic setting. Expand
...
1
2
3
4
5
...