Selected papers of the Second Workshop on Concurrency and compositionality
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Smart dust protocols for local detection and propagation
Proceedings of the second ACM international workshop on Principles of mobile computing
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A survey of basic net models and modular net classes
Advances in Petri Nets 1992, The DEMON Project
Lightweight sensing and communication protocols for target enumeration and aggregation
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Fast and lean self-stabilizing asynchronous protocols
SFCS '94 Proceedings of the 35th Annual Symposium on 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 population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the computational capabilities of several models
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Secretive birds: privacy in population protocols
OPODIS'07 Proceedings of the 11th international conference on Principles 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
Storage capacity of labeled graphs
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Theoretical Computer Science
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
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles 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
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Computing with pavlovian populations
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
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
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Effective storage capacity of labeled graphs
Information and Computation
| Hi-index | 0.01 |
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what properties of the network graph can be stably computed by the devices. We show that they can detect whether the network has degree bounded by a constant d, and, if so, organize a computation that achieves asymptotically optimal linear memory use. We define a model of stabilizing inputs to such devices and show that a large class of predicates of the multiset of final input values are stably computable in any weakly-connected network. We also show that nondeterminism in the transition function does not increase the class of stably computable predicates.