The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Resilient Asymptotic Consensus in Robust Networks
Abstract
This paper addresses the problem of resilient in-network consensus in the presence of misbehaving nodes. Secure and fault-tolerant consensus algorithms typically assume knowledge of nonlocal information; however, this assumption is not suitable for large-scale dynamic networks. To remedy this, we focus on local strategies that provide resilience to faults and compromised nodes. We design a consensus protocol based on local information that is resilient to worst-case security breaches, assuming the compromised nodes have full knowledge of the network and the intentions of the other nodes. We provide necessary and sufficient conditions for the normal nodes to reach asymptotic consensus despite the influence of the misbehaving nodes under different threat assumptions. We show that traditional metrics such as connectivity are not adequate to characterize the behavior of such algorithms, and develop a novel graph-theoretic property referred to as network robustness. Network robustness formalizes the notion of redundancy of direct information exchange between subsets of nodes in the network, and is a fundamental property for analyzing the behavior of certain distributed algorithms that use only local information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“Let M [t] and m[t] be the maximum and minimum values of the normal nodes at time-step t, respectively.”
BackgroundCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Networks, Crowds, and Markets: Network Dynamics: Structural Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Networks, Crowds, and Markets: Network Dynamics: Population Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
(2008) · Cited by 577
Consensus Computation in Unreliable Networks: A System Theoretic Approach
Pasqualetti, F., Bicchi, A., & Bullo, F. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2158130 · Cited by 541
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
Sundaram, S., & Hadjicostis, C. N. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2088690 · Cited by 472
Self-citationDistributed LMS for Consensus-Based In-Network Adaptive Processing
Schizas, I. D., Mateos, G., & Giannakis, G. B. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016226 · Cited by 376
Consensus-based distributed support vector machines
Forero, P. A., Caño, A., & Giannakis, G. B. (2010) · Cited by 364
Lynch, N. (1996) · Cited by 354
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols
Ben-Or, M. (2000) · Cited by 272
Expander graphs in pure and applied mathematics
Lubotzky, A. (2011) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-2011-01359-3 · Cited by 226
Iterative approximate byzantine consensus in arbitrary directed graphs
Vaidya, N. H., Tseng, L., & Liang, G. (2012) · Proceedings of the 2012 ACM symposium on Principles of distributed computing · doi:10.1145/2332432.2332505 · Cited by 221
Toward a theory of in-network computation in wireless sensor networks
Giridhar, A., & Kumar, P. R. (2006) · IEEE Communications Magazine · doi:10.1109/mcom.2006.1632656 · Cited by 220
Consensus-based distributed linear support vector machines
Forero, P. A., Cano, A., & Giannakis, G. B. (2010) · Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks · doi:10.1145/1791212.1791218 · Cited by 171
Distributed function calculation and consensus using linear iterative strategies
Sundaram, S., & Hadjicostis, C. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080507 · Cited by 160
Self-citationRobustness of information diffusion algorithms to locally bounded adversaries
Zhang, H., & Sundaram, S. (2012) · 2012 American Control Conference (ACC) · doi:10.1109/acc.2012.6315661 · Cited by 158
Self-citationReaching approximate agreement with mixed-mode faults
Kieckhafer, R. M., & Azadmanesh, M. H. (1994) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.262588 · Cited by 141
Dissemination of Information in Communication Networks
Hromkovic̆, J., Klasing, R., Pelc, A., Růžička, P., & Unger, W. (2005) · Springer eBooks · doi:10.1007/b137871 · Cited by 134
On Ergodicity, Infinite Flow, and Consensus in Random Models
Touri, B., & Nedić, A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091174 · Cited by 115
Consensus of multi-agent networks in the presence of adversaries using only local information
LeBlanc, H. J., Zhang, H., Sundaram, S., & Koutsoukos, X. (2012) · International Conference on High Confidence Networked Systems · doi:10.1145/2185505.2185507 · Cited by 102
Self-citationConsensus in networked multi-agent systems with adversaries
LeBlanc, H. J., & Koutsoukos, X. (2011) · International Conference on Hybrid Systems: computation and control · doi:10.1145/1967701.1967742 · Cited by 88
Self-citationAsymptotically optimal algorithms for approximate agreement
Fekete, A. D. (1990) · Distributed Computing · doi:10.1007/bf01783662 · Cited by 58
Low complexity resilient consensus in networked multi-agent systems with adversaries
LeBlanc, H. J., & Koutsoukos, X. (2012) · ACM International Conference on Hybrid Systems: Computation and Control (HSCC) · doi:10.1145/2185632.2185637 · Cited by 52
Self-citationOn Conditions for Convergence to Consensus
Lorenz, J., & Lorenz, D. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2046086 · Cited by 52
On the robustness of distributed algorithms
Gupta, V., Langbort, C., & Murray, R. M. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2006.377451 · Cited by 46
Consensus with robustness to outliers via distributed optimization
Li, J., Elhamifar, E., Wang, I.-J., & Vidal, R. (2010) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717526 · Cited by 26
Network Robustness: Diffusing Information Despite Adversaries
Zhang, H. (2012) · UWSpace (University of Waterloo) · Cited by 4
Self-citation
Cited by
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
A systems and control perspective of CPS security
Dibaji, S. M., Pirani, M., Flamholz, D. B., Annaswamy, A. M., Johansson, K. H., & Chakrabortty, A. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.04.011 · Cited by 559
Ding, D., Wang, Z., Ho, D. W. C., & Wei, G. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2582802 · Cited by 470
Secure Control of Multiagent Systems Against Malicious Attacks: A Brief Survey
He, W., Xu, W., Ge, X., Han, Q.-L., Du, W., & Qian, F. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3126644 · Cited by 290
Distributed Optimization Under Adversarial Nodes
Sundaram, S., & Gharesifard, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836919 · Cited by 274
Self-citation
Metadata
- Authors
- LeBlanc, H. J., Zhang, H., Koutsoukos, X., & Sundaram, S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2013-04
- Volume
- 31
- Issue
- 4
- Pages
- 766-781
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W1973184571
- Cited by
- 730
- References
- 44
- FWCI
- 32.16
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.