A Constrained-Aware Genetic Algorithm for Coverage Optimization in Range-Free Sensor Networks

Wireless sensor networks increasingly support time-critical monitoring applications, where coverage optimization must often be performed under limited computational resources. This work addresses a previously underexplored WSN coverage problem involving range-free, angular-limited sensors with transmitter-induced sensing degradation and discrete sector orientation. We formulate a mixed combinatorial problem that jointly optimizes K-out-of-N sensor activation and sector assignment under strict feasibility constraints. A constraint-aware genetic algorithm with repair-based feasibility enforcement is proposed and validated against the global optimum obtained via exhaustive enumeration, enabling direct quantification of optimality. The repair mechanism corrects infeasible offspring after each genetic operation to guarantee that exactly K sensors remain active, eliminating the need for penalty-based constraint handling. A brute-force search is used to establish the global optimum of our small-scale scenario, serving as a ground-truth optimality benchmark for evaluating the proposed method. The purpose of this comparison is not to assess competitiveness against other metaheuristic algorithms, but to quantify how closely the proposed approach approximates the true optimal solution under strict problem constraints. The constraint-aware genetic algorithm is developed using an integer chromosome encoding, two initialization strategies, two crossover pairing schemes, elitism, and per-gene mutation, combined with alternative constraint-handling strategies. Two experimental series evaluate the impact of population size, crossover method, mutation probability, and constraint handling using problem-specific metrics, alongside convergence and fitness statistics. The proposed algorithm reliably reaches near-optimal solutions with significantly reduced computational cost when compared to exhaustive search. By integrating problem-specific constraints directly into the process, the proposed evolutionary optimization method effectively balances solution quality and execution time, making it well suited for scenarios requiring rapid sensor reconfiguration.