Multi-objective clustered-based routing with coverage control in wireless sensor networks
A wireless sensor network (WSN) generally consists of a large number of inexpensive power constrained sensors that are small in size and communicate over short distances to perform a predefined task. Realizing the full potential of WSN poses many design problems, especially those which involve tradeoffs between multiple conflicting optimization objectives such as coverage preservation and energy conservation. While both energy conservation routing protocols in a cluster-based WSNs and coverage-maintenance problems have been extensively studied in the literature, these two problems have not been integrated in a multi-objective optimization (MOO) manner. This paper employs a recently developed MOO algorithm, the so-called multi-objective evolutionary algorithm based on decomposition (MOEA/D) to solve simultaneously the energy conservation and coverage preservation design problems in cluster-based WSNs. The performance of the proposed approach, in terms of network lifetime and coverage is compared with the heuristic LEACH and SEP clustering protocols and with another prominent MOEA, the so-called non-dominated sorting genetic algorithm II (NSGA II). Simulation results reveal that MOEA/D provides a more efficient and reliable behavior over other approaches.
clustering wireless sensor networks coverage preservation energy conservation multi-objective optimization evolutionary algorithms