Turing Machines with Sublogarithmic Space
Turing Machines with Sublogarithmic Space
Space complexity of alternating Turing machines
FCT '85 Fundamentals of Computation Theory
Space hierarchy theorem revised
Theoretical Computer Science - Mathematical foundations of computer science
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Self-stabilizing counting in mobile sensor networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a new theoretical model for passively mobile Wireless Sensor Networks, called PM, standing for Passively mobile Machines. The main modification w.r.t. the Population Protocol model [Angluin et al. 2006] is that the agents now, instead of being automata, are Turing Machines. We provide general definitions for unbounded memories, but we are mainly interested in computations upper-bounded by plausible space limitations. However, we prove that our results hold for more general cases. We focus on complete interaction graphs and define the complexity classes PM-SPACE(f(n)) parametrically, consisting of all predicates that are stably computable by some PM protocol that uses O(f(n)) memory in each agent. We provide a protocol that generates unique identifiers from scratch only by using O(log n) memory, and use it to provide an exact characterization of the classes PMSPACE(f(n)) when f(n) = Ω(log n): they are precisely the classes of all symmetric predicates in NSPACE(nf(n)). As a consequence, we obtain a space hierarchy of the PM model when the memory bounds are Ω(log n). Finally, we establish that the minimal space requirement for the computation of non-semilinear predicates is O(log log n).