Skip to main content

2011 | OriginalPaper | Buchkapitel

5. Population Protocols and Related Models

verfasst von : Paul G. Spirakis

Erschienen in: Theoretical Aspects of Distributed Computing in Sensor Networks

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This is a joint work with Ioannis Chatzigiannakis and Othon Michail. We discuss here the population protocol model and most of its well-known extensions. The population protocol model aims to represent sensor networks consisting of tiny computational devices with sensing capabilities that follow some unpredictable and uncontrollable mobility pattern. It adopts a minimalistic approach and, thus, naturally computes a quite restricted class of predicates and exhibits almost no fault tolerance. Most recent approaches make extra realistic and implementable assumptions, in order to gain more computational power and/or speedup the time to convergence and/or improve fault tolerance. In particular, the mediated population protocol model, the community protocol model, and the PALOMA model, which are all extensions of the population protocol model, are thoroughly discussed. Finally, the inherent difficulty of verifying the correctness of population protocols that run on complete communication graphs is revealed, but a promising algorithmic solution is presented.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
We say possibly, because performance mainly depends on the scheduler. But if the scheduler is assumed to be probabilistic, then exploiting all agents should improve expected performance.
 
Literatur
1.
Zurück zum Zitat D. Angluin, J. Aspnes, M. Chan, M. J. Fischer, H. Jiang, and R. Peralta. Stably computable properties of network graphs. In Proceedings Distributed Computing in Sensor Systems: 1st IEEE International Conference, pages 63–74, Marina del Ray, California, USA, 2005. D. Angluin, J. Aspnes, M. Chan, M. J. Fischer, H. Jiang, and R. Peralta. Stably computable properties of network graphs. In Proceedings Distributed Computing in Sensor Systems: 1st IEEE International Conference, pages 63–74, Marina del Ray, California, USA, 2005.
2.
Zurück zum Zitat D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235–253, 2006. Also in 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 290–299, ACM, New York, NY, USA, 2004.CrossRef D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235–253, 2006. Also in 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 290–299, ACM, New York, NY, USA, 2004.CrossRef
3.
Zurück zum Zitat D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, Nov. 2003. D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, Nov. 2003.
4.
Zurück zum Zitat D. Angluin, J. Aspnes, and D. Eisenstat. Fast computation by population protocols with a leader. Distributed Computing, 21(3):183–199, September 2008.CrossRef D. Angluin, J. Aspnes, and D. Eisenstat. Fast computation by population protocols with a leader. Distributed Computing, 21(3):183–199, September 2008.CrossRef
5.
Zurück zum Zitat D. Angluin, J. Aspnes, and D. Eisenstat. Stably computable predicates are semilinear. In Proc. 25th Annual ACM Symposium on Principles of Distributed Computing, pages 292–299, Denver, Colorado, USA, 2006. D. Angluin, J. Aspnes, and D. Eisenstat. Stably computable predicates are semilinear. In Proc. 25th Annual ACM Symposium on Principles of Distributed Computing, pages 292–299, Denver, Colorado, USA, 2006.
6.
Zurück zum Zitat D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert. The computational power of population protocols. Distributed Computing, 20(4): 279–304, November 2007.CrossRef D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert. The computational power of population protocols. Distributed Computing, 20(4): 279–304, November 2007.CrossRef
7.
Zurück zum Zitat J. Aspnes and E. Ruppert. An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science, 93:98–117, October, 2007. Columns: Distributed Computing, Editor: M. Mavronicolas.MATHMathSciNet J. Aspnes and E. Ruppert. An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science, 93:98–117, October, 2007. Columns: Distributed Computing, Editor: M. Mavronicolas.MATHMathSciNet
8.
Zurück zum Zitat R. Bakhshi, F. Bonnet, W. Fokkink, and B. Haverkort. Formal analysis techniques for gossiping protocols. In ACM SIGOPS Operating Systems Review, 41(5):28–36, Special Issue on Gossip-Based Networking, October 2007.CrossRef R. Bakhshi, F. Bonnet, W. Fokkink, and B. Haverkort. Formal analysis techniques for gossiping protocols. In ACM SIGOPS Operating Systems Review, 41(5):28–36, Special Issue on Gossip-Based Networking, October 2007.CrossRef
9.
Zurück zum Zitat J. Beauquier, J. Clement, S. Messika, L. Rosaz, and B. Rozoy. Self-stabilizing counting in mobile sensor networks. Technical Report 1470, LRI, Université Paris-Sud 11, 2007. J. Beauquier, J. Clement, S. Messika, L. Rosaz, and B. Rozoy. Self-stabilizing counting in mobile sensor networks. Technical Report 1470, LRI, Université Paris-Sud 11, 2007.
10.
Zurück zum Zitat G. Behrmann, A. David, and K. G. Larsen. A tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems: Proceedings of the 4th International School on Formal Methods for the Design of Comput., Commun. and Software Syst. (SFM-RT 2004), number 3185 in LNCS, pages 200–236, Springer, 2004. G. Behrmann, A. David, and K. G. Larsen. A tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems: Proceedings of the 4th International School on Formal Methods for the Design of Comput., Commun. and Software Syst. (SFM-RT 2004), number 3185 in LNCS, pages 200–236, Springer, 2004.
11.
Zurück zum Zitat O. Bournez, P. Chassaing, J. Cohen, L. Gerin, and X. Koegler. On the convergence of population protocols when population goes to infinity. In Applied Mathematics and Computation, 215(4):1340–1350, 2009.MATHCrossRefMathSciNet O. Bournez, P. Chassaing, J. Cohen, L. Gerin, and X. Koegler. On the convergence of population protocols when population goes to infinity. In Applied Mathematics and Computation, 215(4):1340–1350, 2009.MATHCrossRefMathSciNet
12.
Zurück zum Zitat I. Chatzigiannakis, S. Dolev, S. P. Fekete, O. Michail, and P. G. Spirakis. Not all fair probabilistic schedulers are equivalent. In 13th International Conference On Principles Of DIstributed Systems (OPODIS), pages 33–47, Nimes, France, December 15–18, 2009. I. Chatzigiannakis, S. Dolev, S. P. Fekete, O. Michail, and P. G. Spirakis. Not all fair probabilistic schedulers are equivalent. In 13th International Conference On Principles Of DIstributed Systems (OPODIS), pages 33–47, Nimes, France, December 15–18, 2009.
15.
Zurück zum Zitat I. Chatzigiannakis, O. Michail, and P. G. Spirakis. Decidable graph languages by mediated population protocols. In 23rd International Symposium on Distributed Computing (DISC), Elche, Spain, Sept. 2009. (Also FRONTS Technical Report FRONTS-TR-2009-16, http://fronts.cti.gr/aigaion/?TR=80) I. Chatzigiannakis, O. Michail, and P. G. Spirakis. Decidable graph languages by mediated population protocols. In 23rd International Symposium on Distributed Computing (DISC), Elche, Spain, Sept. 2009. (Also FRONTS Technical Report FRONTS-TR-2009-16, http://​fronts.​cti.​gr/​aigaion/​?​TR=​80)
17.
Zurück zum Zitat I. Chatzigiannakis, O. Michail, and P. G. Spirakis. Mediated population protocols. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 363–374, Rhodes, Greece, 2009. I. Chatzigiannakis, O. Michail, and P. G. Spirakis. Mediated population protocols. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 363–374, Rhodes, Greece, 2009.
18.
Zurück zum Zitat I. Chatzigiannakis, O. Michail, and P. G. Spirakis. Recent advances in population protocols. In 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), August 24–28, 2009, Novy Smokovec, High Tatras, Slovakia. I. Chatzigiannakis, O. Michail, and P. G. Spirakis. Recent advances in population protocols. In 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), August 24–28, 2009, Novy Smokovec, High Tatras, Slovakia.
19.
Zurück zum Zitat I. Chatzigiannakis and P. G. Spirakis. The dynamics of probabilistic population protocols. In Distributed Computing, 22nd International Symposium, DISC, vol. 5218, Lecture Notes in Computer Science, pages 498–499, 2008. I. Chatzigiannakis and P. G. Spirakis. The dynamics of probabilistic population protocols. In Distributed Computing, 22nd International Symposium, DISC, vol. 5218, Lecture Notes in Computer Science, pages 498–499, 2008.
20.
Zurück zum Zitat J. Cheriyan and K. Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica, 15: 521–549, 1996.MATHCrossRefMathSciNet J. Cheriyan and K. Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica, 15: 521–549, 1996.MATHCrossRefMathSciNet
21.
Zurück zum Zitat E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. MIT Press, New York, NY, 2000. E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. MIT Press, New York, NY, 2000.
22.
Zurück zum Zitat C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert. When birds die: Making population protocols fault-tolerant. In Proc. 2nd IEEE International Conference on Distributed Computing in Sensor Systems, pages 51–66, 2006. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert. When birds die: Making population protocols fault-tolerant. In Proc. 2nd IEEE International Conference on Distributed Computing in Sensor Systems, pages 51–66, 2006.
23.
Zurück zum Zitat Z. Diamadi and M. J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72–82, Mar. 2001. Also appears as Yale Technical Report TR-1207, Jan. 2001.CrossRef Z. Diamadi and M. J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72–82, Mar. 2001. Also appears as Yale Technical Report TR-1207, Jan. 2001.CrossRef
24.
Zurück zum Zitat R. Fenichel. Distribution of Indistinguishable Objects into Distinguishable Slots. Communications of the ACM, 11(6): 430, June 1968.CrossRef R. Fenichel. Distribution of Indistinguishable Objects into Distinguishable Slots. Communications of the ACM, 11(6): 430, June 1968.CrossRef
25.
Zurück zum Zitat H. N. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74:107–114, 2000.CrossRefMathSciNet H. N. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74:107–114, 2000.CrossRefMathSciNet
26.
Zurück zum Zitat D. T. Gillespie. A rigorous derivation of the chemical master equation. Physica A, 188:404–425, 1992.CrossRef D. T. Gillespie. A rigorous derivation of the chemical master equation. Physica A, 188:404–425, 1992.CrossRef
27.
Zurück zum Zitat D. T. Gillespie. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry, 81(25):2340–2361, 1977.CrossRef D. T. Gillespie. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry, 81(25):2340–2361, 1977.CrossRef
28.
Zurück zum Zitat S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16:285–296, 1966.MATHMathSciNet S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16:285–296, 1966.MATHMathSciNet
29.
Zurück zum Zitat R. Guerraoui and E. Ruppert. Names trump malice: Tiny mobile agents can tolerate byzantine failures. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 484–495, Rhodes, Greece, 2009. R. Guerraoui and E. Ruppert. Names trump malice: Tiny mobile agents can tolerate byzantine failures. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 484–495, Rhodes, Greece, 2009.
30.
Zurück zum Zitat A. Hinton, M. Z. Kwiatkowska, G. Norman, and D. Parker. Prism: A tool for automatic verification of probabilistic systems. In Proceedings of 2nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS ’06), vol. 3920, LNCS, pages 441–444. Springer, 2006. A. Hinton, M. Z. Kwiatkowska, G. Norman, and D. Parker. Prism: A tool for automatic verification of probabilistic systems. In Proceedings of 2nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS ’06), vol. 3920, LNCS, pages 441–444. Springer, 2006.
31.
Zurück zum Zitat G. Holzmann. The Spin Model Checker, Primer and Reference Manual. Addison-Wesley, New York, NY, 2003. G. Holzmann. The Spin Model Checker, Primer and Reference Manual. Addison-Wesley, New York, NY, 2003.
32.
Zurück zum Zitat M. Huth and M. Ryan. Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press, Cambridge, UK, 2004.MATH M. Huth and M. Ryan. Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press, Cambridge, UK, 2004.MATH
33.
Zurück zum Zitat T. G. Kurtz. Approximation of population processes. Number 36 in CBMS-NSF Regional Conference Series in Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, 1981. T. G. Kurtz. Approximation of population processes. Number 36 in CBMS-NSF Regional Conference Series in Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, 1981.
34.
Zurück zum Zitat P. C. Olveczky and S. Thorvaldsen. Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude. Parallel and Distributed Processing Symposium, International, p. 157, Proceedings 20th IEEE International Parallel % Distributed Processing Symposium, Rhodes, Greece, 2006. P. C. Olveczky and S. Thorvaldsen. Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude. Parallel and Distributed Processing Symposium, International, p. 157, Proceedings 20th IEEE International Parallel % Distributed Processing Symposium, Rhodes, Greece, 2006.
35.
Zurück zum Zitat C. H. Papadimitriou. Computational Complexity. Addison-Wesley, New York, NY, 1994.MATH C. H. Papadimitriou. Computational Complexity. Addison-Wesley, New York, NY, 1994.MATH
Metadaten
Titel
Population Protocols and Related Models
verfasst von
Paul G. Spirakis
Copyright-Jahr
2011
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-14849-1_5