Simple and efficient local codes for distributed stable network construction

DOI10.1007/S00446-015-0257-4MaRDI QIDQ6829894zbMATH OpenFDO

Authors Othon Michail, P. G. Spirakis

Publication date 5 July 2016

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00446-015-0257-4

zbMATH Keywords

distributed network constructiondistributed protocolfairnesshomogeneous populationinteracting automatarandom scheduleself-organizationstabilizationstructure formation

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(4)

• All for one and one for all: an O(1)-musketeers generic transformation for rotating robots
• Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes
• Complete graph identification in population protocols
• Local mutual exclusion for dynamic, anonymous, bounded memory message passing systems

This page was built for publication: Simple and efficient local codes for distributed stable network construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829894)