@article{(Open Science Index):https://publications.waset.org/pdf/2907, title = {An Efficient Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks}, author = {S. Balaji and N. Revathi}, country = {}, institution = {}, abstract = {Connected dominating set (CDS) problem in unit disk graph has signi£cant impact on an ef£cient design of routing protocols in wireless sensor networks, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, a simple and ef£cient heuristic method is proposed for £nding a minimum connected dominating set (MCDS) in ad hoc wireless networks based on the new parameter support of vertices. With this parameter the proposed heuristic approach effectively £nds the MCDS of a graph. Extensive computational experiments show that the proposed approach outperforms the recently proposed heuristics found in the literature for the MCD}, journal = {International Journal of Mathematical and Computational Sciences}, volume = {6}, number = {8}, year = {2012}, pages = {1003 - 1009}, ee = {https://publications.waset.org/pdf/2907}, url = {https://publications.waset.org/vol/68}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 68, 2012}, }