An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs

Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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{d2, n}) rounds, O (n6) steps.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings
Pages251-265
Number of pages15
DOIs
Publication statusPublished - 2013
Event15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013 - Osaka, Japan
Duration: Nov 13 2013Nov 16 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8255 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013
CountryJapan
CityOsaka
Period11/13/1311/16/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs'. Together they form a unique fingerprint.

  • Cite this

    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 Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS 2013, Proceedings (pp. 251-265). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8255 LNCS). https://doi.org/10.1007/978-3-319-03089-0_18