Sparse Anchor Nodes Cooperative Localization Algorithm for WSN

Dynamic localization is one of the important and difficult points of localization for Wireless Sensor Networks (WSN). The mobility and uncertainty of the nodes seriously affect the success rate and accuracy of localization. To improve localization performance, a Sparse Anchor Nodes Cooperative Localization Algorithm (SANCL) is proposed in this paper. The algorithm can solve the problem that the unknown node cannot be located when the number of its neighbor anchor nodes is less than three. When the number of neighbor anchor nodes for an unknown node is more than three, the node can be located by the Trilateration Localization Algorithm (TLA). When the number of neighbor anchor nodes is two, the node can be located through limiting its moving direction. At the same time, it uses the historical localization information to predict the present location. When the number of neighbor anchor node is one, the BP neural network and historical localization information are used to predict its moving velocity and location. Simulation results show that the localization success rate is improved by about 42.80% compared with TLA algorithm. Compared with Mobile Nodes Predictive Localization Algorithm (MNPLA), the localization success rate is improved by about 12.34%, and the average relative error is reduced by about 0.24r.