Font Size: a A A

Optimization Study On DV-Hop Localization Algorithm In Wireless Sensor Network

Posted on:2017-04-30Degree:MasterType:Thesis
Country:ChinaCandidate:P C QinFull Text:PDF
GTID:2308330491451709Subject:Electronic and communication engineering
Abstract/Summary:PDF Full Text Request
In recent years, the applications about wireless sensor network are becoming more and more, so it is very important to study the localization algorithm in wireless sensor network. The thesis mainly studies the DV-Hop localization algorithm, which is one of the range-free algorithm in wireless sensor network, and proposes the following three optimization solutions to improve the node positioning accuracy:(1) In order to reduce the node positioning error caused by uneven distribution, the thesis proposes a new DV-Hop algorithm based on area partition and mobile anchor nodes. In the process of node positioning, the new algorithm firstly divides the target area into four sub-region and brings in the mobile anchor nodes; secondly it uses three different mobile ways to move the anchor nodes in order to increase the coverage of the anchor nodes, finally it uses the original DV-Hop algorithm to locate unknown nodes. The three different mobile ways are anchor in uniform distribution, anchor in density distribution and anchor in distance threshold distribution;(2) In order to reduce the node positioning error caused by the least square method, the thesis proposes a new DV-Hop algorithm based on adaptable inertia weight and linear increasing acceleration constant Particle Swarm Optimization. Firstly it uses the reciprocal of the shortest hops between the unknown node and the anchor node to weight the difference between the real distance and the estimated distance, and defines the square value as the PSO’s fitness function. Meanwhile, the new algorithm brings in adaptable ineritia weight and linear increasing acceleration constant to overcome the problems that the PSO is easy to fall into local optimum, premature convergence and so on, at last, it uses the improved PSO to solve the location of the unknown nodes;(3) The thesis combines with the above two algorithm and proposes a new DV-Hop algorithm based on APMAN-AdaCPSO. The new algorithm uses AdaCPSO to optimize the location results of APMAN-DV-Hop algorithm.The three new algorithms are simulated in the MATLAB, and the simulation results show that the three new algorithm has smaller error value and better positioning performance than the original DVHop algorithm.
Keywords/Search Tags:wireless sensor network, DV-Hop, mobile anchor node, adaptive inertia weight, PSO
PDF Full Text Request
Related items