Resilient consensus protocol in the presence of trusted nodes

7th International Symposium on Resilient Control Systems, ISRCS 2014

Volumn , Issue , 2014, Pages

  Abbas, Waseem ^a   Vorobeychik, Yevgeniy ^a   Koutsoukos, Xenofon ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

adversary; consensus; dominating set; graph robustness; Resilience

Indexed keywords

CONTROL ENGINEERING;

ADVERSARY; CONNECTED DOMINATING SET; CONSENSUS; CONSENSUS PROBLEMS; CONSENSUS PROTOCOLS; DISTRIBUTED CONSENSUS; DOMINATING SETS; RESILIENCE;

ROBUSTNESS (CONTROL SYSTEMS);

EID: 84908701452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISRCS.2014.6900100     Document Type: Conference Paper

References (16)

1. A. Olshevsky and J. N. Tsitsiklis, "Convergence speed in distributed consensus and averaging," SIAM Review, vol. 53, no. 4, pp. 747-772, 2011.
2. M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks, Princeton University Press, 2010.
3. M. Pease, R. Shostak, and L. Lamport, "Reaching agreement in the presence of faults," Journal of the ACM, vol. 27, no. 2, pp. 228-234, 1980.
4. N. A. Lynch, Distributed Algorithms, San Francisco, CA: Morgan Kaufman Publishers Inc., 1997.
5. S. Sundaram and C. Hadjicostis, "Distributed function calculation via linear iterative strategies in the presence of malicious agents," IEEE Trans. Autom. Control, vol. 56, no. 2, 2011.
6. F. Pasqualetti, A. Bicchi, and F. Bullo, "Consensus computation in unreliable networks: A system theoretic approach", IEEE Trans. Autom. Control, vol. 57, no. 1, pp. 90-104, 2012.
7. L. Tseng and N. H. Vaidya, "Iterative approximate byzantine consensus under a generalized fault model", Intl. Conf. on Distributed Computing and Networking, 2013.
8. H. J. LeBlanc and X. D. Koutsoukos, "Low complexity resilient consensus in networked multi-agent systems with adversaries," Intl. Conf. on Hybrid Systems: Computation and Control, Beijing, China, 2012.
9. H. J. LeBlanc, H. Zhang, X. Koutsoukos, and S. Sundaram, "Resilient asymptotic consensus in robust networks," IEEE J. Sel. Areas Commun, vol. 31, no. 4, 2013.
10. M. Yampolskiy, Y. Vorobeychik, X. Koutsoukos, P. Hovarth, H. J. LeBlanc, and J. Sztipanovits, "Resilient distributed consensus for tree topology," ACM Intl. Conf. on High Confidence Networked Systems, Berlin, Germany, 2014.
11. H. Zhang and S. Sundaram, "Robustness of information diffusion algorithms to locally bounded adversaries," IEEE American Control Conf., Montŕeal, Canada, 2012.
12. X. Liu, P. Gao, and J. S. Baras, "Distributed consensus with byzantine adversaries," Allerton Conf. on Communication, Control and Computing, Monticello, IL, 2013.
13. Y. Caro, D. B. West, and R. Yuster, "Connected domination and spanning trees with many leaves," SIAM J. Discrete Math., vol. 13, no. 2, pp. 202-211, 2000.
14. J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," Intl. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, Seattle,WA, 1999.
15. P. Wan, K. M. Alzoubi, and O. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks," Mobile Networks and Applications, vol. 9, pp. 141-149, 2004.
16. W. Ren and R. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, vol. 50, 2005.