A self-stabilizing minimal dominating set algorithm with safe convergence

A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory corruption. In this paper, we formulate a concept of safe convergence in the framework of self-stabilization. An ordinary self-stabilizing algorithm has no safety guarantee while it is in converging from any initial configuration. The safe convergence property guarantees that a system quickly converges to a safe configuration, and then, it gracefully moves to an optimal configuration without breaking safety. Then, we propose a minimal independent dominating set algorithm with safe convergence property. Especially, the proposed algorithm computes the lexicographically first minimal independent dominating set according to the process identifier as a priority. The priority scheme can be arbitrarily changed such as stability, battery power and/or computation power of node.

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Hirotsugu Kakugawa, Toshimitsu Masuzawa
• Keywords: Distributed And Parallel Computing, IPPS 2006, Minimal Independent Dominating, Safe Convergence, Safe Convergence Property