Two Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management

Hedar, Abdel-Rahman; Ismail, Rashad; El-Sayed, Gamal A.; Khayyat, Khalid M. Jamil

doi:10.1007/s10922-018-9480-1

Cited by 13 publications

(15 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ASS-MCDS method is programmed using MATLAB. In this experimental section, the effectiveness of ASS-MCDS method is analyzed on several test graphs from the literature [1,11,12,21]. These graphs are given as ad hoc wireless network clustering instances, which are described in Table 1.…”

Section: Resultsmentioning

confidence: 99%

“…In this section, the algorithmic performance of the proposed method introduced in Algorithm 2 is investigated by comparing the results of ASS-MCDS against the results of other benchmark methods presented in [1,11,12,21]. To measure the performance of the ASS-MCDS, two different quantities are used to make comparisons: The maximum number of iterations for the ASS-MCDS is 20 for each graph.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…For the minimum weighted connected dominating set problem a hybrid population-based iterated greedy algorithm and a genetic algorithm are proposed by [22]. Two meta-heuristics, memetic, and simulated annealing with intensification search methods are presented in [11,12] to solve the MCDS problem for wireless networks design and management.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, acquiring an effective solution for the minimum connected dominating set problem is one of the significant research areas in graph theory [1]. Recently, several researches are moving towards the MCDS problem because of its various applications in wireless networks, facility locations, and operational research in computer science [9][10][11][12].…”

mentioning

confidence: 99%

See 3 more Smart Citations

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

et al. 2020

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Numerical Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

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

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a particular form of objective function, the pSSEF method uses a special fitness function to calculate the solution quality that increases the probability of finding successful solutions with better coverage and connectivity [ 31 , 45 , 46 ]. Superior guidance of the search using a well-defined fitness function can improve the obtained solutions within fewer iterations, therefore leading to savings in resource expense.…”

Section: Parallel Scatter Search Algorithm With Elite and Featuredmentioning

confidence: 99%

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search

Hedar

Abdulaziz

Mabrouk

et al. 2020

Sensors

Self Cite

View full text Add to dashboard Cite

In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.

show abstract

Opportunistic coding across on‐route dominating nodes in a flow‐oriented SDN enabled WSN

Singh

2023

Concurrency and Computation

View full text Add to dashboard Cite

Summary With the aid of network coding, numerous packets can be mixed at intermediary nodes if any encoding opportunity exists. However, it is challenging to choose intermediate relay nodes of probable opportunistic coding in distributed wireless networks. In this work, a wireless sensor network (WSN) is employed with a software defined network (SDN) architecture along with a connected dominating set (CDS)‐based routing technique. The SDN offers a centrally managed architecture that lowers energy usage and network traffic by reducing the controlling and managing overheads in sensory networks. In addition, the CDS‐based routing and the potential for opportunistic coding at dominant nodes are coupled to enhance network performance. The proposed CDS‐based flow‐oriented coding‐aware energy‐efficient routing (CFCER) is contrasted with existing traditional wireless sensor networks and software‐defined sensor networks in terms of throughput, packet delay, and energy usage. CFCER increases network throughput by 15% more than SDN‐based WSN and by about 25% more than traditional WSN. However, compared to standard WSN, a significant improvement was made in packet delay and energy conservation. Over SDN‐WSN, packet delay is reduced by about 18%, and the energy consumption is cut by 10%.

show abstract

Two Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management

Cited by 13 publications

References 43 publications

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

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

Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter Search

Opportunistic coding across on‐route dominating nodes in a flow‐oriented SDN enabled WSN

Contact Info

Product

Resources

About