A self-stabilizing minimal dominating set algorithm with safe convergence

Authors:
Hirotsugu Kakugawa;Toshimitsu Masuzawa
Affiliations:
Department of Computer Science, Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan;Department of Computer Science, Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 7
Cited 10

Fault-containing self-stabilizing algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fundamentals of fault-tolerant distributed computing in asynchronous environments

ACM Computing Surveys (CSUR)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Stabilization of general loop-free routing

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A framework of safe stabilization

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Route preserving stabilization

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems

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

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Robust self-stabilizing weight-based clustering algorithm

Theoretical Computer Science
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
Best-effort group service in dynamic networks

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Robust self-stabilizing construction of bounded size weight-based clusters

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Loop-free super-stabilizing spanning tree construction

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Robust self-stabilizing clustering algorithm

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing wireless connected overlays

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs

Theoretical Computer Science
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.