Abstract
This article studies self-stabilization in networks of anonymous, asynchronously interacting nodes where the size of the network is unknown. Constant-space protocols are given for Dijkstra-style round-robin token circulation, leader election in rings, two-hop coloring in degree-bounded graphs, and establishing consistent global orientation 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.
- Angluin, D., Aspnes, J., Chan, M., Fischer, M. J., Jiang, H., and Peralta, R. 2005. Stably computable properties of network graphs. In Proceedings of the Distributed Computing in Sensor Systems: 1st IEEE International Conference On Distributed (DCOSS'05). V. K. Prasanna, S. Iyengar, P. Spirakis, and M. Welsh, Eds. Lecture Notes in Computer Science, vol. 3560. Springer-Verlag, Berlin, Germany, 63--74. Google Scholar
Digital Library
- Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M. J., and Peralta, R. 2006. Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 4, 235--253. Google Scholar
Digital Library
- Angluin, D., Aspnes, J., Eisenstat, D., and Ruppert, E. 2007. The computational power of population protocols. Distrib. Comput. 20, 4, 279--304.Google Scholar
Digital Library
- Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., and Reischuk, R. 1987. Achievable cases in an asynchronous environment. In Proceedings of the 28th Annual Symposium on the Foundations of Computer Science (FOCS). IEEE Computer Society, Los Alamitos, CA, 337--346. Google Scholar
Digital Library
- Beauquier, J., Gradinariu, M., and Johnen, C. 1999. Memory space requirements for self-stabilizing leader election protocols. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing. ACM, New York, NY, 199--207. Google Scholar
Digital Library
- Dijkstra, E. W. 1974. Self-stabilizing systems in spite of distributed control. Comm. ACM 17, 11, 643--644. Google Scholar
Digital Library
- Dolev, S., Israeli, A., and Moran, S. 1997. Uniform dynamic self-stabilizing leader election. IEEE Trans. Parall. Distrib. Syst. 8, 424--440. Google Scholar
Digital Library
- Gouda, M. G. and Haddix, F. F. 1996. The stabilizing token ring in three bits. J. Parall. Distrib. Comput. 35, 1, 43--48. Google Scholar
Digital Library
- Gradinariu, M. and Johnen, C. 2001. Self-stabilizing neighborhood unique naming under unfair scheduler. Lecture Notes in Computer Science, vol. 2150, Springer, Berlin, Germany. 458--465. Google Scholar
Digital Library
- Griggs, J. R. and Yeh, R. K. 1992. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5, 4, 586--595. Google Scholar
Digital Library
- Herman, T. 1990. Probabilistic self-stabilization. Inform. Process. Lett. 35, 2, 63--67. Google Scholar
Digital Library
- Herman, T. and Tixeuil, S. 2004. A distributed TDMA slot assignment algorithm for wireless sensor networks. Lecture Notes in Computer Science, vol. 3121, Springer, Berlin, Germany. 45--58.Google Scholar
- Higham, L. and Myers, S. 1999. Self-stabilizing token circulation on anonymous message passing rings. Tech. Rep., University of Calgary.Google Scholar
- Itkis, G. and Levin, L. A. 1994. Fast and lean self-stabilizing asynchronous protocols. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, CA, 226--239. Google Scholar
Digital Library
- Itkis, G., Lin, C., and Simon, J. 1995. Deterministic, constant space, self-stabilizing leader election on uniform rings. In Proceedings of the 9th International Workshop on Distributed Algorithms (WDAC). Springer, Berlin, Germany. 288--302. Google Scholar
Digital Library
- Johnen, C. 2004. Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings. In Procedings of the 18th International Parallel and Distributed Processing Symposium. IEEE Computer Society, Los Alamitos, CA.Google Scholar
Cross Ref
- Mayer, A., Ofek, Y., Ostrovsky, R., and Yung, M. 1992. Self-stabilizing symmetry breaking in constant-space (extended abstract). In Proceedings of the 24th ACM Symposium on Theory of Computing. ACM, New York, NY, 667--678. Google Scholar
Digital Library
- Moscibroda, T. and Wattenhofer, R. 2005. Coloring unstructured radio networks. In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, New York, NY, 39--48. Google Scholar
Digital Library
Index Terms
Self-stabilizing population protocols
Recommendations
A combinatorial characterization of self-stabilizing population protocols
AbstractWe characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of N finite state agents in which a malicious scheduler selects an ...
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06: Proceedings of the 10th international conference on Principles of Distributed SystemsThis paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a ...
Fault-containing self-stabilizing distributed protocols
Self-stabilization is an elegant approach for designing a class of fault-tolerant distributed protocols. A self-stabilizing protocol is guaranteed to eventually converge to a legitimate state after a transient fault. However, even a minor transient ...






Comments