Location Algorithm For Wireless Sensor Network Node

Node positioning technology is one of the main supporting technologies of Wireless sensor networks. The data collected by sensor nodes can only be valid on condition of being integrated with its location. In addition, localization of nodes itself in wireless sensor networks can also be applied in localization and tracing of external target and location-based routing protocol and so on.Currently available wireless sensor network node localization algorithms mostly have drawbacks, such as being greatly affected by environment, high algorithm complexity and great energy consumption, unsuitable for mobile node localization, which in general can be attributed to one point:poor algorithm practicability. With the increasing application of wireless sensor network, the more practical localization will be get more attention.In this paper, we perform an in-depth study and discussion about the two dimensional plane localization technology for wireless sensor networks and mainly research on the following aspects. First, theoretical basis of localization algorithm is described in detail, the basic methods for calculating the distance between nodes and the location of nodes is gived a minute description, and the algorithm performance evaluation and several important impact factors are also analyzed. Then, several typical localization algorithms without distance calculating are researched in depth, and the principle and performance of these algorithms are studied and analyzed in detail. What's more, to counter the deficiencies of those algorithms, the improved algorithms respectively are proposed.Analysis suggests that improved algorithm has a marked improvement in performance comparing with the original algorithm. Finally, a distributed localization algorithm based on moving coordinate system (MCS algorithm) is introduced. In the algorithm, the coordinate system is established by taking the moving anchor node as the origin. The unknown node determines its own position in the temporary coordinate system by referring to neighbor anchor nodes'information. Then according to the common set that take from locations in different coordinate systems, the node shrinks its unknown area. At last, the node determines its position by the use of centroid algorithm. Simulation results show that MCS algorithm has a better localization accuracy which is little dependent on the number of nodes. Also, when the total number of nodes in monitor area increases, the localization accuracy of this algorithm is not significantly affected.