Research On Mobile Node Localization Algorithm Of Wireless Sensor Network

Recently Sensor technology and wireless communication technology acquires rapiddevelopment. As a novel technology about acquiring and processing information, WSN hasbeen applied in the numerous fields. Most of the application of WSN is based on the nodes’position. The mobile node localization is one of the key technologies. So it is theoreticalsignificance and application value for the study of WSN mobile localization.According to the localization in mobile wireless sensor network, this paper proposes anew localization method based on Voronoi Diagrams of Mobile Anchor Nodes. The region ofthe nearest anchors’ Voronoi areas is identified as the possible region where sensor resides indifferent time. Consequently, the localization region of sensor is reduced. In view of thedeficiencies of Monte Carlo mobile node localization algorithm, a new localization algorithmbased on Least Squares, Method Monte Carlo algorithm is introduced. According to thecontinuity of movement to carry out least-squares curve-fitting, the possibility location regionof the unknown node is calculated. The sample and filter is more efficient to node localizationcompare to the MCL and MCB.In this thesis, we build a simulating environment in which we simulate the two-bitlocation algorithm. By comparing the results of A Novel Range Free Localization Schemebased on Voronoi Diagrams in Wireless Sensor Networks, this thesis reveals the advantage ofthe first algorithm. By comparing the results of MCL algorithm and MCB algorithm, thisthesis approves the advantage of the second algorithm.