Distributed anonymous function computation in information fusion and multiagent systems

Authors:
Julien M. Hendrickx;Alex Olshevsky;John N. Tsitsiklis
Affiliations:
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 17
Cited 1

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

Journal of the ACM (JACM)
Computing on an anonymous ring

Journal of the ACM (JACM)
Computing on an anonymous network

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computing boolean functions on anonymous networks

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Gap theorems for distributed computation

SIAM Journal on Computing
Elections in anonymous networks

Information and Computation
Distributed probabilistic polling and applications to proportionate agreement

Information and Computation
Local majorities, coalitions and monopolies in graphs: a review

Theoretical Computer Science
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Quantized consensus

Automatica (Journal of IFAC)
Distributed probabilistic inferencing in sensor networks using variational approximation

Journal of Parallel and Distributed Computing
Distributed Average Consensus using Probabilistic Quantization

SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
Interval consensus: From quantized gossip to voting

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks

IEEE Transactions on Signal Processing
Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks

IEEE Transactions on Information Theory
Computing and communicating functions over sensor networks

IEEE Journal on Selected Areas in Communications

Brief paper: Distributed averaging on digital erasure networks

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes, with bounded computation and storage capabilities that do not scale with the network size. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we exhibit a class of non-computable functions, and prove that every function outside this class can at least be approximated. The problem of computing averages in a distributed manner plays a central role in our development.