Recent Advances in Population Protocols

The population protocol model (PP) proposed by Angluin et al. [2] describes sensor networks consisting of passively mobile finite-state agents. The agents sense their environment and communicate in pairs to carry out some computation on the sensed values. The mediated population protocol model (MPP) [13] extended the PP model by communication links equipped with a constant size buffer. The MPP model was proved in [13] to be stronger than the PP model. However, its most important contribution is that it provides us with the ability to devise optimizing protocols, approximation protocols and protocols that decide properties of the communication graph on which they run. The latter case, suggests a simplified model, the GDM model, that was formally defined and studied in [11]. GDM is a special case of MPP that captures MPP's ability to decide properties of the communication graph. Here we survey recent advances in the area initiated by the proposal of the PP model and at the same time we provide new protocols, novel ideas and results.

[1]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[2]  Michael J. Fischer,et al.  Stably Computable Properties of Network Graphs , 2005, DCOSS.

[3]  David Eisenstat,et al.  Stably computable predicates are semilinear , 2006, PODC '06.

[4]  Paul G. Spirakis,et al.  Stably Decidable Graph Languages by Mediated Population Protocols , 2010, SSS.

[5]  Rachid Guerraoui,et al.  When Birds Die: Making Population Protocols Fault-Tolerant , 2006, DCOSS.

[6]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

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

[8]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[9]  Paul G. Spirakis,et al.  Mediated Population Protocols , 2009, ICALP.

[10]  Paul G. Spirakis,et al.  The Dynamics of Probabilistic Population Protocols , 2008, DISC.

[11]  Joffroy Beauquier,et al.  Self-stabilizing counting in mobile sensor networks , 2007, PODC '07.

[12]  Ioannis Chatzigiannakis,et al.  Brief Announcement: Decidable Graph Languages by Mediated Population Protocols , 2009, DISC.

[13]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[14]  Johanne Cohen,et al.  On the Convergence of Population Protocols When Population Goes to Infinity , 2009, Appl. Math. Comput..

[15]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.