Salim Bouamama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Salim Bouamama has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Christian Blum
Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
12 shared publications Abdellah Boukerram
2 shared publications- Hayet Dahmri
Sétif 1 University -- Ferhat Abbas
2 shared publications - Pedro Pinacho-Davidson
Department of Computer Science, Faculty of Engineering, Universidad de Concepcin, Concepcin, Chile
2 shared publications - Roberto Maria Rosati
Intelligent Optimization Laboratory, Polytechnic Department of Engineering and Architecture University of Udine Via delle Scienze 206 Udine I‐33100 Italy
2 shared publications Albert López Serrano
Universitat Autònoma de Barcelona, Bellaterra, Spain
1 shared publication
Latest Publications
- 30 October 2026
- Published by Taylor & Francis in Engineering Optimization
- p. 1-25
A local search algorithm based on non-dominated sorting for the minimum weight minimum connected dominating set problem
1. In wireless networks, the construction of a virtual backbone is a key design strategy aimed at reducing communication overhead and improving protocol efficiency. Selecting an appropriate subset ...
- 30 October 2026
- Published by Taylor & Francis in Engineering Optimization
- p. 1-25
A local search algorithm based on non-dominated sorting for the minimum weight minimum connected dominating set problem
1. In wireless networks, the construction of a virtual backbone is a key design strategy aimed at reducing communication overhead and improving protocol efficiency. Selecting an appropriate subset ...
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 176-183
Application of PBIG to the Minimum Global Domination Problem
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 176-183
Open AccessApplication of PBIG to the Minimum Global Domination Problem
- Open Access
- 2 December 2024
- Published by Engineering, Technology & Applied Science Research in Engineering, Technology & Applied Science Research
- Vol. 14 (6) , 18324-18329
Minimizing IoT Security Deployment Costs using the Dominating Set Approach
The rise of the Internet of Things (IoT) has generated significant interest by enabling connectivity across various objects, ranging from the smallest devices to large-scale systems. Despite its benefits, IoT poses considerable security challenges due to the many interconnected devices that collect and transmit sensitive data across networks. Therefore, ensuring robust data protection and preventing unauthorized access or misuse are essential concerns. To address this issue, strategically placing security services within IoT networks is vital for safeguarding both devices and data. One promising strategy for optimizing this placement is the use of the dominating set concept derived from graph theory, which helps in the efficient allocation of security resources. This study presents an IoT network as a simple weighted graph, considering device capabilities while focusing on adopting the dominating set concept to enhance the placement of security services in IoT networks. To achieve this, an enhanced greedy heuristic is proposed for efficiently generating the dominating set. The effectiveness and performance of the proposed approach are evaluated through a comparative analysis combined with existing methods in the recent literature.
- 2 December 2024
- Published by Engineering, Technology & Applied Science Research in Engineering, Technology & Applied Science Research
- Vol. 14 (6) , 18324-18329
Open AccessMinimizing IoT Security Deployment Costs using the Dominating Set Approach
The rise of the Internet of Things (IoT) has generated significant interest by enabling connectivity across various objects, ranging from the smallest devices to large-scale systems. Despite its benefits, IoT poses considerable security challenges due to the many interconnected devices that collect and transmit sensitive data across networks. Therefore, ensuring robust data protection and preventing unauthorized access or misuse are essential concerns. To address this issue, strategically placing security services within IoT networks is vital for safeguarding both devices and data. One promising strategy for optimizing this placement is the use of the dominating set concept derived from graph theory, which helps in the efficient allocation of security resources. This study presents an IoT network as a simple weighted graph, considering device capabilities while focusing on adopting the dominating set concept to enhance the placement of security services in IoT networks. To achieve this, an enhanced greedy heuristic is proposed for efficiently generating the dominating set. The effectiveness and performance of the proposed approach are evaluated through a comparative analysis combined with existing methods in the recent literature.
- 15 November 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-39
Complex network community discovery using fast local move iterated greedy algorithm
- 15 November 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-39
Complex network community discovery using fast local move iterated greedy algorithm
- Open Access
- 7 January 2024
- Published by AGH University Press in Computer Science
- Vol. 24 (4) , 513-535
Square grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks
Localization is to provide all sensor nodes with their geographical positions. A mobile anchor-based localization in WSNs uses a mobile anchor equipped with GPS, which travels along a predetermined path. At each specified beacon point, it broadcasts its current known position to help other sensor nodes with unknown locations estimate their positions. In this paper, we analyze the determination of beacon points based on a square grid. We propose an improved path planning model named Union-curve. Our proposed model incorporates all beacon points of five previously developed paths, namely, SCAN, HILBERT, S-type, Z-curve, and $\Sigma$-Scan on the commonly used square grid decomposition of area. Unknown sensor nodes estimate their positions using two techniques, APT and WCWCL-RSSI. Simulation results show that the proposed model has higher accuracy, with a big difference in error rate compared to the other models. In addition, this model guarantees maximum coverage with less path resolution value.
- 7 January 2024
- Published by AGH University Press in Computer Science
- Vol. 24 (4) , 513-535
Open AccessSquare grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks
Localization is to provide all sensor nodes with their geographical positions. A mobile anchor-based localization in WSNs uses a mobile anchor equipped with GPS, which travels along a predetermined path. At each specified beacon point, it broadcasts its current known position to help other sensor nodes with unknown locations estimate their positions. In this paper, we analyze the determination of beacon points based on a square grid. We propose an improved path planning model named Union-curve. Our proposed model incorporates all beacon points of five previously developed paths, namely, SCAN, HILBERT, S-type, Z-curve, and $\Sigma$-Scan on the commonly used square grid decomposition of area. Unknown sensor nodes estimate their positions using two techniques, APT and WCWCL-RSSI. Simulation results show that the proposed model has higher accuracy, with a big difference in error rate compared to the other models. In addition, this model guarantees maximum coverage with less path resolution value.
- Open Access
- 7 October 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 161
Multi-constructor CMSA for the maximum disjoint dominating sets problem
- 7 October 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 161
Open AccessMulti-constructor CMSA for the maximum disjoint dominating sets problem
- 13 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14, 73-77
A Jaccard Factor-Based Heuristic for the Set k-Cover Problem in Wireless Sensor Networks
The applications of a wireless sensor network rely heavily on the network’s ability to function for an extended period. By separating the sensors into groups, each of which may keep an eye on the entire area of interest and be activated alternately, the system’s lifetime can be maximized. However, determining the most significant number of different sensor covers necessitates solving the NP-complete set k-cover issue. This work presents an improved greedy approach to the set k-cover problem based on the Jaccard Similarity Coefficient. The latter is a statistical method used to understand the similarity and diversity between sample sets. Moreover, the quality of the produced solution is improved by removing duplicate sensors for each set cover. The effectiveness of the proposed approach was compared to some greedy-based methods from the literature based on 1000 widely used benchmark instances. Computational results demonstrate its efficacy in producing high-quality solutions within acceptable computational time, especially when the problem scale increases
- 13 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14, 73-77
A Jaccard Factor-Based Heuristic for the Set k-Cover Problem in Wireless Sensor Networks
The applications of a wireless sensor network rely heavily on the network’s ability to function for an extended period. By separating the sensors into groups, each of which may keep an eye on the entire area of interest and be activated alternately, the system’s lifetime can be maximized. However, determining the most significant number of different sensor covers necessitates solving the NP-complete set k-cover issue. This work presents an improved greedy approach to the set k-cover problem based on the Jaccard Similarity Coefficient. The latter is a statistical method used to understand the similarity and diversity between sample sets. Moreover, the quality of the produced solution is improved by removing duplicate sensors for each set cover. The effectiveness of the proposed approach was compared to some greedy-based methods from the literature based on 1000 widely used benchmark instances. Computational results demonstrate its efficacy in producing high-quality solutions within acceptable computational time, especially when the problem scale increases
- 23 February 2023
- Published by Springer Nature
- p. 306-321
Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem
- 23 February 2023
- Published by Springer Nature
- p. 306-321
Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem
- Open Access
A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime
Finding dominating sets in graphs is very important in the context of numerous real-world applications, especially in the area of wireless sensor networks. This is because network lifetime in wireless sensor networks can be prolonged by assigning sensors to disjoint dominating node sets. The nodes of these sets are then used by a sleep–wake cycling mechanism in a sequential way; that is, at any moment in time, only the nodes from exactly one of these sets are switched on while the others are switched off. This paper presents a population-based iterated greedy algorithm for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Our approach is compared to the ILP solver, CPLEX, which is an existing local search technique, and to our earlier greedy algorithm. This is performed through its application to 640 random graphs from the literature and to 300 newly generated random geometric graphs. The results show that our algorithm significantly outperforms the competitors.
Open AccessA Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime
Finding dominating sets in graphs is very important in the context of numerous real-world applications, especially in the area of wireless sensor networks. This is because network lifetime in wireless sensor networks can be prolonged by assigning sensors to disjoint dominating node sets. The nodes of these sets are then used by a sleep–wake cycling mechanism in a sequential way; that is, at any moment in time, only the nodes from exactly one of these sets are switched on while the others are switched off. This paper presents a population-based iterated greedy algorithm for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Our approach is compared to the ILP solver, CPLEX, which is an existing local search technique, and to our earlier greedy algorithm. This is performed through its application to 640 random graphs from the literature and to 300 newly generated random geometric graphs. The results show that our algorithm significantly outperforms the competitors.
- Open Access
- 7 July 2021
- Published by Association for Computing Machinery (ACM)
- p. 1974-1977
Negative learning ant colony optimization for the minimum positive influence dominating set problem
Recent research has shown that adding negative learning to ant colony optimization, in addition to the traditional positive learning mechanism, may improve the algorithms' performance significantly. In this paper we consider the application of this novel ant colony optimization variant to an NP-hard combinatorial optimization problem known as the minimum positive influence dominating set problem. This problem has applications especially in the context of social networks. Our results show, first, that the negative learning variant significantly improves over the standard ant colony optimization variant. Second, the obtained results show that our algorithm outperforms all competitors from the literature.
- 7 July 2021
- Published by Association for Computing Machinery (ACM)
- p. 1974-1977
Open AccessNegative learning ant colony optimization for the minimum positive influence dominating set problem
Recent research has shown that adding negative learning to ant colony optimization, in addition to the traditional positive learning mechanism, may improve the algorithms' performance significantly. In this paper we consider the application of this novel ant colony optimization variant to an NP-hard combinatorial optimization problem known as the minimum positive influence dominating set problem. This problem has applications especially in the context of social networks. Our results show, first, that the negative learning variant significantly improves over the standard ant colony optimization variant. Second, the obtained results show that our algorithm outperforms all competitors from the literature.