Research On Path Planning Of Mobile Beacon Node And Node Localization Algorithm In Wireless Sensor Networks

In wireless sensor networks, the sensor nodes are divided into anchor nodes and unknown nodes, the number of beacon nodes is usually small, it can be self-localization with GPS. In order to use wireless sensor network to monitor the target area, we must know the localization of the node after the random deployment of sensor nodes. In the traditional node localization we add a certain amount beacon node of the sensor node, and then calculate the coordinates of unknown node by beacon nodes. In the traditional node localization, beacon nodes are static, the node localization method of mobile beacon assisted in order to reduce the cost and the number of beacon nodes. The aim of this paper is to research on the problem of the mobile beacon node path planning of sensor networks, node localization algorithm. The main contributions of this dissertation are as follows:First of all, we provide an overview of wireless sensor networks, a review of the research status of node path planning and classification of node localization algorithm in wireless sensor networks and calculation methods of node coordinates.Secondly, we research on algorithm of the mobile beacon node in wireless sensor networks. Through the improvement of the topology of nodes, the path planning algorithm is improved, and we find the location of the beacon nodes with coverage strategy and force field method.Then we get the path with optimized algorithm.Finally, we introduce the DV-Hop algorithm and its improved algorithm. We find virtual beacon nodes with new path planning methods, and change the average hop distance calculation method.The simulation experiments are done on the above method, and we analysis the experimental results. It verifies the feasibility and effectiveness of the method.