Wireless Sensor Network Coverage Optimization: Comparison of Local Search-Based Heuristics

Table 3

Selected papers on MLCP optimization with Non-Disjoint Set Cover based approaches—Part II.

No.	Reference	Year	Brief information about the approach and its optimization goal
14	K. Trojanowski et al. [5]	2017	Local search-based approach with a hypergraph model of the WSN and problem-specific perturbation operators (LS) for cover generation and makespan maximization
15	J. Roselin et al. [32]	2017	Heuristic for cover generation and makespan maximization where the sensor priority depends on its sensing coverage/connectivity and its remaining energy
16	Manju et al. [9]	2017	Minimal heuristic finds covers and maximizes the makespan
17	A. Tretyakova et al. [33]	2017	Stochastic greedy heuristic and simulated annealing algorithm maximize the number of feasible covers and optimize their execution times in the way satisfying the battery capacity restriction in the rows
18	K. Trojanowski et al. [6]	2018	Local search-based approach with perturbation operator inspired by cellular automata (LSCAIA) for cover generation and makespan maximization
19	Y. E. E. Ahmed et al. [34]	2018	An exact method of cover generation based on the sensor coverage relation matrix and using the integer linear programming model
20	The approach presented in this publication	2022	Local search-based approaches with the neighbor generation (so-called perturbation) and refinement procedures taking advantage of some model-specific properties and originating from LS, LS, and LS for cover generation and makespan maximization