Wireless Sensor Network Location And Application

Wireless sensor network localization is one of the basic contents of the major laboratories in recent years, it has a certain research value and research significance. With the character of low cost, it has been widely used in military defense, disaster rescue, environmental monitoring, traffic management, medical and health and other fields. In the wireless sensor network, the position information is very important for the monitoring activity of the sensor nodes, and the monitoring report without location information is usually meaningless. Thus, the node localization is one of the most basic functions of sensor network, which plays a vital role in the practical application of sensor network.In this thesis, we firstly do the horizontal and vertical comparison for proposed basic algorithms, then introduce the principle of the each algorithm in detail, and analyze the advantages and disadvantages of each algorithm. In the practical application, we can choose different position algorithms according to different conditions.In the background of searching and rescuing in the large-scale disasters, with the reference of the simple algorithms proposed, we propose a solution for the mobile node problem may exist in the localization process:mobile node localization algorithm. According to the relationship between the distance of beacon nodes and unknown nodes and sensor’s communication radius, the unknown node can be located in a certain range through iteration, reducing the positioning area, then we can reach a predetermined positioning accuracy, and achieve the ultimate goal of locating.The mobile node localization algorithm has certain limitation to the movement range of beacon nodes, it can only move in the small range, so we improve the algorithm according to this character. The relationship of the varying distance between the beacon nodes and the unknown node is used to determine the range of the unknown nodes may exist. Through the change of the beacon nodes’position, the localization area of the unknown node is locked, and the positioning error is reduced by continuous iteration and reducing positioning area. If the iteration results reach the predetermined positioning accuracy, stop the iteration, and the location is completed.At last, we apply the proposed localization algorithm in the thesis to the autonomous platoon, and prove the practicability of the algorithm. In view of the situation of the foreign vehicle rushing into the autonomous platoon, the detailed analysis is carried out, and the simulation is carried out to verify the availability of the algorithm.