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.

传感器节点的调度功能能够延长无线传感器网络（WSN）的寿命，因此吸引了研究和科学界的兴趣。在仅调度一小组较小的传感器节点的同时，对目标/区域的全面覆盖以及调度的传感器节点之间的连接性是一个重要问题。在本文中，针对调度问题提出了一种具有优势的NSGA-II。考虑传感器节点的覆盖率，连通性和剩余能量等多个参数。具有相对较高能量水平的传感器节点最好在回合中选择，以便它们可以服务最大回合。我们还以线性规划（LP）的形式提出了上述问题。染色体被有效地设计，并且表明在交叉和突变操作后，染色体的有效性得以保留。得出四个相互矛盾的目标来评估染色体。修改了控制程序，以提高算法的性能。对提出的算法进行了广泛的仿真，结果证明了该算法优于现有的相关算法。还进行了模拟结果的假设检验，方差分析和事后分析。对提出的算法进行了广泛的仿真，结果证明了该算法优于现有的相关算法。还进行了模拟结果的假设检验，方差分析和事后分析。对提出的算法进行了广泛的仿真，结果证明了该算法优于现有的相关算法。还进行了模拟结果的假设检验，方差分析和事后分析。