Resilient asymptotic consensus in robust networks

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 4, 2013, Pages 766-781

  Leblanc, Heath J ^a   Zhang, Haotian ^b   Koutsoukos, Xenofon ^c   Sundaram, Shreyas ^b  

^a OHIO NORTHERN UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c VANDERBILT UNIVERSITY   (United States)

Author keywords

Adversary; Byzantine; Consensus; Distributed Algorithms; In Network Computation; Resilience; Robust Networks

Indexed keywords

ADVERSARY; BYZANTINE; CONSENSUS; IN-NETWORK COMPUTATIONS; RESILIENCE; ROBUST NETWORK;

ALGORITHMS; GRAPH THEORY; NETWORK PROTOCOLS; PARALLEL ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84875593698     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130413     Document Type: Article

References (52)

1. H. J. LeBlanc, H. Zhang, S. Sundaram, and X. Koutsoukos, "Consensus of multi-agent networks in the presence of adversaries using only local information," in Proc. 1st International Conference on High Confidence Networked Systems (HiCoNS), Beijing, China, 2012, pp. 1-10.
2. H. Zhang and S. Sundaram, "Robustness of information diffusion algorithms to locally bounded adversaries," in Proc. American Control Conference, Montŕeal, Canada, 2012, pp. 5855-5861.
3. A. Giridhar and P. R. Kumar, "Toward a theory of in-network computation in wireless sensor networks," IEEE Commun. Mag., vol. 44, no. 4, pp. 98-107, April 2006. (Pubitemid 43792675)
4. A. A. Ćardenas, S. Amin, and S. S. Sastry, "Research challenges for the security of control systems," in Proc. 3rd Conference on Hot Topics in Security, San Jose, CA, July 2008, pp. 1-6.
5. N. A. Lynch, Distributed Algorithms. San Francisco, California: Morgan Kaufmann Publishers Inc., 1997.
6. R. Olfati-Saber, J. A. Fax, and R. M. Murray, "Consensus and cooperation in networked multi-agent systems," Proc. IEEE, vol. 95, no. 1, pp. 215-233, 2007.
7. J. N. Tsitsiklis, "Problems in decentralized decision making and computation," Ph.D. dissertation, Department of EECS, MIT, 1984.
8. S. Sundaram and C. N. Hadjicostis, "Distributed function calculation and consensus using linear iterative strategies," IEEE J. Sel. Areas Commun., vol. 26, no. 4, pp. 650-660, May 2008. (Pubitemid 351658780)
9. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, Oct. 2003, pp. 482-491.
10. I. D. Schizas, G. Mateos, and G. B. Giannakis, "Distributed LMS for consensus-based in-network adaptive processing," IEEE Trans. Signal Process., vol. 57, no. 6, pp. 2365-2382, June 2009.
11. J. N. Tsitsiklis, D. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Autom. Control, vol. 31, no. 9, pp. 803-812, 1986. (Pubitemid 16629805)
12. P. A. Forero, A. Cano, and G. B. Giannakis, "Consensus-based distributed support vector machines," J. Machine Learning Research, vol. 11, pp. 1663-1707, 2010.
13. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 48, no. 6, pp. 988-1001, June 2003.
14. L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Trans. Program. Lang. Syst., vol. 4, no. 2, pp. 382-401, 1982.
15. M. O. Rabin, "Randomized Byzantine generals," in 24th Annual Symposium on Foundations of Computer Science, Nov. 1983, pp. 403-409.
16. M. Ben-Or, "Another advantage of free choice: Completely asynchronous agreement protocols," in Proc. 2nd Annual ACM Symposium on Principles of Distributed Computing, ser. (PODC), Montŕeal, Quebec, Canada, 1983, pp. 27-30. (Pubitemid 16624337)
17. A. D. Fekete, "Asymptotically optimal algorithms for approximate agreement," Distributed Computing, vol. 4, pp. 9-29, Mar. 1990. (Pubitemid 20686132)
18. M. Ben-Or, D. Dolev, and E. N. Hoch, "Simple gradecast based algorithms," CoRR, vol. abs/1007.1049, 2010.
19. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, Dissemination of Information in Communication Networks. Springer-Verlag, 2005.
20. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Medard, "Resilient network coding in the presence of Byzantine adversaries," in 26th IEEE International Conference on Computer Communications, INFOCOM, Anchorage, AL, May 2007, pp. 616-624. (Pubitemid 47334278)
21. N. Agmon and D. Peleg, "Fault-tolerant gathering algorithms for autonomous mobile robots," SIAM J. Computing, vol. 36, no. 1, pp. 56-82, July 2006. (Pubitemid 46374018)
22. X. D́efago, M. Gradinariu, S. Messika, and P. Raipin- Parv́edy, "Faulttolerant and self-stabilizing mobile robots gathering," in Distributed Computing, ser. Lecture Notes in Computer Science, S. Dolev, Ed. Springer Berlin, Heidelberg, 2006, vol. 4167, pp. 46-60. (Pubitemid 44849701)
23. Z. Bouzid, M. G. Potop-Butucaru, and S. Tixeuil, "Optimal Byzantineresilient convergence in uni-dimensional robot networks," Theoretical Computer Science, vol. 411, no. 34-36, pp. 3154-3168, July 2010.
24. S. Sundaram and C. N. Hadjicostis, "Distributed function calculation via linear iterative strategies in the presence of malicious agents," IEEE Trans. Autom. Control, vol. 56, no. 7, pp. 1495-1508, July 2011.
25. 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, Jan. 2012.
26. H. J. LeBlanc and X. D. Koutsoukos, "Consensus in networked multiagent systems with adversaries," in Proc. 14th International Conference on Hybrid Systems: Computation and Control, ser. (HSCC '11), Chicago, IL, 2011, pp. 281-290.
27. [27]-, "Low complexity resilient consensus in networked multi-agent systems with adversaries," in Proc. 15th International Conference on Hybrid Systems: Computation and Control, ser. (HSCC '12), Beijing, China, 2012, pp. 5-14.
28. N. H. Vaidya, L. Tseng, and G. Liang, "Iterative approximate Byzantine consensus in arbitrary directed graphs," in Proc. ACM Symposium on Principles of Distributed Computing (PODC), Madeira, Portugal, 2012, pp. 365-374.
29. D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl, "Reaching approximate agreement in the presence of faults," J. ACM, vol. 33, no. 3, pp. 499-516, 1986. (Pubitemid 16589617)
30. R. M. Kieckhafer and M. H. Azadmanesh, "Reaching approximate agreement with mixed mode faults," IEEE Trans. Parallel Distrib. Syst., vol. 5, no. 1, pp. 53-63, 1994.
31. [31]-, "Low cost approximate agreement in partially connected networks," Journal of Computing and Information, vol. 3, no. 1, pp. 53-85, 1993.
32. H. J. LeBlanc, "Resilient cooperative control of networked multiagent systems," Ph.D. dissertation, Department of EECS, Vanderbilt University, 2012.
33. H. Zhang, "Network Robustness: Diffusing Information Despite Adversaries," M.S. thesis, Department of ECE, University of Waterloo, 2012.
34. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, June 2006. (Pubitemid 43898906)
35. A. Pelc and D. Peleg, "Broadcasting with locally bounded Byzantine faults," in Information Processing Letters, 2005, pp. 109-115.
36. A. Ichimura and M. Shigeno, "A new parameter for a broadcast algorithm with locally bounded Byzantine faults," Information Processing Letters, vol. 110, pp. 514-517, 2010.
37. D. Easley and J. Kleinberg, Networks, Crowds and Markets: Reasoning about a Highly Connected World. Cambridge University Press, 2010.
38. W. Ren, R. W. Beard, and E. M. Atkins, "Information consensus in multivehicle cooperative control," IEEE Control Syst. Mag., vol. 27, no. 2, pp. 71-82, April 2007. (Pubitemid 46562979)
39. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Systems & Control Letters, vol. 53, pp. 65-78, 2004.
40. W. Ren and R. W. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, vol. 50, no. 5, pp. 655-661, May 2005. (Pubitemid 40784437)
41. L. Moreau, "Stability of multiagent systems with time-dependent communication links," IEEE Trans. Autom. Control, vol. 50, no. 2, pp. 169-182, Feb. 2005. (Pubitemid 40319348)
42. B. Touri and A. Nedíc, "On ergodicity, infinite flow, and consensus in random models," IEEE Transactions on Automatic Control, vol. 56, no. 7, pp. 1593-1605, July 2011.
43. J. Lorenz and D. A. Lorenz, "On conditions for convergence to consensus," IEEE Trans. Autom. Control, vol. 55, no. 7, pp. 1651-1656, July 2010.
44. V. Gupta, C. Langbort, and R. M. Murray, "On the robustness of distributed algorithms," in IEEE Conference on Decision and Control, San Diego, California, Dec. 2006, pp. 3473-3478. (Pubitemid 351283760)
45. A. H. Azadmanesh and H. Bajwa, "Global convergence in partially fully connected networks (pfcn) with limited relays," The 27th Annual Conference of the IEEE Industrial Electronics Society, vol. 3, pp. 2022-2025, 2001. (Pubitemid 34078882)
46. M. H. Azadmanesh and R. M. Kieckhafer, "Asynchronous approximate agreement in partially connected networks," International Journal of Parallel and Distributed Systems and Networks, vol. 5, no. 1, pp. 26-34, 2002.
47. J. Li, E. Elhamifar, I. J. Wang, and R. Vidal, "Consensus with robustness to outliers via distributed optimization," in IEEE Conference on Decision and Control, Atlanta, GA, Dec. 2010, pp. 2111-2117.
48. E. Montijano, S. Mart́?nez, and S. Sagúes, "De-RANSAC: Robust distributed consensus in sensor networks," European J. Control, submitted 2012.
49. S. Hoory, N. Linial, and A. Wigderson, "Expander graphs and their applications," Bulletin American Mathmatical Society, vol. 43, no. 4, pp. 439-561, Oct. 2006. (Pubitemid 44448254)
50. A. Lubotzky, "Expander graphs in pure and applied mathematics," Bulletin American Mathmatical Society, vol. 49, no. 1, pp. 113-162, Jan. 2012.
51. N. H. Vaidya, "Matrix representation of iterative approximate Byzantine consensus in directed graphs," CoRR, vol. abs/1201.1888, 2012.
52. R. Albert and A. L. Barab́asi, "Statistical mechanics of complex networks," Rev. Mod. Phys., vol. 74, no. 1, pp. 47-97, Jan. 2002.