2007 · 109 citations · 0 references
ComputingComputer ScienceDistributed SystemsMobile ComputingMobile SystemsAd Hoc Mobile NetworksComputational ModelingDistributed ComputingDistributed CoordinationMobile Ad Hoc NetworksMobile NetworksAd Hoc Network ProtocolsAd Hoc NetworksAgent Communication ModelsAgent-based Population ModelsChemical Reaction NetworksFairnessFairness Constraints
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.