摘要
为提高无需测距定位算法精度,提出一种最优分割圆定位(OPCL)算法.以节点通信半径做分割圆,将待定位节点附近的锚节点分割为圆内及圆外两部分,定义匹配函数以量化衡量分割结果与实际一、两跳锚节点集合的匹配程度.在一定搜索范围和搜索粒度下,取最优分割圆的圆心作为目标位置.算法综合利用了节点连通性约束及非连通性约束.仿真结果显示,与同类的质心算法、最小包含圆算法相比定位精度显著提升,尤其是对边缘节点定位效果更明显.
A new localization algorithm was proposed for improving precision of range-free localization.The algorithm is based on a partitioned circle whose radius was equal to the node communication range.A partitioned circle can separate the anchor nodes around the target node into two parts.A function was used to calculate the offset between such partitioning results and the real one-hop and two-hop anchor node sets.By searching a certain area,the optimal partitioned circle can be selected.The center of the optimal partitioned circle is regarded as the position of the target node.Simulation results show that the new algorithm significantly increased localization accuracy,especially for nodes at the edge of the networks.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2011年第3期335-339,共5页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(60602061
60803131)
关键词
无线传感器网络
分割圆
定位
无需测距
边缘节点
wireless sensor networks
partitioned circle
localization
range-free
edge-node
