Selected papers of the Second Workshop on Concurrency and compositionality
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Ordered Slicing of Very Large-Scale Overlay Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Distributed Slicing in Dynamic Systems
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
The Dynamics of Probabilistic Population Protocols
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
IEEE Transactions on Computers
Algorithmic verification of population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Theoretical Computer Science
On the number of binary-minded individuals required to compute 12
Theoretical Computer Science
Guidelines for the Verification of Population Protocols
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing 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
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Computing with pavlovian populations
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
We define a general model capturing the behavior of a population of anonymous agents that interact in pairs. This model captures some of the main features of opportunistic networks, in which nodes (such as the ones of a mobile ad hoc networks) meet sporadically. For its reminiscence to Population Protocol, we call our model Large-Population Protocol, or LPP. We are interested in the design of LPPs enforcing, for every ν∈[0,1], a proportion ν of the agents to be in a specific subset of marked states, when the size of the population grows to infinity; In which case, we say that the protocol computesν. We prove that, for every ν∈[0,1], ν is computable by a LPP if and only if ν is algebraic. Our positive result is constructive. That is, we show how to construct, for every algebraic number ν∈[0,1], a protocol which computes ν.