Distributed Dynamic Path Planning Algorithm for Wireless Sensor Networks
Qiyong Lu · Chuangan jishu xuebao · 2013
Wireless Sensor Networks(WSNs)have been widely used in path planning for mobile users in dynamic environments.Considering deficiencies of existing potential field algorithms on dynamic adjustment,a distributed dynamic path planning algorithm is proposed with a gradient function constructed by the factors of path length and security.When network detects dangerous events,it can adjust the potential field to provide optimal path planning for every node based on their local information.Simulations show that when environment changes,the proposed algorithm can make WSN plan shorter path,effectively save communication cost and deal with path security flexibly according to different system requirements.