Research On Node Localization Algorithm Based On Dynamic Path Planning Of Anchor Node In Wireless Sensor Networks

Wireless sensor networks are composed of a large number of inexpensive sensor nodes,due to its advantages of self-organization,low cost and easy deployment,which is widely used in the field of environmental monitoring,smart home,military,industry and so on.In the above applications,node localization technology is one of the key technologies of wireless sensor networks.Only when the location of the sensor node is known can the data collected by the node be of practical value.In order to reduce energy consumption of nodes and improve localization performance,the mobile anchor node is used to assist unknown nodes to complete localization in the thesis.The path planning of anchor according to the distribution of unknown nodes in the monitoring region and reducing the length of the path of anchor while increasing the localization performance are the research emphases in the thesis.A dynamic path planning algorithm of anchor node based on network topology information clustering is proposed for the localization scenarios of stationary unknown node and moving anchor node in this thesis.Firstly,the network is clustered according to the density of unknown nodes,selecting the unknown node with the highest density as the cluster head node.Secondly,the traversal order of cluster head nodes is solved by simulated annealing algorithm to obtaining the global moving path of anchor node.Finally,it is found that the localization error of nodes is minimum when there is a triangular distribution between anchor nodes participating in localization through geometric analysis.Therefore,the path of equilateral triangle is used to cover the unknown node in the cluster as the local moving path of the anchor node.Simulation results show that the proposed method can adapt to wireless sensor networks with different topology,and can effectively shorten the moving path of anchor node while improving the localization accuracy and node localization rate.A path planning algorithm of anchor node based on localization benefit is proposed for the localization scenarios of moving unknown node and anchor node in this thesis.Firstly,the localization benefit according to the motion model of the unknown node and its one-hop neighbor information is defined.And then the moving box of the anchor node is traversed combining with the localization benefit to determine the optimal location of the anchor node at the next moment.The sampling area in the Monte Carlolocalization boxed is reduced by using the received signal strength indication ranging in the localization phase.In order to meet the localization requirements of unknown nodes in the monitoring area with low density of anchor node,the auxiliary anchor nodes are selected to participate in the localization of unknown nodes by using the average localization offset.The simulation results show that this algorithm has better localization performance and can guarantee the localization rate and accuracy when the number of anchor nodes is smaller.