Optimizing wireless sensor network lifetime through K-coverage maximization and memetic search

Many wireless sensor networks (WSNs) not only need to cover targets within their sensing fields, but also operate for extended periods without requiring expensive recharging. This is a challenging task when planning deployments, as sensing and data processing consumes sensor energy. Redundant sensors can help extend the lifetime, but also require good placement and scheduling to be effective. This paper seeks to design a placement scheme and schedule that can achieve near-optimal network lifetime, while satisfying the target coverage constraint. The problem is approached in two phases. The first phase places sensors to maximize K-coverage, a metric closely related to lifetime, using a novel heuristic called Greedy Intersecting Arc Selection. The second phase schedules the nodes' operations for maximum lifetime, using Memetic Set Scheduler, a novel memetic algorithm. Experimental results show notable improvements in both solution quality and running time for the proposed approach compared to two existing approaches to the problem.