Research Of The Self-Localization Algorithm In Wireless Sensor Networks

Many applications are based on node localization in WSN. In this paper, we discuss node localization technologies, localization criterion, and range-free localization algorithms. Through analysis and comparison, there were three problems in the range-free algorithms: they rely on anchor nodes too much, which limit the localization precision and coverage rate; the nodes that can't be localized increase the spending of computing and communication, and affect the average positioning error. Considering the disadvantages, our approach improves the localization performance in three aspects on the basis of the DV-Hop algorithm: firstly, to reduce the average localization error, we analyze the nodes that can't localize, and set up the scheme to get rid of them; secondly, to reduce the traffic, we add the middle node that controls the nodes receiving and sending the information package restrictively; thirdly, to improve localization coverage rate, we make the localized nodes to be anchor nodes . By NS-2 simulator, we compare and analyze the algorithm performances. The results show that it reduces its average localization error, communication and increase coverage rate.