Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered. Dijkstra-style round-robin token circulation can be done deterministically with constant space per node in this model. Constant-space protocols are given for leader election in rings, local-addressing in degree-bounded graphs, and establishing consistent global direction in an undirected ring. A protocol to construct a spanning tree in regular graphs using O(log D) memory is also given, where D is the diameter of the graph. A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under which protocol composition preserves behavior are used in proving their correctness. © Springcr-Vcrlag Berlin Heidelbcrg 2006.
CITATION STYLE
Anghuin, D., Aspnes, J., Fischer, M. J., & Jiang, H. (2006). Self-stabilizing population protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3974 LNCS, pp. 103–117). https://doi.org/10.1007/11795490_10
Mendeley helps you to discover research relevant for your work.