Resilient distributed consensus for tree topology

Distributed consensus protocols are an important class of distributed algorithms. Recently, an Adversarial Resilient Consensus Protocol (ARC-P) has been proposed which is capable to achieve consensus despite false information provided by a limited number of malicious nodes. In order to withstand false information, this algorithm requires a mesh-like topology, so that multiple alternative information flow paths exist. However, these assumptions are not always valid. For instance, in Smart Grid, an emerging distributed CPS, the node connectivity is expected to resemble the scale free network topology. Especially closer to the end customer, in home and building area networks, the connectivity graph resembles a tree structure. In this paper, we propose a Range-based Adversary Resilient Consensus Protocol (R.ARC-P). Three aspects distinguish R.ARC-P from its predecessor: This protocol operates on the tree topology, it distinguishes between trustworthiness of nodes in the immediate neighborhood, and it uses a valid value range in order to reduce the number of nodes considered as outliers. R.ARC-P is capable of reaching global consensus among all genuine nodes in the tree if assumptions about maximal number of malicious nodes in the neighborhood hold. In the case that this assumption is wrong, it is still possible to reach Strong Partial Consensus, i.e., consensus between leafs of at least two different parents.

[1]  Shreyas Sundaram,et al.  Consensus of multi-agent networks in the presence of adversaries using only local information , 2012, HiCoNS '12.

[2]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[3]  Kemal Akkaya,et al.  A survey of routing protocols for smart grid communications , 2012, Comput. Networks.

[4]  Taskin Koçak,et al.  Smart Grid Technologies: Communication Technologies and Standards , 2011, IEEE Transactions on Industrial Informatics.

[5]  F. Cleveland,et al.  IEC TC57 Security Standards for the Power System's Information Infrastructure - Beyond Simple Encryption , 2006, 2005/2006 IEEE/PES Transmission and Distribution Conference and Exhibition.

[6]  P. Holme Network reachability of real-world contact sequences. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Yang Xiao,et al.  Cyber Security and Privacy Issues in Smart Grids , 2012, IEEE Communications Surveys & Tutorials.

[8]  E. Quinn Privacy and the New Energy Infrastructure , 2009 .

[9]  Amit K. Roy-Chowdhury,et al.  Distributed multi-target tracking in a self-configuring camera network , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Henrik Sandberg,et al.  Stealth Attacks and Protection Schemes for State Estimators in Power Systems , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[11]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[12]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[13]  Xenofon Koutsoukos,et al.  Consensus in networked multi-agent systems with adversaries , 2011 .

[14]  Karl Henrik Johansson,et al.  On Security Indices for State Estimators in Power Networks , 2010 .

[15]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[16]  Yang Xiao,et al.  A survey of communication/networking in Smart Grids , 2012, Future Gener. Comput. Syst..