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{d2, n}) rounds, O (n6) steps. © Springer International Publishing 2013.
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8255 LNCS, pp. 251–265). https://doi.org/10.1007/978-3-319-03089-0_18
Mendeley helps you to discover research relevant for your work.