Distributed anonymous discrete function computation and averaging

We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage capabilities that do not grow with the network size. Furthermore, each node only knows its neighbors, not the entire graph. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we provide a necessary condition for computability which we show to be nearly sucient, in the sense that every function that violates this condition can at least be approximated. The problem of computing (suitably rounded) averages in a distributed manner plays a central role in our development; we provide an algorithm that solves it in time that grows quadratically with the size of the network.

[1]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[2]  Philippe Flajolet,et al.  Estimating the multiplicities of conflicts to speed their resolution in multiple access channels , 1987, JACM.

[3]  Manfred K. Warmuth,et al.  Computing on an anonymous ring , 1988, JACM.

[4]  Masafumi Yamashita,et al.  Computing on an anonymous network , 1988, PODC '88.

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[7]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[8]  Manfred K. Warmuth,et al.  Gap Theorems for Distributed Computation , 1993, SIAM J. Comput..

[9]  Yossi Matias,et al.  Elections in Anonymous Networks , 1994, Inf. Comput..

[10]  Evangelos Kranakis,et al.  Computing Boolean Functions on Anonymous Networks , 1994, Inf. Comput..

[11]  Land,et al.  No perfect two-state cellular automata for density classification exists. , 1995, Physical review letters.

[12]  Israel Cidon,et al.  Message Terminating Algorithms for Anonymous Rings of Unknown Size , 1995, Inf. Process. Lett..

[13]  David Peleg,et al.  Distributed Probabilistic Polling and Applications to Proportionate Agreement , 1999, ICALP.

[14]  David Peleg,et al.  Local majorities, coalitions and monopolies in graphs: a review , 2002, Theor. Comput. Sci..

[15]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[16]  Faith Ellen,et al.  Hundreds of impossibility results for distributed computing , 2003, Distributed Computing.

[17]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[18]  Ran Wolff,et al.  A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion , 2004, DISC.

[19]  Emilio Frazzoli,et al.  On synchronous robotic networks Part I: Models, tasks and complexity notions , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[20]  Anurag Kumar,et al.  Time and energy complexity of distributed computation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[21]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[22]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[23]  F. Bullo,et al.  On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity , 2005, IEEE Transactions on Automatic Control.

[24]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[25]  R. Srikant,et al.  Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks , 2007, IEEE Transactions on Information Theory.

[26]  Michael Rabbat,et al.  Distributed Average Consensus using Probabilistic Quantization , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[27]  Sonia Martínez,et al.  On the convergence time of distributed quantized averaging algorithms , 2008, 2008 47th IEEE Conference on Decision and Control.

[28]  Munther A. Dahleh,et al.  Counting bits for distributed function computation , 2008, 2008 IEEE International Symposium on Information Theory.

[29]  Hillol Kargupta,et al.  Distributed probabilistic inferencing in sensor networks using variational approximation , 2008, J. Parallel Distributed Comput..

[30]  Soummya Kar,et al.  Distributed average consensus in sensor networks with quantized inter-sensor communication , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[31]  George Michailidis,et al.  Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks , 2008, IEEE Transactions on Signal Processing.

[32]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[33]  Ruggero Carli,et al.  Average consensus on networks with quantized communication , 2009 .

[34]  Milan Vojnovic,et al.  Using Three States for Binary Consensus on Complete Graphs , 2009, IEEE INFOCOM 2009.

[35]  Martin Vetterli,et al.  Interval consensus: From quantized gossip to voting , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[36]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[37]  Ruggero Carli,et al.  Quantized Coordination Algorithms for Rendezvous and Deployment , 2009, SIAM J. Control. Optim..

[38]  Moez Draief,et al.  Convergence Speed of Binary Interval Consensus , 2010, 2010 Proceedings IEEE INFOCOM.

[39]  Sonia Martínez,et al.  On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms , 2010, IEEE Transactions on Automatic Control.