Amortized efficiency of list update and paging rules
Communications of the ACM
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Competitive Analysis of Distributed Algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Exploiting mobility for energy efficient data collection in wireless sensor networks
Mobile Networks and Applications
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Wireless Communications & Mobile Computing - Wireless Ad Hoc and Sensor Networks
Timeliness-based wait-freedom: a gracefully degrading progress condition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Proceedings of the 28th ACM symposium on Principles of distributed computing
Meteorology and hydrology in Yosemite national park: a sensor network application
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
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
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Self-stabilizing counting in mobile sensor networks with a base station
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Improving space complexity of self-stabilizing counting on mobile sensor networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Computing time complexity of population protocols with cover times: the zebranet example
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Computing with pavlovian populations
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
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
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Theoretical Computer Science
Hi-index | 0.00 |
Population protocols are a model presented recently for networks with a very large, possibly unknown number of mobile agents having small memory. This model has certain advantages over alternative models (such as DTN) for such networks. However, it was shown that the computational power of this model is limited to semi-linear predicates only. Hence, various extensions were suggested. We present a model that enhances the original model of population protocols by introducing a (weak) notion of speed of the agents. This enhancement allows us to design fast converging protocols with only weak requirements (for example, suppose that there are different types of agents, say agents attached to sick animals and to healthy animals, two meeting agents just need to be able to estimate which of them is faster, e.g., using their types, but not to actually know the speeds of their types). Then, using the new model, we study the gathering problem, in which there is an unknown number of anonymous agents that have values they should deliver to a base station (without replications). We develop efficient protocols step by step searching for an optimal solution and adapting to the size of the available memory. The protocols are simple, though their analysis is somewhat involved. We also present a more involved result - a lower bound on the length of the worst execution for any protocol. Our proofs introduce several techniques that may prove useful also in future studies of time in population protocols.