Research On Multi-area Coverage Path Construction And Maintenance Algorithm For WSNs

Wireless Sensor Networks(WSNs)is a network composed of many low-cost,low-energy sensor nodes via single-hop or multihop.It is widely used in various fields such as environmental safety monitoring.In the study of multi-area coverage control for WSNs,sensor nodes are usually redeployed between the original monitoring area(OMA)and the extended area(EA)based on the communication radius of the nodes to ensure communication and data transmission between the OMA and the EA.Although this method can guarantee communication,the nodes on the path are sparsely distributed and have no sensing function,which cannot reflect the information of environmental variables between multi-area.Moreover,the failure of a node on the path can lead to interruptions in communication.In this paper,we address the problem that sensor nodes on the communication link don't have sensing and are prone to interruptions due to node failures in multi-area coverage control of WSNs.We investigate for the first time the construction and maintenance of redundant paths for multi-area coverage in WSNs to improve the coverage performance on the communication link and avoid interruptions to provide continuous coverage and reliable communication between multiple areas.The main work is as follows.(1)This paper analyzes the node cooperative sensing(NSC)based multi-area coverage redundant path construction(NCSMCRPC)problem.The goal is to identify available redundant sensor nodes in the network while ensuring complete OMA coverage,and then redeploy these redundant sensors to the EA,and establish a redundant communication link with coverage and reliability to ensure stable connectivity between the OMA and EA.To solve the NCSMCRPC problem,this paper proposes a Rapid Sensor Redeploymentbased Redundant Path Construction(RSR-RPC)strategy to complete the coverage of EA and the construction of redundant paths.The simulation experimental results show that the algorithm outperforms other peer-to-peer algorithms in terms of coverage performance.Network lifetime performance improves continuously with the number of nodes,ranging from 1 to 7 orders of magnitude over the AEAC-SP and AEAC-RP algorithms.Although the network lifetime performance is slightly reduced compared to the ORRTLEC-SP algorithm,the communication interruption probability between multiple regions is reduced from 7.8% to 0,and hence the reliability of the communication link between multi-area is ensured.(2)To solve the problem of constructing and maintaining multiarea coverage paths for WSNs in obstacle environments,a Double Populations Ant Colony Optimization algorithm(DPACO)is designed to solve the problem of constructing coverage paths when there are obstacles between OMA and EA.The DPACO algorithm improves the searchability in the early stage of the algorithm by setting a non-uniform initial pheromone concentration and introducing new populations,which prevents the algorithm from falling into a local optimum.In addition,the elite ant pheromone update principle and adaptive adjustment of the volatile coefficients are used to improve the convergence speed of the algorithm.On this basis,redundant sensor nodes are redeployed using the RSR-RPC algorithm in combination to achieve the construction and maintenance of redundant paths in an obstacle environment.The simulation results show that the DPACO algorithm outperforms the basic ACO algorithm in terms of path length,the number of inflection points,and convergence speed,and outperforms the Genetic Algorithm(GA)in terms of convergence speed and number of inflection points.In addition,the RSR-RPC algorithm still has better advantages in the obstacle environment,and the simulation from the interruption probability and the coverage performance on the path fully proves the superiority of the proposed algorithm.