earticle

논문검색

An Improved DV-Hop Localization Algorithm Based on Hop Distance and Hops Correction

초록

영어

In order to solve the problem that the DV-Hop algorithm has large error in the network topology environment of random distribution of nodes, this paper proposes a WSN localization algorithm based on hop distance correction. The algorithm uses the method of multi communication radius to correct the hop number within 1 hops, which makes it more consistent with the real situation; Then, the weighted factor is obtained by error of the average distance per hop of anchor node; Finally, the total least squares method is used to calculate the coordinates of the unknown nodes to improve the positioning accuracy of DV-Hop positioning algorithm. The simulation results show that the improved algorithm has a better accuracy and stability than the original DV-Hop algorithm.

목차

Abstract
 1. Introduction
 2. DV-Hop Localization Algorithm
  2.1. Positioning Process
  2.2. Error Analysis
 3. The Improved Localization Algorithm
  3.1. Correct the Minimum Hop Trust
  3.2. Correct the Average Distance per Hop
  3.3. Use the Total Least Squares Method to Calculate the Coordinates of Unknown Nodes
  3.4. Algorithm Flow
 4. Result Analysis
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Xiaoying Yang College of Information Engineering, Suzhou University, Suzhou, China
  • Wanli Zhang College of Information Engineering, Suzhou University, Suzhou, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.