Research Of Localization Algorithms In Wireless Sensor Networks

Localization is the precondition of many applications of sensor networks, such as target identification surveillance and tracking. Therefore, it is important to make research on it.In this thesis, we discuss the localization algorithms in detail. The taxonomy and summarize for wireless sensor networks localization algorithms, the comprehensive analysis and evaluation of their performance are also described in the thesis.The localization algorithm based on the multidimensional scaling can be used when the measured distance of neighbor nodes is known or the connectivity information is only known. The algorithm need less anchors, and has not limitation with the place of anchors. It has so many advantages that the paper had an in-depth research on it.It uses the shortest path to replace actual distance, there are some errors between the shortest path and actual distance and the positioning accuracy is reduced.In order to solve this problem, According to the node connectivity, different coefficient values are set for estimate distance. And we can use RSSI to estimate last-distance. The results of simulation show that the proposed algorithm reduces the average estimation errors with comparing the MDS-MAP.