Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 472

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

Sundaram, Shreyas, Hadjicostis, Christoforos N.·2011·IEEE Transactions on Automatic Control

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2010.2088690

Cites

36 of 36 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 36 references

Cited by

See all 472

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.