Research On Sweep Coverage Algorithms Of Sensor Networks Based On Different Sweep Periods

Wireless sensor networks are wireless networks composed of a large number of static or mobile sensors.It is used to sense,collect,process and transmit the information of sens-ing objects in the geographical area covered by the network.In wireless sensor networks,using a small number of mobile sensors to cover more targets is called sweep coverage.Specifically,the mobile sensor nodes cover the point of interest(POI)in the sweep period required by the POI.Researchers have done a lot of research work in this field,but most of them ignored that POI may have different sweep periods.Due to the different sweep periods of each POI,some POI will be frequently covered,so that it exceeds its sweep coverage requirements.For example,in the furnace monitoring system,the coverage fre-quency of higher temperature area should be higher,that is,their sweep period should be shorter.Based on the research status at home and abroad,this paper further studies the sweep coverage algorithm based on the sweep period of sensor networks.The research is divided into the sweep coverage problem with different POI sweep cycle and the sweep coverage problem of random POI.This paper designs FSweep algorithm based on grouping and greedy,USweep al-gorithm based on grouping and iteration is used to solve the sweep coverage problem of different interest points in sweep cycle.FSweep algorithm can make mobile sensor nodes cover POI within the sweep coverage period required by POI in the plane.USweep algo-rithm combines grouping with iteration,and then uses TSP path algorithm to obtain the sweep coverage path of mobile sensors.At the same time,the algorithm obtains multiple sweep coverage paths,among which the POI covered by each sweep coverage path has a similar sweep cycle.Finally,the experimental results verify that FSweep and USweep algorithm need less mobile sensor nodes compared with other algorithms,and the analysis of the two algorithms shows that FSweep algorithm can be used in the environment where the algorithm speed is high,whereas USweep algorithm can be used in the environment where the number of mobile sensors needs to be minimized.This paper designs DSweep algorithm based on classification and RSweep algorithm based on similarity to solve the sweep coverage problem of random interest points in real environment.DSweep adopts the random classification method,so that the random POI can be covered by the sweep coverage path.The RSweep algorithm defines the multi-factor similarity,and makes the random POI covered through the mobile sensor nodes by the judgment of the similar situation.Finally,the experimental results illustrate that FSweep and USweep algorithms can satisfy the randomness of POI,and the number of mobile sensor nodes required are smaller than other algorithms.