Node Coverage Algorithm Based On Virtual Fprce For Wireless Sensor Network

Wireless Sensor Networks(WSNs)have been considered as a new product of multidisciplinary integration in the information field and an important means to promote the development of science and technology in the new century.However,the first problem facing the wireless sensor network configuration is the coverage problem.The coverage will directly affect the network communication performance and life cycle.Adopting a high-performance,adaptive node coverage algorithm can not only improve the quality of service of the network,but also extend the life cycle of the sensor network and save the operating cost of the network.Therefore,the research on coverage problem of sensor networks has important theoretical and practical value.This article introduces the basic concepts of wireless sensor networks,main components and key technologies.Then,this paper systematically expounds the relevant theories of wireless sensor network coverage,including the basic concept of coverage,the node's classic perceptual model,the classification of coverage problems,and the significance of coverage.It analyzes the commonly used evaluation indicators of wireless sensor networks.This paper deeply study the homogeneous sensor network coverage problems.For the case that the random deployment state cannot be determined in advance,the classical Virtual Force Algorithm(VFA)cannot select the appropriate parameters,and the problem of network coverage blindness is easily generated.This paper proposes an Intensity-based Virtual Force Algorithm With Boundary Forces(IVFA-B).The algorithm analyzes the joint force of the node and deduce the virtual force gravitational parameters and the repulsive parameters with some adaptability.At the same time,the concept of node intensity is introduced,and the optimal distance threshold of virtual force model is selected by using the node's own intensity to improve the traditional virtual force model and finally optimize the deployment of network nodes.Simulation results show that the algorithm improves network coverage by about 26%,which greatly improves the distribution of nodes.For heterogeneous mobile sensor networks,due to the different sensing radii of nodes,there is no ideal distance threshold between nodes.So the traditional coverage algorithm and IVFA-B algorithm are not suitable for heterogeneous mobile sensor networks.This paper proposes a Grid-based Virtual Force Algorithm With Boundary Forces(GVFA-B).The algorithm continues to use the virtual force model.For the particularity of the ideal distance between heterogeneous network nodes,when the maximum coverage is achieved in grid,the relationship between theperceived radius of the two heterogeneous nodes and the optimal distance between the nodes are analyzed.Combining the best distance between nodes with the optimal distance threshold of the virtual force algorithm improves its adaptability to heterogeneous networks.The node movement probability is also introduced into the node movement distance formula to constraint the movement of the node.Simulation results show that the algorithm has a good effect in both coverage effect and saving node energy consumption.