.png){kind=icon}
.png){kind=icon}
Return
A Discrete-Time Reputation-Based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2023.3266982.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We tackle the problem of a set of agents achieving resilient consensus in the presence of attacked agents. We present a discrete-time reputation-based 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: 1) the proposed method converges exponentially to the consensus of the regular agents; 2) if a regular agent identifies a neighbor as an attacked node, then it is indeed an attacked node; 3) if the consensus value of the normal nodes differs from that of any of the attacked nodes' values, then the reputation that a regular agent assigns to the attacked neighbors goes to zero. Further, we extend our method to achieve resilience in scenarios where there are noisy nodes, dynamic networks, and stochastic node selection. Finally, we illustrate our algorithm with several examples, delineating some attacks that can be dealt with by the current proposal but not by the state-of-the-art approaches.
Keywords:
Consensus algorithm
Heuristic algorithms
Fault tolerant systems
Fault tolerance
Computational complexity
Steady-state
Network topology
Agents and autonomous systems
computer networks
fault tolerant systems
reputation systems
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W