Improved NSGA-II for Minimum Weight Minimum Connected Dominating Set Problem

Dahmri, Hayet; Bouamama, Salim

doi:10.1007/978-3-030-58861-8_18

Cited by 4 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BF algorithm checks all possible power set of nodes (2 n ) and outputs the WCVC solution having the smallest weight. The algorithms are tested on dataset used in [53], [56]. This dataset is randomly generated to test graph theoretic problems on WSNs [53].…”

Section: Performance Evaluationsmentioning

confidence: 99%

“…In this manner, we did not execute BF algorithm in these topologies. We set the parameters of the proposed HGA according to the extensive experimental evaluations given in recent studies [53], [56], [57]. In this manner, the population size (size), the maximum iteration count (I max ), crossover probability (pr c ), selection probability (pr s ), mutation probability (pr i ), repair probability (pr e ) and minimization probability (pr i ) are given as 100, 200, 0.9, 0.9, 0.8, 0.005, 0.7 and 0.6, respectively.…”

Section: Performance Evaluationsmentioning

confidence: 99%

See 1 more Smart Citation

Weighted Connected Vertex Cover Based Energy-Efficient Link Monitoring for Wireless Sensor Networks Towards Secure Internet of Things

Dagdeviren

2021

IEEE Access

View full text Add to dashboard Cite

Industry 4.0 utilizes the Internet of Things (IoT) to rise the efficiency in manufacturing and automation where wireless sensor networks (WSNs) are crucial technologies for communication layer of IoT. WSNs include hundreds of small sized sensor nodes that have the abilities of wireless transmission and environmental sensing. Wireless transmission is prone to various attacks such as data manipulation since data communication is achieved through transfer of radio packets. A countermeasure of this issue is link monitoring by deploying secure points that can physically capture and inspect radio packets. Graph theory plays a critical role to solve various problems in WSNs. Finding minimum Vertex Cover (VC) is an important NP-Hard graph theoretic problem in which the minimum set of nodes (vertices) is aimed to select in such a way that each link should be incident to at least one node from this set. VC is a significant structure for WSNs where it perfectly fits for link monitoring when nodes in VC are set as secure points (monitors). Since sensor nodes are generally battery-powered and have limited transmission range, energy-efficient multi-hop communication to the sink node is of utmost importance. In weighted connected VC (WCVC) structure, subgraph induced by monitor nodes are connected where monitors are chosen according to their weights. When weights of nodes are assigned as reciprocal of their energies, an energy-efficient virtual backbone can be formed. We propose a novel metaheuristic WCVC algorithm for link monitoring and backbone formation in WSNs modeled as undirected graphs. Our proposed algorithm integrates a genetic search with a greedy heuristic to improve WCVC solution quality and decrease the search time. To evaluate the efficiencies of greedy heuristics, we adopt three different heuristics for WCVC problem. We implement our algorithm with its counterparts and reveal that the algorithm is favorable in terms of solution quality and resource consumption. INDEX TERMS Internet of things, wireless sensor networks, link monitoring, vertex cover, metaheuristic algorithm.

show abstract

Section: Performance Evaluationsmentioning

confidence: 99%

Section: Performance Evaluationsmentioning

confidence: 99%

Weighted Connected Vertex Cover Based Energy-Efficient Link Monitoring for Wireless Sensor Networks Towards Secure Internet of Things

Dagdeviren

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

Improved NSGA-II for Minimum Weight Minimum Connected Dominating Set Problem

Dahmri

Bouamama

2020

Lecture Notes in Networks and Systems

Self Cite

View full text Add to dashboard Cite

Minimum connected dominating set problem is an NP-hard combinatorial optimization problem in graph theory. Finding connected dominating set is of high interest in various domains such as wireless sensor networks, optical networks and systems biology. Its weighted variant named minimum weight connected dominating set is also useful in such applications. In this paper, we propose a simulated annealing algorithm based on a greedy heuristic for tackling a variant of the minimum connected dominating set problem and that by exploiting two objectives together namely the cardinality and the total weight of the connected dominating set. Experimental results compared to those obtained by a recent proposed research show the superiority of our approach.

show abstract