A novel NSGA-II for coverage and connectivity aware sensor node scheduling in industrial wireless sensor networks

Abstract

Scheduling of the sensor nodes has attracted the interest of the research and scientific community by its ability to prolong the lifetime of the wireless sensor networks (WSNs). Full coverage of the target/region and connectivity between the scheduled sensor nodes is an important issue while scheduling a smaller set of sensor nodes only. In this paper, an NSGA-II with modified dominance has been proposed for the scheduling problem. The multiple parameters as coverage, connectivity and residual energy of the sensor nodes are considered. The sensor nodes with relatively higher energy level are preferred to be selected in a round so that they can serve maximum rounds. We have also formulated the above problem in form of Linear Programming (LP). The chromosomes are efficiently designed and it is shown that validity of the chromosomes is preserved after crossover and mutation operation. The four multiple conflicting objectives are derived to evaluate the chromosomes. The domination procedure is modified for better performance of the algorithm. Extensive simulation is performed on the proposed algorithm and the results demonstrate the superiority over the existing related algorithms. The hypothesis testing of the simulation result, ANOVA and followed by post-hoc analysis have also been performed.