Mobile Sensor Sweep Coverage Problem With Energy Limitations

With the development of sensor technology and communication technology,wireless sensor networks are becoming more and more valuable.Sweep coverage is also a problem worthy of study in wireless sensor networks.In sweep coverage,the mobile sensor consumes more energy during the movement than during the communication.The mobile sensor has an energy limitation problem,and the mobile sensor node cannot move without limit,and needs to periodically return to the base station to supplement the energy.In the previous research work,most of the research work abstracted the points of interest into points,and the mobile sensor can collect the data of these points only when the mobile sensor moves to the coordinate position of these points.In reality,the mobile sensor has a certain sweep radius.At this time,the mobile sensor node does not need to move to the coordinate position of the point of interest,and only moves to the point where the point of interest is within the sweep radius of the mobile sensor to complete the data collection and monitor.Through a large number of domestic and foreign research work in the field of scanning coverage,most of the research is to consider one aspect alone,and not both of them.Therefore,in view of the shortcomings of the existing research work,this paper proposes two research problems.One is to consider the same sweep period for different POIs,and we study the mobile sensor periodically return to the base station to supplement the energy problem,while considering the impact of sweep radius.The other is to con-sider the effect of sweep radius on sweep coverage for different POIs,and we study the mobile sensor periodically return to the base station to supplement the energy problem,while considering the impact of sweep radius.For the first research question,we give the network model of this problem,and at the same time prove that the problem is NP-hard problem,and also give t-sweep coverage,global t-sweep coverage and(t,T,R)-SCBR definition.Finally,we design a centralized path shortening algorithm(CPS)and a dis-tributed path planning algorithm(DPP).To solve this problem.For the second research question,we also give the network model of this problem,and at the same time prove that the problem is NP-hard problem,and also give t_i-sweep coverage,and(t,T,R)-SCBR definition.Finally,a general centralized path planning algorithm(GCPP)is designed to solve this problem.In addition,the paper also carried out experimental simulation and analysis of the algorithm proposed in the paper.By comparing with existing algorithms,we find that our algorithm is better than existing algorithms.