Nondeterministic space is closed under complementation
SIAM Journal on Computing
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
The Dynamics of Probabilistic Population Protocols
DISC '08 Proceedings of the 22nd international symposium on 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
Recent Advances in Population Protocols
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Sensor Field: A Computational Model
Algorithmic Aspects of Wireless Sensor Networks
Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithmic verification of population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Stably decidable graph languages by mediated population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
The computational power of simple protocols for self-awareness on graphs
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Computing with large populations using interactions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Terminating population protocols via some minimal global knowledge assumptions
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Temporal network optimization subject to connectivity constraints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Theoretical Computer Science
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing
Hi-index | 5.23 |
We extend here the Population Protocol (PP) model of Angluin et al. (2004, 2006) [2,4] in order to model more powerful networks of resource-limited agents that are possibly mobile. The main feature of our extended model, called the Mediated Population Protocol (MPP) model, is to allow the edges of the interaction graph to have states that belong to a constant-size set. We then allow the protocol rules for pairwise interactions to modify the corresponding edge state. The descriptions of our protocols preserve both the uniformity and anonymity properties of PPs, that is, they do not depend on the size of the population and do not use unique identifiers. We focus on the computational power of the MPP model on complete interaction graphs and initially identical edges. We provide the following exact characterization of the class MPS of stably computable predicates: a predicate is in MPS iff it is symmetric and is in NSPACE(n^2).