Mediated population protocols

Michail, Othon; Chatzigiannakis, Ioannis; Spirakis, Paul G.

doi:10.1016/j.tcs.2011.02.003

Cited by 73 publications

(46 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Semilinearity persists up to o(log log n) local space but not more than this [13]. If, additionally, the connections between processes can hold a state from a finite domain (note that this is a stronger requirement than the on/off that the present work assumes) then the computational power dramatically increases to the commutative subclass of NSPACE(n 2 ) [30]. Other important works include [25] which equipped the nodes of population protocols with unique identifiers (abbreviated "uids" or "ids" throughout) and [10] which introduced a (weak) notion of speed of the nodes that allowed the design of fast converging protocols with only weak requirements.…”

Section: Further Related Workmentioning

confidence: 87%

“…Population protocols Our model for shape construction is strongly inspired by the Population Protocol model [1] and the Mediated Population Protocol model [30]. In the former, connections do not have states.…”

Section: Further Related Workmentioning

confidence: 99%

“…The main difference to our model is that in those models the focus was on the computation of functions of some input values and not on network construction. Another important difference is that we allow the edges to choose between only two possible states which was not the case in [30]. Interestingly, when operating under a uniform random scheduler, population protocols are formally equivalent to a restricted version of stochastic chemical reaction networks (CRNs) which model chemistry in a wellmixed solution (see, e.g., [41]).…”

Section: Further Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Terminating distributed construction of shapes and patterns in a fair solution of automata

Michail

2017

Distrib. Comput.

Self Cite

View full text Add to dashboard Cite

In this work, we consider a solution of automata (or nodes) that move passively in a well-mixed solution without being capable of controlling their movement. Nodes can cooperate by interacting in pairs and every such interaction may result in an update of their local states. Additionally, the nodes may also choose to connect to each other in order to start forming some required structure. Such nodes can be thought of as small programmable pieces of matter, like tiny nanorobots or programmable molecules. The model that we introduce here is a more applied version of network constructors, imposing physical (or geometric) constraints on the connections that the nodes are allowed to form. Each node can connect to other nodes only via a very limited number of local ports. Connections are always made at unit distance and are perpendicular to connections of neighboring ports, which makes the model capable of forming 2D or 3D shapes. We provide direct constructors for some basic shape construction problems, like spanning line, spanning square, and self-replication. We then develop new techniques for determining the computational and constructive capabilities of our model. One of the main novelties of our approach is that of exploiting the assumptions that the system is well-mixed and has a unique leader, in order to give terminating protocols that are correct with high probability. This allows us to develop terminating subroutines that can be sequentially composed to form larger modular protocols. One of our main results is a terminating protocol counting the size n of the system with high probability. We then use this protocol as a subroutine in order to develop our universal constructors, establishing that it is possible for the nodes to become self-organized with high probability into arbitrarily complex shapes while still detecting termination of the construction.

show abstract

Section: Further Related Workmentioning

confidence: 87%

Section: Further Related Workmentioning

confidence: 99%

Section: Further Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Terminating distributed construction of shapes and patterns in a fair solution of automata

Michail

2017

Distrib. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Dynamic Distributed Networks. In recent years, there is a growing interest in distributed computing systems that are inherently dynamic [2,3,5,7,8,9,11,23,25,26,27,29,31]. Distance labelling.…”

Section: Other Related Workmentioning

confidence: 99%

Ephemeral networks with random availability of links: The case of fast networks

Akrida

Gąsieniec

Mertzios

et al. 2016

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details. This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Highlights• We define the Temporal Diameter (TD) and the expected TD of temporal networks with random availabilities of links• We define fast and slow random temporal networks, according to their expected TD• Random temporal networks on instances of dense (directed) random graphs G n,p are fast• We introduce the critical availability as a measure of periodic availability of links• We give a lower and an upper bound on the critical availability AbstractWe consider here a model of temporal networks, the links of which are available only at certain moments in time, chosen randomly from a subset of the positive integers. We define the notion of the Temporal Diameter of such networks. We also define fast and slow such temporal networks with respect to the expected value of their temporal diameter. We then provide a partial characterisation of fast random temporal networks. We also define the critical availability as a measure of periodic random availability of the links of a network, required to make the network fast. We finally give a lower bound as well as an upper bound on the (critical) availability.

show abstract

“…This result involves that an oracle is necessary for solving SSLE in population protocols. For the enhanced model of mediated population protocols -M P P (allowing an extra memory on every agent pair) [15], the work of Mizogushi et al [17] shows that (2/3)n agent states and a single bit memory on every agent pair are su cient to solve SSLE. They also show that there is no M P P that solves SSLE with any constant agent-states and any constant size memory on each agent-pair, for general n.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs

Beauquier

Blanchard

Burman

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper considers the fundamental problem of self-stabilizing leader election (SSLE) in the model of population protocols. In this model, an unknown number of asynchronous, anonymous and nite state mobile agents interact in pairs over a given communication graph. SSLE has been shown to be impossible in the original model. This impossibility can been circumvented by a modular technique augmenting the system with an oracle -an external module abstracting the added assumption about the system. Fischer and Jiang have proposed solutions to SSLE, for complete communication graphs and rings, using an oracle Ω?, called the eventual leader detector. In this work, we present a solution for arbitrary graphs, using a composition of two copies of Ω?. We also prove that the di culty comes from the requirement of self-stabilization, by giving a solution without oracle for arbitrary graphs, when an uniform initialization is allowed. Finally, we prove that there is no self-stabilizing implementation of Ω? using SSLE, in a sense we de ne precisely.

show abstract

Mediated population protocols

Cited by 73 publications

References 26 publications

Terminating distributed construction of shapes and patterns in a fair solution of automata

Terminating distributed construction of shapes and patterns in a fair solution of automata

Ephemeral networks with random availability of links: The case of fast networks

Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs

Contact Info

Product

Resources

About