Font Size: a A A

Research On Location Algorithm Of Wireless Sensor Networks Based On DV-hop

Posted on:2018-02-27Degree:MasterType:Thesis
Country:ChinaCandidate:G YangFull Text:PDF
GTID:2348330512466996Subject:Electronic and communication engineering
Abstract/Summary:PDF Full Text Request
As wireless sensor networks is a new cross-disciplinary area,the node localization which is one of the key support technology of wireless sensor networks is now becoming a popular research objective.Through the self-organization of sensor nodes,wireless sensor networks can collect and process information in the monitoring area and apply it to many scenes like environmental detection and so on.The monitoring information collected by the node does have a practical significance if the accurate localization of the node becomes realized.At present,there is still a lot to improve for the general node localization technology.Therefore,the key point of this paper is to improve the localization accuracy.Several classic localization methods are particularly studied based on the ranging and non-ranging measurement,and the comparison is made.By deeply analyzing the basic principle and localization process of the DV-Hop location algorithm,the cause of localization errors of traditional localization algorithm generated by minimum hops is analyzed and demonstrated in detail.For this error factor,RSSI ranging technology is introduced to optimize the minimum hop calculation stage and the DV-Hop algorithm is used to improve the minimum hop count.For the localization error caused by the average hop distance calculation,an DV-Hop average hop distance improved localization algorithm is proposed after optimizing the hop distance of the DV-hop algorithm.By introducing the beacon node ratio and the optimization threshold value,the calculations were corrected.And these two different stages of optimization algorithms are combined into improve the localization algorithm based on hop hop distance optimization,which possessed the advantages of the two algorithms.For the stage of calculating the coordination with unknown node and beacon node,the least squares method is used to analyze the localization error caused by initial sensitivity.The improved PSO algorithm is optimized by using particle swarm optimization with extremum perturbation.At last,primitive localization algorithm and three improved algorithms are analyzed by the simulation test by multi-source test such as the beacon node ratio and the node communication radius and so forth.The experimental results show that in localization stability and localization accuracy,those three improved algorithms are much improved than the original algorithm.The PSO algorithm has faster convergence speed and higher localization accuracy than the unoptimized algorithm without increasing the energy consumption.
Keywords/Search Tags:wireless sensor networks, DV-Hop localization, smallest hops, average hop removing, particles group majorization
PDF Full Text Request
Related items