Passively mobile communicating machines that use restricted space

Theoretical Computer Science

Volumn 412, Issue 46, 2011, Pages 6469-6483

  Chatzigiannakis, Ioannis ^a   Michail, Othon ^a   Nikolaou, Stavros ^a   Pavlogiannis, Andreas ^b   Spirakis, Paul G ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Diffuse computation; Distributed computing; Passive mobility; Pervasive environments

Indexed keywords

COMPLEXITY CLASS; INTERACTION GRAPHS; MEMORY BOUNDS; MOBILE MACHINES; MOBILE WIRELESS SENSOR NETWORK; P-M MODEL; PERVASIVE ENVIRONMENTS; PROTOCOL MODEL; SEMILINEAR; SPACE HIERARCHY; SPACE LIMITATIONS; SPACE REQUIREMENTS; THEORETICAL MODELS; UNBOUNDED MEMORY; UNIQUE IDENTIFIERS;

DISTRIBUTED COMPUTER SYSTEMS; TURING MACHINES;

WIRELESS SENSOR NETWORKS;

EID: 80053320725     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.07.001     Document Type: Article

References (32)

1. I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P.G. Spirakis, Passively mobile communicating logarithmic space machines, Technical Report FRONTS-TR-2010-16, RACTI, Patras, Greece, 2010. http://fronts.cti.gr/ aigaion/?TR=154, arXiv/1004.3395v1.
2. I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P.G. Spirakis, Passively mobile communicating machines that use restricted space, Technical Report, RACTI, Patras, Greece, 2010. http://arxiv.org/abs/1012.2440v1.
3. D. Angluin, J. Aspnes, Z. Diamadi, M.J. Fischer, and R. Peralta Computation in networks of passively mobile finite-state sensors Distributed Computing 2006 235 253
4. S. Ginsburg, and E.H. Spanier Semigroups, presburger formulas, and languages Pacific Journal of Mathematics 16 1966 285 296
5. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert When birds die: Making population protocols fault-tolerant IEEE 2nd Intl Conference on Distributed Computing in Sensor Systems DCOSS Lecture Notes in Computer Science vol. 4026 2006 Springer-Verlag 51 66 (Pubitemid 44077818)
6. R. Guerraoui, and E. Ruppert Names trump malice: tiny mobile agents can tolerate byzantine failures 36th International Colloquium on Automata, Languages and Programming ICALP Lecture Notes in Computer Science vol. 5556 2009 Springer-Verlag 484 495
7. D. Angluin, J. Aspnes, and D. Eisenstat A simple population protocol for fast robust approximate majority Distributed Computing 21 2008 87 102
8. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Mediated population protocols 36th International Colloquium on Automata, Languages and Programming ICALP Lecture Notes in Computer Science vol. 5556 2009 Springer-Verlag 363 374
9. D. Angluin, J. Aspnes, and D. Eisenstat Fast computation by population protocols with a leader Distributed Computing 21 2008 183 199
10. I. Chatzigiannakis, S. Dolev, S.P. Fekete, O. Michail, and P.G. Spirakis Not all fair probabilistic schedulers are equivalent 13th International Conference on Principles of Distributed Systems OPODIS Lecture Notes in Computer Science vol. 5923 2009 Springer-Verlag Berlin, Heidelberg 33 47
11. O. Bournez, P. Chassaing, J. Cohen, L. Gerin, and X. Koegler On the convergence of population protocols when population goes to infinity Applied Mathematics and Computation 2009
12. I. Chatzigiannakis, and P.G. Spirakis The dynamics of probabilistic population protocols 22nd international symposium on Distributed Computing DISC Lecture Notes in Computer Science vol. 5218 2008 Springer-Verlag Berlin, Heidelberg 498 499
13. n 2) are stably computable by the mediated population protocol model 35th International Symposium on Mathematical Foundations of Computer Science MFCS Lecture Notes in Computer Science vol. 6281 2010 Springer-Verlag 270 281
14. O. Michail, I. Chatzigiannakis, and P.G. Spirakis Mediated population protocols Theoretical Computer Science 412 2011 2434 2450
15. D. Angluin, J. Aspnes, M. Chan, M.J. Fischer, H. Jiang, and R. Peralta Stably computable properties of network graphs V.K. Prasanna, S. Iyengar, P. Spirakis, M. Welsh, Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings Lecture Notes in Computer Science vol. 3560 2005 Springer-Verlag 63 74 (Pubitemid 41425109)
16. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Stably decidable graph languages by mediated population protocols 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems SSS Lecture Notes in Computer Science vol. 6366 2010 Springer-Verlag 252 266
17. J. Beauquier, J. Clement, S. Messika, L. Rosaz, and B. Rozoy Self-stabilizing counting in mobile sensor networks Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC'07 2007 ACM New York, NY, USA 396 397 (Pubitemid 350237352)
18. O. Bournez, J. Chalopin, J. Cohen, X. Koegler, Playing With Population Protocols, ArXiv e-prints, 2009. http://arxiv.org/abs/0906.3256.
19. J. Aspnes, and E. Ruppert An introduction to population protocols Bulletin of the European Association for Theoretical Computer Science 93 2007 98 117
20. P.G. Spirakis, Theoretical Aspects of Distributed Computing in Sensor Networks, Springer-Verlag.
21. O. Michail, I. Chatzigiannakis, and P.G. Spirakis New Models for Population Protocols N.A. Lynch, Synthesis Lectures on Distributed Computing Theory 2011 Morgan & Claypool
22. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Recent advances in population protocols 34th International Symposium on Mathematical Foundations of Computer Science MFCS Lecture Notes in Computer Science vol. 5734 2009 Springer-Verlag Berlin, Heidelberg 56 76
23. C. lvarez, A. Duch, J. Gabarro, and M. Serna Sensor field: a computational model 5th Intl Workshop on Algorithmic Aspects of Wireless Sensor Networks ALGOSENSORS 2009 Springer-Verlag Berlin, Heidelberg 3 14
24. C. lvarez, M. Serna, P.G. Spirakis, On the computational power of constant memory sensor fields, Technical Report FRONTS-TR-2010-10, 2010.
25. C. lvarez, I. Chatzigiannakis, A. Duch, J. Gabarró, O. Michail, S. Maria, and P.G. Spirakis Computational models for networks of tiny artifacts: a survey Computer Science Review 5 2011 7 25
26. P.C. Fischer, A.R. Meyer, and A.L. Rosenberg Counter machines and counter languages Mathematical Systems Theory 2 1968 265 283
27. R.E. Stearns, J. Hartmanis, and P.M. Lewis Hierarchies of memory limited computations Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design SWCT 1965, FOCS'65 1965 IEEE Computer Society Washington, DC, USA 179 190
28. N. Immerman Nondeterministic space is closed under complementation SIAM Journal on Computing 17 1988 935 938
29. V. Geffert Space hierarchy theorem revised Theoretical Computer Science 295 2003 171 187
30. D. Angluin, J. Aspnes, and D. Eisenstat Stably computable predicates are semilinear 25th annual ACM Symposium on Principles of Distributed Computing PODC 2006 ACM Press New York, NY, USA 292 299 (Pubitemid 44393718)
31. M. Alberts Space complexity of alternating turing machines L. Budach, Fundamentals of Computation Theory Lecture Notes in Computer Science vol. 199 1985 Springer Berlin, Heidelberg 1 7 10.1007/BFb0028785
32. A. Szepietowski Turing Machines with Sublogarithmic Space 1994 Springer-Verlag New York, Inc.