Research On Mobile Anchor Node Based Localization Algorithm For WSN Collinear Problem

With the rapid development of today's information technology, Wireless Sensor Network(WSN) get a good environment conditions.There have the deep research of sensor networks and the widespread application, sensor networks gradually into every field of human. Wireless sensor network has lots of aspects worth research, nodes localization is the foundation of other problems.Using static anchor nodes localization need larger anchor nodes density, the cost of anchor nodes is higher than the ordinary sensor nodes.After the anchor nodes finish location, it usually idle, not fully used, therefore, is now a lot of research at home and abroad of WSN localization algorithm based on mobile anchor nodes.Mobile anchor nodes have two main ways to move,static based path and dynamic based path.On the basis of study,research and summarizing the existing localization algorithm,based on the shortcomings and the insufficiency of the existing algorithm, this paper puts forward two kinds of new mobile anchor node localization algorithm for WSN,that is Incremental Localization Algorithm based on hexagon(ILAH) and mobile anchor node localization algorithm based on clustering(CMLA), mainly to solve the collinear problem in the existing localization algorithms which are based on dynamic path and static path and to overcome introduced auxiliary equipment to algorithm to solve the problems of the collinear. The two algorithms have the same basic techno logy,but they have different suitable eare.In this paper, the main research work are: Firstly,studying and analyzing the existing WSN node location technology; Introduce node localization method in detail, and its classification, analysis and comparison, summarize the applicable scope of each method and its shortcomings.Then introduced related technology based on mobile anchor node localization, summarizes the methods of path planning of mobile anchor node, as the theoretical basis for the research behind. Last mainly studied ILAH and CMLA, ILAH is the anchor node based on static path planning, anchor nodes move along the planned path,through the simulation we know tha the method has high positioning accuracy and area coverage rate, this method is effective to solve the node collinear problem which is introduced by the traditional method, moving path of the method is smaller than Round and S; CMLA localization algorithm is based on the anchor node with dynamic path planning, through the simulation we know the method has small error,higher positioning coverage rate,and effectively solve the problem of the node collinear.