earticle

논문검색

Improved DV-Hop Algorithm Based on Artificial Bee Colony

초록

영어

In order to reduce the node position error of DV-Hop algorithm in wireless sensor network, the artificial bee colony algorithm is introduced to design the DV-Hop algorithm. A new ABCDV-Hop (Artificial Bee Colony DV-Hop) algorithm is proposed in this paper. Based on the traditional DV-Hop algorithm, by using the minimum hops of nodes and position information of anchor nodes, the average distance per hop is solved by artificial bee colony algorithm to make it more close to the actual value. The simulation results show that compared with the traditional DV-Hop algorithm, the improved algorithm can effectively reduce the positioning error without increasing the node hardware overhead.

목차

Abstract
 1. Introduction
 2. Error Analysis of DV-Hop Algorithm
 3. ABCDV-Hop Algorithm
  3.1. The Principle of ABC Algorithm
  3.2. The ABC Algorithm Is Used To Solve the Average Distance Per Hop
  3.3. Realization ABCDV-Hop Algorithm
 4. The Simulation Experiment
  4.1. The Simulation Environment and Parameter Setting
  4.2. Positioning Accuracy Analysis
  4.3. Analysis of the Complexity of the Algorithm
 5. Conclusion
 References

저자정보

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

참고문헌

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

    함께 이용한 논문

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

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