A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

Authors:
Tetz C. Huang;Ji-Cherng Lin;Chih-Yuan Chen;Cheng-Pin Wang
Affiliations:
Department of Computer Science and Engineering, Yuan-Ze University, 135 Yuan-Tung Road, Chung-Li, Tao-Yuan 320, Taiwan;Department of Computer Science and Engineering, Yuan-Ze University, 135 Yuan-Tung Road, Chung-Li, Tao-Yuan 320, Taiwan;Department of Computer Science and Engineering, Yuan-Ze University, 135 Yuan-Tung Road, Chung-Li, Tao-Yuan 320, Taiwan;Department of Computer Science and Engineering, Yuan-Ze University, 135 Yuan-Tung Road, Chung-Li, Tao-Yuan 320, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 6
Cited 5

A belated proof of self-stabilization

Distributed Computing
Token Systems That Self-Stabilize

IEEE Transactions on Computers
Self-stabilizing systems in spite of distributed control

Communications of the ACM
1983 Invited address solved problems, unsolved problems and non-problems in concurrency

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set

IEEE Transactions on Parallel and Distributed Systems
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Computers & Mathematics with Applications

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

Journal of Parallel and Distributed Computing
Efficient transformation of distance-2 self-stabilizing algorithms

Journal of Parallel and Distributed Computing
The Worst-Case Stabilization Time of a Self-Stabilizing Algorithm under the Weakly Fair Daemon Model

International Journal of Artificial Life Research
A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks

ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.09

Visualization

Abstract

A 2-dominating set in a distributed system is a set of processors such that each processor outside the set has at least two neighbors in the set. In applications, a 2-dominating set can be considered as an ideal place in the system for allocating resources, and a minimal 2-dominating set allows for the minimum of resources to be allocated. Since a maximal independent set can be viewed as a minimal 1-dominating set, the problem of finding a minimal 2-dominating set extends the problem of finding a maximal independent set in some sense. The distributed demon model for self-stabilizing systems is a natural generalization of the central demon model introduced by Dijkstra. In the past, only a few self-stabilizing algorithms under the distributed demon model have been obtained without using any transformer, and most of these algorithms are for ring networks only. In this paper, we propose a self-stabilizing algorithm that can find a minimal 2-dominating set in any general network in which the distributed demon model is assumed. This proposed algorithm is not obtained via any transformer. We also verify the correctness of the proposed algorithm.