In this paper, the authors propose genetic algorithm for reducing connected dominating set in wireless ad hoc networks. Virtual backbone will be formed to count connected dominating set. It shows that the connected dominating size is reduced in their virtual backbone. It solves the problem of flooding. They use concept of unit disk graph from graph theory to solve their example. They finally prove that the Minimum Connected Dominating Set (MCDS) is NP-complete. Their approach is for solving this problem by considering weight for the vertices.