Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Asynchronous Approximate Byzantine Consensus: A Multi-hop Relay Method and Tight Graph Conditions (2403.07640v1)

Published 12 Mar 2024 in cs.MA, cs.SY, and eess.SY

Abstract: We study a multi-agent resilient consensus problem, where some agents are of the Byzantine type and try to prevent the normal ones from reaching consensus. In our setting, normal agents communicate with each other asynchronously over multi-hop relay channels with delays. To solve this asynchronous Byzantine consensus problem, we develop the multi-hop weighted mean subsequence reduced (MW-MSR) algorithm. The main contribution is that we characterize a tight graph condition for our algorithm to achieve Byzantine consensus, which is expressed in the novel notion of strictly robust graphs. We show that the multi-hop communication is effective for enhancing the network's resilience against Byzantine agents. As a result, we also obtain novel conditions for resilient consensus under the malicious attack model, which are tighter than those known in the literature. Furthermore, the proposed algorithm can be viewed as a generalization of the conventional flooding-based algorithms, with less computational complexity. Lastly, we provide numerical examples to show the effectiveness of the proposed algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Improving network connectivity and robustness using trusted nodes with application to resilient consensus, IEEE Trans. Control Netw. Syst. 5(4): 2036–2048.
  2. Optimal resilience asynchronous approximate agreement, in Proc. International Conference On Principles Of Distributed Systems, pp. 229–239.
  3. Asynchronous approximate agreement in partially connected networks, Int. J. Parallel Distrib. Syst. Netw. 5(1): 26–34.
  4. Approximate agreement under mobile Byzantine faults, Theoretical Computer Science 758: 17–29.
  5. Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms, Princeton University Press.
  6. A probabilistic characterization of random and malicious communication failures in multi-hop networked control, SIAM Journal on Control and Optimization 56(5): 3320–3350.
  7. Consensus of second-order multi-agent systems in the presence of locally bounded faults, Syst. Control Lett. 79: 23–29.
  8. Resilient consensus of second-order agent networks: Asynchronous update rules with delays, Automatica 81: 123–132.
  9. Resilient randomized quantized consensus, IEEE Trans. Autom. Control 63(8): 2508–2522.
  10. Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control, Automatica 46(4): 695–700.
  11. Ding, M. (2021). An analysis of multi-hop iterative approximate Byzantine consensus with local communication, in Proc. IEEE Symposium on Computers and Communications, pp. 1–6.
  12. Resilient stabilization of multi-hop control networks subject to malicious attacks, Automatica 71: 1–9.
  13. Dolev, D. (1982). The Byzantine generals strike again, Journal of algorithms 3(1): 14–30.
  14. Reaching approximate agreement in the presence of faults, J. ACM 33(3): 499–516.
  15. Impossibility of distributed consensus with one faulty process, J. ACM 32(2): 374–382.
  16. Goldsmith, A. (2005). Wireless Communications, Cambridge University Press.
  17. Multi-hop relay protocols for fast consensus seeking, in Proc. IEEE Conf. Dec. Control, pp. 1001–1006.
  18. Event-based distributed clock synchronization for wireless sensor networks, IEEE Trans. Autom. Control 60(8): 2266–2271.
  19. Resilient asymptotic consensus in robust networks, IEEE J. Sel. Areas Commun. 31(4): 766–781.
  20. Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies, Automatica 45(9): 2154–2158.
  21. Distributed secure state estimation for linear systems against malicious agents through sorting and filtering, Automatica 151: 110927.
  22. Lynch, N. A. (1996). Distributed Algorithms, Morgan Kaufmann.
  23. Byzantine-resilient distributed observers for LTI systems, Automatica 108:108487.
  24. Distributed subgradient methods for multi-agent optimization, IEEE Trans. Autom. Control 54(1): 48–61.
  25. Consensus and cooperation in networked multi-agent systems, Proc. IEEE 95(1): 215–233.
  26. Reaching agreement in the presence of faults, J. ACM 27(2): 228–234.
  27. Asynchronous Byzantine approximate consensus in directed networks, in Proc. ACM Symp. Principles of Dist. Comp., pp. 149–158.
  28. Average TimeSynch: A consensus-based protocol for clock synchronization in wireless sensor networks, Automatica 47(9): 1878–1886.
  29. Reaching approximate Byzantine consensus with multi-hop communication, Inf. and Computation 255: 352–368.
  30. Chance-constrained H∞subscript𝐻H_{\infty}italic_H start_POSTSUBSCRIPT ∞ end_POSTSUBSCRIPT control for a class of time-varying systems with stochastic nonlinearities: The finite-horizon case, Automatica 107: 296–305.
  31. Fault-tolerant consensus in directed graphs, in Proc. ACM Symp. Principles of Dist. Comp., pp. 451–460.
  32. Iterative approximate Byzantine consensus in arbitrary directed graphs, in Proc. ACM Symp. Principles of Dist. Comp., pp. 365–374.
  33. Resilient consensus through event-based communication, IEEE Trans. Control Netw. Syst. 7(1): 471–482.
  34. State consensus for multi-agent systems with switching topologies and time-varying delays, International Journal of Control 79(10): 1277–1284.
  35. Consensus based approach for economic dispatch problem in a smart grid, IEEE Trans. Power Syst. 28(4): 4416–4426.
  36. Secure consensus with distributed detection via two-hop communication, Automatica 131: 109775.
  37. Resilient consensus with multi-hop communication, in Proc. IEEE Conf. Dec. Control, pp. 2696–2701. Also, arXiv:2201.03214, submitted for journal publication.
  38. Asynchronous approximate Byzantine consensus via multi-hop communication, in Proc. American Control Conf., pp. 755–760.
  39. Event-triggered approximate Byzantine consensus with multi-hop communication, in Proc. IEEE Conf. Dec. Control, pp. 7078–7083.
  40. Resilient consensus with mobile detectors against malicious attacks, IEEE Trans. Signal and Inf. Proc. over Netw. 4(1): 60–69.
  41. Global leader-following consensus of a group of general linear systems using bounded controls, Automatica 68: 294–304.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now