Abstract
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates. The focus of this work is on the classical vertex coloring problem, that is a basic building block for many resource allocation problems arising in wireless sensor networks.
In this paper, we investigate the gain in complexity that can be obtained through randomization. We present a probabilistically self- stabilizing algorithm that uses k states per process, where k is a parameter of the algorithm. When k = Δ + 1, the algorithm recovers in expected O(Δn) actions. When k may grow arbitrarily, the algorithm recovers in expected O(n) actions in total. Thus, our algorithm can be made optimal with respect to space or time complexity. Our case study hints that randomization could help filling the complexity gap between bidirectionnal and unidirectionnal networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)
Bernard, S., Devismes, S., Potop-Butucaru, M.G., Tixeuil, S.: Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks. In: Proceedings of the IEEE International Conference on Parallel and Distributed Processing Systems (IPDPS 2009), Rome, Italy, May 2009. IEEE Press, Los Alamitos (2009)
Cobb, J.A., Gouda, M.G.: Stabilization of routing in directed networks. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 51–66. Springer, Heidelberg (2001)
Das, S.K., Datta, A.K., Tixeuil, S.: Self-stabilizing algorithms in dag structured networks. Parallel Processing Letters 9(4), 563–574 (1999)
Delaët, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revisited. Journal of Aerospace Computing, Information, and Communication (2006)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
Dolev, S., Schiller, E.: Self-stabilizing group communication in directed networks. Acta Inf. 40(9), 609–636 (2004)
Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distributed Computing 14(3), 147–162 (2001)
Ducourthial, B., Tixeuil, S.: Self-stabilization with path algebra. Theoretical Computer Science 293(1), 219–236 (2003); Extended abstract in Sirocco 2000
Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: International Conference on Principles of Distributed Systems (OPODIS 2000), Paris, France, December 2000, pp. 55–70 (2000)
Hald, A.: A history of probability and statistics and their applications before 1750. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, p. 586. John Wiley & Sons Inc., New York (1990) (A Wiley-Interscience Publication)
Mitton, N., Fleury, E., Guérin-Lassous, I., Séricola, B., Tixeuil, S.: On fast randomized colorings in sensor networks. In: Proceedings of ICPADS 2006, pp. 31–38. IEEE Computer Society Press, Los Alamitos (2006)
Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), p. 22. IEEE Computer Society Press, Los Alamitos (2002)
Norris, J.R.: Markov chains. Cambridge Series in Statistical and Probabilistic Mathematics, vol. 2. Cambridge University Press, Cambridge (1998); Reprint of 1997 original
Ross, S.M.: Introduction to probability models, 7th edn. Harcourt/Academic Press, Burlington (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernard, S., Devismes, S., Paroux, K., Potop-Butucaru, M., Tixeuil, S. (2010). Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)