Research On Strong Barrier Coverage Method For 3D WSN

The problem of strong barrier coverage is an important research direction in wireless sensor networks,the main purpose is to effectively monitor the events that occur in target area.At present,most researches on constructing strong barrier coverage are carried out on a 2D plane,which is an idealized scene and is not suitable for more complex 3D real application scenes.In addition,due to the limited energy of sensor nodes,the strong barrier coverage network will have barrier gaps after a certain period of time,resulting in inaccurate monitoring target event information.Therefore,this paper will further discuss the construction of 3D strong barrier coverage and the repair of 3D strong barrier coverage gap.The main contents are as follows:(1)Aiming at the deployment problem of 3D strong barrier coverage,a 3D strong barrier coverage deployment method based on improved ant colony algorithm is proposed.The idea of dimensionality reduction is used to realize the discretization of the 3D surface,and the mesh is divided.Two heuristic factors of space weight and direction angle are introduced to improve the basic ant colony algorithm,and the movement ability of ants is restricted to prevent the algorithm from falling into the local optimum.Finally,the node is moved to virtual location to build strong barrier coverage.The simulation experiment verifies that the number of nodes can be effectively reduced,and the energy consumption of nodes can be decreased.(2)Aiming at the problem of repairing the gaps between strong barriers in 3D,a method for repairing the gaps of distributed strong barriers in 3D is proposed.This method combines the improved ant colony algorithm to find the repair chain,and through the relationship model between the mobile node and the repair chain,the repair position of the barrier gap is determined.In addition,considering the intrusion route of the target event,a priority model for repairing barrier gaps is set to repair strong barrier gaps.The simulation experiment verifies that this method can effectively reduce the moving distance of the node and lessen the energy consumption of the node.(3)Aiming at the time-consuming problem of moving nodes when repairing strong barrier gaps,a 3D clustered strong barrier covering gap repair method is proposed.First,this method constructs a clustered barrier covering model.Then,using the idea of triple integral to calculate the quality,the problem of barrier gap in 3D space is transformed into a topological map of mobile node demand on a 2D plane,and the strong barrier gap is analyzed with the node probability perception model to select the optimal repair path.Then,the Hungarian algorithm is used to schedule the movable nodes.The simulation experiment verifies that this method can effectively reduce the number of nodes used and the distance of nodes movement.