Abstract: A dynamic path planning method is proposed in order to solve the problem of localization in Wireless Sensor Networks with mobile beacon.Firstly,considering the graph theory,WSN is regarded as a connected undirected graph,the sensor node is transformed into the vertex of the graph and the virtual beacon node is selected,then using the ant colony algorithm to obtain the optimal path through these virtual beacon points.This method also improves the problem of node selection redundancy in traditional breadth first search algorithm and accelerates the convergence speed in the classical ant colony algorithm.Simulation results show that the improved algorithm can reduce the repeated traversal of nodes and shorten the moving distance of anchor nodes under the condition of ensuring a certain coverage rate.