Abstract
In wireless ad hoc or sensor networks, a connected dominating set (CDS) is useful as the virtual backbone because there is no fixed infrastructure or centralized management. Safe converging self-stabilization is one extension of self-stabilization, that is, self-stabilization guarantees the system tolerates any kind and any finite number of transient faults and doesn’t need any initialization. The safe convergence property guarantees that the system quickly converges to a safe configuration, and then, the system configuration becomes to an optimal configuration without breaking safety. However, the previous works on safe converging algorithm for the minimum CDS assumed a phase clock synchronizer, this is a very strong assumption. In this paper, we propose the first asynchronous self-stabilizing (6 + ε)-approximation algorithm with safe convergence for the minimum CDS in the networks modeled by unit disk graphs. The first convergence time to a safe configuration in which a dominating set is computed is 1 round, and the second convergence time to an optimal configuration in which an approximation of the minimum CDS is constructed is O( max {d 2,n}) rounds, O(n 6) steps.
This work is supported in part by KAKENHI No. 22700074, No. 22700017 and No. 23700019.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1990)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)
Kakuagwa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: Proceedings of the 8th IPDPS Workshop on Advances in Parallel and Distributed Computational Model, p. 263 (2006)
Jain, A., Gupta, A.: A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In: Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 615–619 (2005)
Drabkin, V., Friedman, R., Gradinariu, M.: Self-stabilizing wireless connected overlays. In: Shvartsman, A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 425–439. Springer, Heidelberg (2006)
Kamei, S., Kakugawa, H.: A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS Workshop on Advances in Parallel and Distributed Computational Models, p. 224 (2007)
Kamei, S., Kakugawa, H.: A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graph. Theoretical Computer Science 428, 80–90 (2012)
Herman, T.: Phase clocks for transient fault repair. IEEE Transactions on Parallel and Distributed Systems 11(10), 1048–1057 (2000)
Berge, C.: Theory of Graphs and its Applications. Methuen (1962)
Cournier, A., Rovedakis, S., Villain, V.: The first fully polynomial stabilizing algorithm for bfs tree construction. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 159–174. Springer, Heidelberg (2011)
Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications 9(2), 141–149 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Kamei, S., Izumi, T., Yamauchi, Y. (2013). An Asynchronous Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2013. Lecture Notes in Computer Science, vol 8255. Springer, Cham. https://doi.org/10.1007/978-3-319-03089-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-03089-0_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03088-3
Online ISBN: 978-3-319-03089-0
eBook Packages: Computer ScienceComputer Science (R0)