A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence

  • Authors:

  • Sayaka Kamei;Hirotsugu Kakugawa

  • Affiliations:

  • Dept. of Information Engineering, Graduate School of Engineering, Hiroshima University, Hiroshima, Japan 739-8527;Dept. of Computer Science, Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 560-8531

  • Venue:
  • OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In wireless ad hoc or sensor networks, a connected dominating set is useful as the virtual backbone because there is no fixed infrastructure or centralized management. Additionally, in such networks, transient faults and topology changes occur frequently. A self-stabilizing system tolerates any kind and any finite number of transient faults, and does not need any initialization. An ordinary self-stabilizing algorithm has no safety guarantee and requires that the network remains static during converging to the legitimate configuration. Safe converging self-stabilization is one of the extension of self-stabilization which is suitable for dynamic networks such that topology changes and transient faults occur frequently. The safe convergence property guarantees that the system quickly converges to a safe configuration, and then, it moves to an optimal configuration without breaking safety. In this paper, we propose a self-stabilizing 7.6-approximation algorithm with safe convergence for the minimum connected dominating set in the networks modeled by unit disk graphs.