Using the Cuckoo Optimization Algorithm to Solve the Point Coverage Problem with Moving Targets in Wireless Sensor Networks

Abstract

Wireless Sensor Networks (WSNs) have been used in many sectors in recent years. Easy deployment and low prices are the main reasons for using WSN. On the other hand, power source limitations and unstructured overlay networks are the major concerns in these kinds of networks. Region coverage is one of the problems that should be solved smartly in order to maximize the productivity of the network. Appropriate sensor selection and efficient energy usage are essential in region coverage. Pointwise coverage is a well-known version of the coverage problem. Since this is an NP-complete problem, many approaches have already been designed to solve it. The main shortcoming in previous works is the short network lifetime due to high energy consumption. In this paper, an enhanced method has been proposed based on the Cuckoo Optimization Algorithm (COA). By means of an adjusted version of the cuckoo search and a heuristic fitness function, it has been possible to expand the lifespan of the network. The proposed algorithm is composed of three phases: the first phase is setting up, the second phase is the selection, and the third phase is stable status. Simulation results show that the proposed method in comparison with recent works has achieved a sensible optimization in energy consumption, lifetime, and coverage quality.