Research On Localization Algorithm Of Wireless Sensor Network

Wireless sensor network is a organization network composed by some tiny sensor nodes, usually they are deployed in the area of the complex environment artificial or hostile areas. The network application field is very wide, such as environmental monitoring, intelligent control, industrial automation production, space exploration and military control, and other important fields. For most of the scenario, if the node’s position is not sure, its monitoring to the information will be useless. Therefore, the fundamental premise of the network will be widely used is location of the nodes.The paper mainly studies the problem of localization of the wireless sensor in the network. The localization technology which range-based and range-free technology is the most widely used two categories in this field. Range-based technogoly need additional hardware-assisted. Therefore, there are more apply future with the range-free technology localization algorithm which need not add additional hardware equipment, and the DV-Hop algorithm is a very typical localization algorithm of non-based ranging technology, it is one of the localization algorithm with the most promising.The paper analyzes the errors in two aspects base on mainly analyzes DV-Hop localization algorithm theory:It is use the jump sect distance instead of the straight-line distance which between the nodes and node localization take the least squares method. Therefore, the paper put forward the improvement for these two aspects:1、According to jump sect distance how arise errors to put forward a corresponding improvement for the DV-Hop localization algorithm. Its main idea of improve the algorithm is:first correct the errors of jump sect distance of each node according the sign beacon node’s jump sect distance, and then use the Weighted algorithm to modify the result of the ranging distance, and finally locate the coordinates the unknown node use the classical least multiplication. The simulation experiment proved that the improved average localization algorithm is better than the classic DV-hop algorithm and proved the algorithm is useful and effective.2、The classic DV-Hop localization algorithm used to use the least square method to find the location of the nodes. However, the performance of this method is effected by range error. Therefore, this paper put forward a quantum particle swarm (QPSO) algorithm (overall optimization algorithm, its convergence is faster) optimize the DV-Hop algorithm for these two obvious flaws for the location of the localization node. This method can reduce effect the accuracy of the ranging errors.The put forward improving algorithm are verified in the Matlab simulation environment. The experimental results show that this paper put forward algorithm have better performance and higher localization accuracy than the relative classic DV-Hop localization algorithm.