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

Research output: Contribution to journalArticle

Abstract

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.

Details

Authors
Organisations
External organisations
  • Assiut University
  • Umm al-Qura University
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Communication Systems

Keywords

  • dominating sets, minimum connected dominating sets, scatter search, local search, wireless network design
Original languageEnglish
Number of pages15
JournalAlgorithms
Volume13
Issue number2
Publication statusPublished - 2020 Feb 4
Publication categoryResearch
Peer-reviewedYes

Total downloads

No data available