A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Authors:
Volker Turau;Bernd Hauck
Affiliations:
Hamburg University of Technology, Institute of Telematics, Schwarzenbergstraße 95, 21073 Hamburg, Germany;Hamburg University of Technology, Institute of Telematics, Schwarzenbergstraße 95, 21073 Hamburg, Germany
Venue:
Information Processing Letters
Year:
2009

Citing 10
Cited 2

A self-stabilizing algorithm for constructing breadth-first trees

Information Processing Letters
On weakly connected domination in graphs

Discrete Mathematics
Self-stabilization

Self-stabilization
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

Information Processing Letters
Conflict Managers for Self-stabilization without Fairness Assumption

ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set

ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Distance- k knowledge in self-stabilizing algorithms

Theoretical Computer Science
A key-predistribution-based weakly connected dominating set for secure clustering in DSN

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Finding minimum weight connected dominating set in stochastic graph based on learning automata

Information Sciences: an International Journal
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.90

Visualization

Abstract

This paper presents a new distributed self-stabilizing algorithm for the weakly connected minimal dominating set problem. It assumes a self-stabilizing algorithm to compute a breadth-first tree. Using an unfair distributed scheduler the algorithm stabilizes in at most O(nmA) moves, where A is the number of moves to construct a breadth-first tree. All previously known algorithms required an exponential number of moves.