Restricted swap-based neighborhood search for the minimum connected dominating set problem

The minimum connected dominating set problem (MCDSP) has become increasingly important in recent years due to its applicability to mobile ad hoc networks and sensor grids. This paper presents a restricted swap-based neighborhood (RSN) tailored for solving MCDSP. This novel neighborhood structure is embedded into tabu Search (TS) and a perturbation mechanism is employed to enhance diversification. The proposed RSN-TS algorithm is tested on four sets of public benchmark instances widely used in the literature. The results demonstrate the efficacy of the proposed algorithm in terms of both solution quality and computational efficiency. In particular, the RSN-TS algorithm was able to improve the best known results on 41 out of the 97 problem instances while matching the best known results on all the remaining 56 instances. Furthermore, the article analyzes some key features of the proposed approach in order to identify its critical success factors. © 2017 Wiley Periodicals, Inc. NETWORKS, 2017

[1]  Sergiy Butenko,et al.  Graph Domination, Coloring and Cliques in Telecommunications , 2006, Handbook of Optimization in Telecommunications.

[2]  Jiguo Yu,et al.  Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey , 2013, Comput. Commun..

[3]  Tetsuya Fujie,et al.  An exact algorithm for the maximum leaf spanning tree problem , 2003, Comput. Oper. Res..

[4]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[5]  Vic Grout,et al.  Metaheuristics for Wireless Network Optimisation , 2007, The Third Advanced International Conference on Telecommunications (AICT'07).

[6]  Chittaranjan A. Mandal,et al.  Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[7]  T. C. Edwin Cheng,et al.  A tabu search/path relinking algorithm to solve the job shop scheduling problem , 2014, Comput. Oper. Res..

[8]  Jin-Kao Hao,et al.  Breakout local search for the quadratic assignment problem , 2013, Appl. Math. Comput..

[9]  S. Raghavan,et al.  The regenerator location problem , 2010 .

[10]  Ruay-Shiung Chang,et al.  A weight-value algorithm for finding connected dominating sets in a MANET , 2012, J. Netw. Comput. Appl..

[11]  Alexandre Salles da Cunha,et al.  The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm , 2011, INOC.

[12]  Jin-Kao Hao,et al.  Breakout Local Search for the Max-Cutproblem , 2013, Eng. Appl. Artif. Intell..

[13]  Abilio Lucena,et al.  Reformulations and solution algorithms for the maximum leaf spanning tree problem , 2010, Comput. Manag. Sci..

[14]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[15]  Tetsuya Fujie,et al.  The maximum‐leaf spanning tree problem: Formulations and facets , 2004, Networks.

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

[17]  Ding-Zhu Du,et al.  On the construction of 2-connected virtual backbone in wireless networks , 2009, IEEE Transactions on Wireless Communications.

[18]  Jin-Kao Hao,et al.  Breakout Local Search for maximum clique problems , 2013, Comput. Oper. Res..

[19]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[20]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[21]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[22]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[23]  Tao Ye,et al.  GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks , 2015, Comput. Networks.

[24]  Alexandre Salles da Cunha,et al.  Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem , 2014, INFORMS J. Comput..

[25]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[26]  Milan Tuba,et al.  Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem , 2013, Comput. Sci. Inf. Syst..

[27]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

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

[29]  Xiaohua Jia,et al.  Virtual backbone construction in multihop ad hoc wireless networks , 2006, Wirel. Commun. Mob. Comput..

[30]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.