Research On 3D Covering Algorithm For Wireless Sensor Network

With the development of wireless sensor network(WSN) technology, the research and application of WSN tend to mature. It plays an important role in the next-generation network technology, and promotes the development of new technology. As one of the most important issues of covering algorithm in wireless sense network, the covering algorithm is not only a reflection of the whole network service quality standard, but also affects the performance of wireless sensor network. The sensing range of all sensor nodes is assumed in the coverage algorithm. The sensor will be deployed in the target area as the different requirements in kinds of applications. A good algorithm can improve network coverage rate, and let the WSN collects information more accurately.The article discusses the 3D covering algorithm based on these in WSN.Firstly, aiming at the different demands of target area in different regional covering degree, the article combines area density and virtual forces to present a three-dimensional covering algorithm. It designs density-dependent model, uses density to represent the importance of different sub-regions, and calculates the average density of the entire region by communicating with neighbor nodes. According to the density of the nodes in the region, it can calculate the virtual resultant force. Then, the deployment range of nodes can be readjusted.Secondly, considering that all nodes should be deployed uniformly in three-dimensional environment, the article puts forward a covering algorithm related with area division and virtual forces in three-dimensional. In accordance with the idea of virtual forces and area division, some attractive sources are deployed in the center of each sub-region. The deployment range of all nodes can be readjusted by resultant force which includes attractive source and other nodes. The result is that all nodes can be distributed uniformly in the area.Finally, aiming at the problem of security and coverage of Wireless Sensor Network, the article presents a three dimensional covering algorithm based on node trust degree(NTA3D). The algorithm based on the idea of virtual force, grid division and node trust, introduces joint trust of attractive source. The area is divided into grids,and some attractive sources are placed at the center of each grid. The attractive source can compute the joint trust degree of the attractive sources based on the active nodes trust in the grid. All nodes are scheduled based on joint trust. After the scheduling, the work nodes are redeployed according to the size and direction of the virtual force.Aiming at the covering problem of three-dimensional environment in wireless sensor network, the article puts forward three kinds of covering algorithm, and the simulation experiments are carried out on the matlab experimental simulation platform.The experimental results show that, the covering algorithm based on virtual force and regional density can improve the coverage degree of sub-region with high density and covering efficiency of the entire region, and reduce the energy consumption. The covering algorithm related with area division and virtual forces in three-dimensional can reduce lower and deploy nodes uniformly. Three-dimensional covering algorithm based on nodes trust degree can ensure the security of network, improve the coverage efficiency and reduce the network energy.