传感技术学报Issue(3)：424-429,6.DOI:10.3969/j.issn.1004-1699.2015.03.022
一种最优锚节点集合上的两重粒子群优化DV-Hop定位算法
A Kind of Double Particle Swarm Optimization DV-Hop Localization Algorithm Based on Best Anchor Nodes Set
曹欲晓 1严奎 2徐金宝1
作者信息
- 1. 南京工程学院计算机工程学院，南京211167
- 2. 南京工程学院工业中心，南京211167
- 折叠
摘要
Abstract
For the improved DV-Hop algorithms based on particle swarm optimization,almost all the anchor nodes in the network are involved in the locating optimization. However,the anchor nodes which have obvious errors between anchor and unknown nodes will lead to big errors of localization. Hence,the concept of best anchor nodes set is pro-posed. During the process of location,the best anchor nodes set is constructed by employing the discrete particle swarm optimization algorithm. Then the continuous particle swarm optimization algorithm is used to optimize locali-zation for the best anchor nodes set. The simulation results show that the proposed method is effective.关键词
无线传感器网络/节点定位/DV-Hop算法/粒子群算法/锚节点/最优锚节点集合Key words
wireless sensor network/node localization/DV-Hop algrothrim/particle swarm optimization algrothrim/anchor node/best anchor nodes set分类
信息技术与安全科学引用本文复制引用
曹欲晓,严奎,徐金宝..一种最优锚节点集合上的两重粒子群优化DV-Hop定位算法[J].传感技术学报,2015,(3):424-429,6.
