Study Of Pseudo Three-dimensional Positioning Algorithm Of Wireless Sensor Network Node

As a main support technology of wireless sensor network, node localization technology for wireless sensor network has become a hot research topic in recent years. Accurate localization of nodes is basis and premise to provide monitoring events positional information, for most applications, the monitored information without positional information is meaningless, thus the research on wireless sensor network node localization technology is necessary and very important.The existing three-dimensional localization algorithm for wireless sensor network always compute node's three-dimensional coordinates directly according to the relative distance, angle and other relevant information between the nodes. Most of them suffer from high computational complexity, low localization precision and error accumulation problems. Thus this thesis proposes electronic map based pseudo three-dimensional localization algorithm for wireless sensor networks, the main content of this thesis are summarized as follows:1) this thesis divides the process of localization into initial stage of the global positioning and later mobile node re-localization stage, aimed at this two stage this thesis proposes two kinds of pseudo three-dimensional localization algorithm, different from the traditional three-dimensional localization algorithm, pseudo three-dimensional localization algorithm first simplifies a three-dimensional space positioning problem to a 2d in-plane positioning problem, thereby reduces computational complexity of algorithm, calculates two-dimensional coordinate, then completes three-dimensional localization with electronic map. The popularity of high-precision electronic map ensures the implementation of algorithm.2) In the initial stage of the global positioning, this thesis proposes Topographic Information Based Pseudo Three-Dimensional Localization Algorithm (TIBPTDLA) for wireless sensor networks. In order to realize the complex three-dimensional environment network node localization, TIBPTDLA introduces electronic maps and a mobile anchor node, and plans the moving track of the anchor node. Simulation results show that TIBPTDLA has the advantages of low computational complexity and high localization precision.3) In the mobile node re-localization stage, this thesis proposes APIT Based Mobile Node Re-localization Algorithm (APITBMNRA) for wireless sensor networks. APITBMNRA does not need external devices auxiliary, just uses the know nodes of the network to achieve re-localization of the mobile node. During the process of calculating intersection regional that the node may exist, this thesis proposes the electronic map optimal method. Simulation results show that APITBMNRA has the advantages of short positioning time, small communication overhead and high localization precision.