Research On Localization Algorithm For Wireless Sensor Networks

In wireless sensor networks, localization technology is one of most important supporting techniques. The sensor nodes must be aware its position to explain'What happens and where', to implement the target of the location and tracking. Lots of algorithms and systems are developed to solve the problem of node positioning at home and aboard, those which are only suitable to a particular application or environment, and cannot get a satisfactory comprehensive index.Algorithms used one mobile anchor node have many advantages, such as low cost, high precision, easy to realize 3-D positioning, etc. The mobile anchor spreads its location information to unknown nodes, assisting which to make range-free localization. This paper adopts mobile anchor node combining PBCC algorithm, and proposes a self-localization algorithm with low energy consumption and high precision.The first part introduces the wireless sensor networks, classical and latest algorithms. The performance comparison among the existing algorithms is given, and points out its application occasions and deficiencies.The second part analyses the PBCC algorithm and points out its defects in applications, the improvement based on which is proposed. Simulation results show that this algorithm has very strong anti-interference, and high precision even in the obstacles. It has a good practicability.