A Study Of Centroid Localization Algorithm And Based On Mobile Anchor Node Localization Algorithm In WSN

Wireless sensor networks positioning technology has been scholars research hot spot and the difficulty, positioning the use of technology to solve the People’s Daily life and production of many problems, application fields including environmental monitoring, building orientation, medical help system, navigation homework, military tracking and major disaster relief, etc. Wireless sensor network location technology for localization algorithm based on the research, different localization algorithm used in different applications, and, the localization algorithm can get higher precision, also depended on the wireless sensor network some conditions demand, these conditions such as beacon nodes density, the density of the node distribution, network connectivity and the size of the location area and other conditions.Due to the different environmental positioning, the performance of the network have very big difference, so how in different location environment of the basic orientation algorithm is put forward for improvement, the method in the circumstances of the positioning accuracy is higher, which is the focus of this study. The traditional algorithm has the advantages of the mass of the algorithm process simple, easy calculation, and is easy to realize the location, but must in the network node is more homogeneous distribution, under the premise of will obtain good location performance. In view of the network node non-uniform distribution, the center will have a lot of error is this problem, a traditional centroid algorithm is put forward the improvement, puts forward the centroid algorithm more taxes. The algorithm backlog will use a node of the beacon nodes around to distance to group, the group of the first step for centroid coordinates points is introduced, then the weighting factor, unknown nodes coordinate estimate, as the first step centroid coordinates points of the vertices polygon centroid,The second step centroid use algorithm are weighted centroid, the weight factor for unknown nodes and the distance between the beacon nodes of the function. Through the simulation analysis can see, this algorithm in network node non-uniform distribution, positioning error was significantly lower than the traditional center of mass algorithm.Finally, based on the mobile anchor node of the positioning technology, and puts forward a new dynamic path planning algorithm, this path algorithm in network area node clumps principle as the foundation, in the mobile node within the scope of the anchor communication around looking for connectivity and residual energy of the biggest unknown nodes, namely the optimal node, the generation of the optimal node based on certain within the scope of the search for cluster head clumps of principle. Mobile only anchor node in every step of the optimal point where the position information of radio itself, ensure the position information of the optimal node to the maximum range of be around the unknown nodes to accept. This path algorithm according to the distribution of the network to realize real-time path planning, to avoid the static planning in the path redundant phenomenon. Through the simulation analysis and comparison, determine the path planning algorithm is superiority.