원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.9 No.11
2015.11
pp.303-312
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
Reference
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
Reference
저자정보
참고문헌
자료제공 : 네이버학술정보