A New Heuristic Approach for Minimum Connected Dominating Set In Adhoc Wireless Networks

The Connected Dominating Set (CDS) of a graph acts as a virtual backbone in ad-hoc wireless network. In this paper, a simple and efficient algorithm is proposed for the determination of CDS in a graph. The algorithm starts by finding a root node in the graph; a priority queue is maintained centrally to decide whether an element would be a part of CDS. This concept is extended to distributed version of the algorithm where each dominated node maintains a priority queue and acts as dominator for its local domain only. Simulation results show that the proposed approach is very efficient in determining CDS especially in large and dense graphs.