The Research On Some Problems Of Node Localization In Wireless Sensor Networks

Due to the rapid development of chip system, micro electro mechanical system, low power embedded technology and communication technology, wireless sensor networks (WSN) is formed which is composed of sensor nodes. Sensor nodes which are small in size and low in cost are widely deployed in the monitoring area. They communicate with each other by multi-hop and dynamic routing. Wireless sensor network has been applied in many fields such as national defense, environmental monitoring, medical and health, smart home and so on. However, the location information of each sensor node is essential to the application of the data information,, Therefore, the research on node localization technology has very important practical value and significance.In the last few years, the node localization technology has changed with the changes of wireless sensor networks. The localization based on mobile beacon node is developed by the traditional node localization based on static beacon. Based on the analysis of the static beacon positioning method, this paper focuses on the research of the path planning of mobile beacon.Firstly, by consulting a large number of documents on mobile beacon localization algorithm, the existing methods of positioning are analyzed in detail. This paper introduces the principle and the innovation of the classical and the leading position method, and analyzes the method in detail.In uniform network, a dynamic path planning algorithm based on VF-Speed is proposed in this paper, which uses the Gauss-Markov stochastic model, the virtual force algorithm and speed adjustment strategy. The algorithm is modified for the virtual wall problem in the simulation experiments. The performance of the algorithm is verified by the simulation experiments. The results show that the VF-Speed algorithm is more effective than the original Gauss-Markov model.In heterogeneous coverage network, the path planning problem is decomposed into virtual beacon selection and TSP shortest path problem. In order to get the set of virtual beacon in the network, an improved BFS algorithm is proposed based on the BFS algorithm. In the simulation experiment, it is found that the algorithm can maintain good positioning performance when the network connectivity changes. For the shortest path TSP problem, the IDGSO-C2Opt algorithm is proposed, which combines the improved GSO algorithm and 2-Opt operator. The simulation results show that the algorithm is better than the original GSO algorithm and simulated annealing algorithm. The convergence speed of the algorithm and the optimal value of the objective function are better than the other two algorithms.Finally, the work of the full text is summarized, and the future work is summarized and prospect.