A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph

Authors:
Ankur Jain;Arobinda Gupta
Affiliations:
Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India
Venue:
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Year:
2005

Citing 0
Cited 5

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
A self-stabilizing distributed algorithm for minimum connected dominating sets in wireless sensor networks with different transmission ranges

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
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
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A connected dominating set of a graph G is a set of nodes of G such that every node in G is either in the set or is adjacent to some node in the set, and the graph induced by the elements of the set is connected. Connected dominating sets have major applications in routing in wireless ad-hoc networks. In this paper, we present a distributed self-stabilizing algorithm for finding a connected dominating set of a graph. Starting from an arbitrary initial state, the algorithm finds a connected dominating set in O(N^2) time, where N is the number of nodes. We also show detailed simulation results to indicate that in practice, the algorithm finds small-sized connected dominating sets in a short time.