Next Article in Journal
Approximation Algorithm for Shortest Path in Large Social Networks
Previous Article in Journal
Using Biased-Randomized Algorithms for the Multi-Period Product Display Problem with Dynamic Attractiveness
Open AccessArticle

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

1
Department of Computer Science in Jamoum, Umm Al-Qura University, 25371 Makkah, Saudi Arabia
2
Department of Computer Science, Faculty of Computers & Information, Assiut University, 71526 Assiut, Egypt
3
Center for Middle Eastern Studies, Lund University, SE-22100 Lund, Sweden
4
Department of Mathematics, Faculty of Science, Assiut University, 71516 Assiut, Egypt
5
Electrical Engineering Department, Assiut University, 71516 Assiut, Egypt
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(2), 35; https://doi.org/10.3390/a13020035
Received: 28 December 2019 / Revised: 31 January 2020 / Accepted: 3 February 2020 / Published: 4 February 2020
An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the searching space for finding a route is restricted to nodes in this MCDS. Thus, finding MCDS in a WSN provides a flexible low-cost solution for the problem of event monitoring, particularly in places with limited or dangerous access to humans as is the case for most WSN deployments. In this paper, we proposed an adaptive scatter search (ASS-MCDS) algorithm that finds the near-optimal solution to this problem. The proposed method invokes a composite fitness function that aims to maximize the solution coverness and connectivity and minimize its cardinality. Moreover, the ASS-MCDS methods modified the scatter search framework through new local search and solution update procedures that maintain the search objectives. We tested the performance of our proposed algorithm using different benchmark-test-graph sets available in the literature. Experiments results show that our proposed algorithm gave good results in terms of solution quality.
Keywords: dominating sets; minimum connected dominating sets; scatter search; local search; wireless network design dominating sets; minimum connected dominating sets; scatter search; local search; wireless network design
MDPI and ACS Style

Hedar, A.-R.; Abdulaziz, S.N.; Sewisy, A.A.; El-Sayed, G.A. Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks. Algorithms 2020, 13, 35.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop