An Efficient Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks

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 MCDS. Keywords—ad hoc wireless networks, dominating sets, unit disk graphs, heuristic.

[1]  Jiguo Yu,et al.  Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks , 2010, WASA.

[2]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[3]  Wayne J. Pullan,et al.  Phased local search for the maximum clique problem , 2006, J. Comb. Optim..

[4]  Panos M. Pardalos,et al.  A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2004 .

[5]  K. Katayama,et al.  Iterated local search approach using genetic transformation to the traveling salesman problem , 1999 .

[6]  T. Ibaraki,et al.  A Variable Depth Search Algorithm for the Generalized Assignment Problem , 1999 .

[7]  Wayne J. Pullan,et al.  Approximating the maximum vertex/edge weighted clique using local search , 2008, J. Heuristics.

[8]  Panos M. Pardalos,et al.  Wireless networking, dominating and packing , 2010, Optim. Lett..

[9]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Wei Wang,et al.  A PTAS for minimum d-hop connected dominating set in growth-bounded graphs , 2010, Optim. Lett..

[11]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[12]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Kengo Katayama,et al.  An effective local search for the maximum clique problem , 2005, Inf. Process. Lett..

[15]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[16]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[17]  Kazuya Sakai,et al.  Timer-Based CDS Construction in Wireless Ad Hoc Networks , 2011, IEEE Transactions on Mobile Computing.

[18]  Laura A. Sanchis,et al.  Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem , 2002, Algorithmica.

[19]  Bernd Freisleben,et al.  Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..

[20]  P. Merz,et al.  Memetic algorithms for the unconstrained binary quadratic programming problem. , 2004, Bio Systems.

[21]  Bo Han,et al.  Zone-based virtual backbone formation in wireless ad hoc networks , 2009, Ad Hoc Networks.