Three-dimensional Localization Algorithm Based On Mobile Beacon In Wireless Sensor Networks

Wireless sensor networks(WSNs) is a powerful means of obtaining information, and they have broad application prospects in many fields, which have become the most influential technologies in21st century because of covering a wide area, adaptive ability, convenient and flexible deployment.In many wireless sensor network applications, access to information is the premise of the completion of all tasks, but for data users, information lack of location can’t be used, even no meanings. It is necessary to achieve the localization of the sensor nodes. This paper describes background and significance of the localization technology, research status and the challenges, the problems as well in details and this article classifies and compares the localization technology. And then combining with the needs of three-dimensional localization and the many advantages of the mobile beacon node localization, this paper designs and tests three-dimensional localization based on single-air mobile beacon node and the RSSI assisted.In the respect of nodes’localization, TDMB learns from the idea that PI algorithm uses the maximum point of RSSI value in order to position the dimension of X and Y. It was the first time to achieve localization Z dimension, converting the RSSI value equal relationship to the equidistant relationship. This study designs flexible and practical three-separate mobile path in the respect of the path planning of Beacon node mobile. This article uses the mini-unmanned helicopter as the experimental platform of beacon nodes’carrier and algorithm, verifying the feasibility of the theory design of Wireless sensor networks’3D localization algorithm based on Mobile beacon node, the advantage of the air mobile beacon node and the effectiveness of path planning. Finally, the study analyzes the error in the calculation of three-dimensional coordinates of the unknown node and design targeted symmetric optimization strategy to reduce the error. We find TDMB algorithm has a high accurate position, simple calculation, and strong expansion, with a certain degree of innovation and practicality.