Abstract
Population protocols are used as a theoretical model for a collection (or population) of tiny mobile agents that interact with one another to carry out a computation. The agents are identically programmed finite state machines. Input values are initially distributed to the agents, and pairs of agents can exchange state information with other agents when they are close together. The movement pattern of the agents is unpredictable, but subject to some fairness constraints, and computations must eventually converge to the correct output value in any schedule that results from that movement. This framework can be used to model mobile ad hoc networks of tiny devices or collections of molecules undergoing chemical reactions. This chapter surveys results that describe what can be computed in various versions of the population protocol model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aspnes, J., Ruppert, E. (2009). An Introduction to Population Protocols. In: Garbinato, B., Miranda, H., Rodrigues, L. (eds) Middleware for Network Eccentric and Mobile Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89707-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-89707-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89706-4
Online ISBN: 978-3-540-89707-1
eBook Packages: Computer ScienceComputer Science (R0)