Dynamic Optimal Planning of Path of Mobile Nodes

In the process of time synchronization and location of wireless sensor networks based on mobile reference nodes, the path planning of the reference node directly affects the accuracy and energy loss of the nodes. This paper transforms the path planning of mobile nodes into the selection of broadcast points with the path planning, and sets up a mathematical model based on the problem of location and traveling salesman problem. By establishing the optimal joint mathematical model, a method that uses a greedy algorithm was proposed to find the optimal broadcast point and obtain the optimal path. The simulation experiments were done to validate the performance of the method. Experimental data shows that the mobile path witch through this method can cover the whole network, and significantly shorten the moving distance of the reference node.