东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2011, Vol. 32 ›› Issue (3): 335-339.DOI: -

• 论著 • 上一篇    下一篇

无线传感器网络中最优分割圆定位算法

喻嘉;闻英友;赵宏;周月侨;   

  1. 东北大学信息科学与工程学院;天津大学精密仪器与光电子工程学院;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60602061,60803131)

Localization algorithm for wireless sensor networks using an optimal partitioned circle

Yu, Jia (1); Wen, Ying-You (1); Zhao, Hong (1); Zhou, Yue-Qiao (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) College of Precision Instrument and Opto-Electronic Engineering, Tianjin University, Tianjin 300072, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Yu, J.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

721

摘要： 为提高无需测距定位算法精度,提出一种最优分割圆定位(OPCL)算法.以节点通信半径做分割圆,将待定位节点附近的锚节点分割为圆内及圆外两部分,定义匹配函数以量化衡量分割结果与实际一、两跳锚节点集合的匹配程度.在一定搜索范围和搜索粒度下,取最优分割圆的圆心作为目标位置.算法综合利用了节点连通性约束及非连通性约束.仿真结果显示,与同类的质心算法、最小包含圆算法相比定位精度显著提升,尤其是对边缘节点定位效果更明显.

关键词: 无线传感器网络, 分割圆, 定位, 无需测距, 边缘节点

Abstract: 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.

中图分类号: