Research On Optimization Technology For Coverage Problem In Target Reconnaissance Area

Wireless Sensor Network(WSNs)are composed of a large number of sensors with sensing,storage,data processing and communication capabilities and have been widely used.Coverage problem is one of the most important problems in the study of WSNs.Its main goal is to design appropriate coverage strategies for different scenarios and to build WSNs at a lower cost.In this paper,three coverage strategies are proposed for the requirement of target coverage in three different scenarios.Regional geographic information may affect the probability of target occurrence.This paper studies the area coverage problem with known region and proposes an algorithm based on region segmentation and Voronoi diagram.The simulation results show that the energy consumption of nodes is more average and the lifetime of networks is longer with increasing a small number of nodes.Nowadays,researches on sweep coverage problem seldom consider the weight of target and the constraint time for mobile sensors to return to sink nodes.This paper considers the effect of these factors and proposes a weighted and time-constraint sweep coverage problem.Then an algorithm based on target layering and path segmentation is proposed to solve it.The simulation results show that the average sweep period is shorter and the target and path coverage efficiency are higher with increasing a small number of sensors.In order to reduce the length of sweep routes,this paper analyzes the effect of sensing range and proposes a weighted and distance sensitive sweep coverage problem.Then an algorithm based on area and path segmentation is proposed to solve it.The simulation results show that the algorithm reduces the length of sweep routes and the number of mobile sensors more efficiently and reduces the sweep periods indirectly.