The Cooperation Algorithm For Wireless Sensor Networks

Wireless sensor network is a self-organizing network application system composed of a large number of nodes in the target region. It combines the embedded technology, wireless communication technology, sensor technology and distributed information processing technology. It is an emerging technology recognized at home and abroad which can promote the field of information into the new stage of development. Wireless sensor network has wide application prospects in military reconnaissance, environmental monitoring, medical care, traffic management, intelligent home, anti-terrorism, disaster preparation and other areas.Wireless sensor network is composed of a group of mobile sensor nodes, and is a distributed network combining data acquisition, processing and transmission. The issue of covering is an important factor for its work performance. For the initial network distribution, because the large number of nodes, the method of random scraps is commonly used replacing the artificial method However, it is very difficult to guarantee sufficient coverage of the results and thus affects the operating efficiency of the network. Therefore, the node location is required to be adjusted by the mobile coverage algorithm.Good mobile coverage algorithm should make the mobile nodes adjust their own positi- ons only on the basis of the distribution of nodes nearby dynamically, tending to evenly cover the entire network. At the same time, for the failure of some nodes the network is able to qui- ckly respond to network topology changes.The purpose of this paper is to study collaboration coverage problem of wireless sensor network collaboration, design and verify the effective solutions.Based on graph theory and robot kinematics, this paper proposes a dynamic model for distributed collaboration and multi-hop communication of wireless sensor networks. The model uses Delaunay triangulation and Voronoi diagram to describe the geometric relationship between adjacent nodes. In the model, each node acts only according to its neighboring nodes and environment. The model provides a solution for wireless sensor networks in a variety of tasks, such as self-organizing network coverage, network data query routing and information sharing of adjacent nodes.To solve the problem of connection and covering of wireless sensor network, this paper presents two self-organizing algorithms. The first one is the improved virtual force algorithm combining virtual force and particle swarm. It uses the improved particle swarm optimization to seek two factors and then calculates the virtual force and deploys the nodes. Simulation shows that in the combined effect of gravitational force and repulsion force, the sensor net- work can bring rapid deployment of network nodes and final coverage. The second method is self-organizing covering algorithm based on biology competition. Inspired by the resources fights in the natural world, this method defines static sensors as'strong individuals'and mo- bile sensors as'disadvantaged individuals', and the effective coverage of each sensor node as'natural resources'. Simulation proves that the biology competition method can well layout the network with both static and dynamic nodes.To verify the effectiveness of self-organizing method, this paper proposes several intuitive and quantitative assessment methods. Delaunay triangulation is used to evaluate the node entities and their relationships as well as the message transmission and integration. Voronoi diagram is used to evaluate the coverage of the nodes. At the same time, for the whole process of self-organization, the concept of self-organization degree is introduced to analyze its distribution effect quantitatively.To solve the problem of large energy consumption and trajectory jitter, this paper proposes self-organization diverted path smoothing control strategy based on streaming model combining with neural biology. Because the output of streaming model is stable, smooth and bounded, the combination of streaming model and virtual force control can effectively smooth the trajectory in the self-organization of sensor network.This paper also proposes synchronous and asynchronous formation strategies. Simulation results show that the asynchronous method can effectively make the network move in formation and get to the new target coverage area. And the synchronous method can maintain the original structure of the network and greatly reduce the loss in the node location, which effectively maintains the mutual communication and has excellent robustness.