摘要
In wireless sensor networks (WSNs), energy efficient wakeup scheduling of sensor nodes is one of an efficient approach for saving the energy consumption of the network. Determining an optimal wakeup schedule of sensor nodes with satisfactory coverage and connectivity requirements is very challenging issue and known as NP-hard problem. In literature, several evolutionary or meta-heuristic algorithm-based schemes are proposed for solving this problem. Most of the existing wakeup scheduling schemes consider only either coverage or connectivity constraint. Only very few proposed schemes consider both coverage and connectivity constraints for determining an optimal wakeup schedule. These existing schemes do not guarantee optimal solution and sometimes struck in local minima. In this paper, an improved Memetic Algorithm based energy efficient wakeup scheduling scheme is proposed where four constraints are considered such as energy consumption, coverage, connectivity, and optimal length of wakeup schedule list. The proposed scheme devises a novel mutation, crossover, and local search operators. An extensive simulation experiments are done in different network scenarios to prove the performance of the proposed scheme and compare its performance with two latest existing schemes. The results confirm that the proposed scheme performs better than the existing schemes in terms of coverage ratio, optimal number of active sensor nodes and network lifetime.
学科与关键词
文献加载失败,请重试
重试