Cuckoo search algorithm for target coverage and sensor scheduling with adjustable sensing range in wireless sensor network

Abstract

Maximizing the sensor cover from randomly deployed sensors to provide k-target coverage, is a challenging problem in Wireless Sensor Network (WSN). In this paper, an improved cuckoo search algorithm is proposed to determine the sensor covers by optimizing the sensing range of the sensors to reduce the redundancy in the network. The proposed algorithm partitions the sensor set into non-disjoint subsets with varying sensing range such that each cover provides k-coverage in the network. The activation of each cover, one after the other increases the lifetime of the network. The efficiency of the proposed algorithm is estimated using the simulations results.