In the traditional dv-hop location algorithm, the number of hops within the communication radius is counted as one hop. However, in the case of uneven distribution of nodes, this method will bring a large error to the...
详细信息
In the traditional dv-hop location algorithm, the number of hops within the communication radius is counted as one hop. However, in the case of uneven distribution of nodes, this method will bring a large error to the calculation of hop distance. In order to solve the above problems, an improved dv-hop location algorithm with multiple communication radius is proposed in this paper. Based on the multi-communication radius locationalgorithm, the method uses the cosine theorem to correct the hop number and estimated the average hop distance, and optimizes the estimated distance of the unknown node. The algorithm uses multiple communication radius to broadcast the position to obtain the minimum number of hops between the unknown node and the beacon node and adjusts the estimated hop distance by using the cosine theorem after estimating the good hop distance, and finally uses the trilateration method, or the maximum likelihood estimation method estimates the position coordinates. The experimental results show that compared with the traditional dv-hopalgorithm and Ddv-hopalgorithm, the improved dv-hopalgorithm improves the positioning accuracy and reduces the average positioning error of the unknown nodes.
this paper drills down and systematically analyzes the improved dv-hopalgorithm about the origin of its position errors. A new method is hereby given for modifying such position errors. Beyond that, the particle swar...
详细信息
this paper drills down and systematically analyzes the improved dv-hopalgorithm about the origin of its position errors. A new method is hereby given for modifying such position errors. Beyond that, the particle swarm-quasi-Newton algorithm is improved, intercepting the combined dvhoplocationalgorithm according to the number of known nodes which has been defined by a threshold N. The coordinate of unknown nodes is calculated and analyzed by the combined particle swarm-quasi-Newton algorithm. Then this paper makes a validation analysis on the results by the way of emulation. The results show that the improved algorithm is relatively superior with high precision and lower position error than improved dv-hop as intercepted.
暂无评论