The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
Abstract
Given a network of interconnected nodes, each with its own value (such as a measurement, position, vote, or other data), we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of the node values, despite the actions of malicious nodes in the network. Our scheme assumes a broadcast model of communication (where all nodes transmit the same value to all of their neighbors) and utilizes a linear iteration where, at each time-step, each node updates its value to be a weighted average of its own previous value and those of its neighbors. We consider a node to be malicious or faulty if, instead of following the predefined linear strategy, it updates its value arbitrarily at each time-step (perhaps conspiring with other malicious nodes in the process). We show that the topology of the network completely characterizes the resilience of linear iterative strategies to this kind of malicious behavior. First, when the network contains 2for fewer vertex-disjoint paths from some nodexjto another nodexi, we provide an explicit strategy forfmalicious nodes to follow in order to prevent nodexifrom receiving any information aboutxj's value. Next, if nodexihas at least 2f+1 vertex-disjoint paths from every other (non-neighboring) node, we show thatxiis guaranteed to be able to calculate any arbitrary function of all node values when the number of malicious nodes isfor less. Furthermore, we show that this function can be calculated after running the linear iteration for a finite number of time-steps (upper bounded by the number of nodes in the network) with almost any set of weights (i.e., for all weights except for a set of measure zero).
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
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 2×
“The special case of distributed consensus, where all nodes in the network calculate the same function [4], has received extensive attention from the control community due to its applicability to topics such as cooperative control, multi-agent systems, and modeling flocking behavior in biological and physical systems […”
BackgroundDynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Coordination 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
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
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
Fields, J. (2001) · Cited by 4,044
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
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
Cited by
Attack Detection and Identification in Cyber-Physical Systems
Pasqualetti, F., Dorfler, F., & Bullo, F. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2266831 · Cited by 2,109
Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
Fawzi, H., Tabuada, P., & Diggavi, S. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2303233 · Cited by 1,278
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
Resilient Asymptotic Consensus in Robust Networks
LeBlanc, H. J., Zhang, H., Koutsoukos, X., & Sundaram, S. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130413 · Cited by 730
Self-citationSecure State Estimation and Control of Cyber-Physical Systems: A Survey
Ding, D., Han, Q.-L., Ge, X., & Wang, J. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3041121 · Cited by 591
Metadata
- Authors
- Sundaram, S., & Hadjicostis, C. N.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-07
- Volume
- 56
- Issue
- 7
- Pages
- 1495-1508
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2153775930
- Cited by
- 472
- References
- 36
- FWCI
- 29.80
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents. https://app.cochat.ai/papers/10.1109/tac.2010.2088690
- The paper
- Sundaram, S., & Hadjicostis, C. N. (2011). Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2088690
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.