吉林大学学报(理学版)

• 计算机科学 • 上一篇    下一篇

一种基于局部信息最小二乘法的节点定位算法

吴艳玲   

  1. 武昌理工学院 信息工程学院, 武汉 430223
  • 收稿日期:2016-07-29 出版日期:2017-07-26 发布日期:2017-07-13
  • 通讯作者: 吴艳玲 E-mail:wuyanling81@126.com

A Node Localization Algorithm Based on Local Information Least Square Method

WU Yanling   

  1. College of Information and Engineering, Wuchang University of Technology, Wuhan 430223, China
  • Received:2016-07-29 Online:2017-07-26 Published:2017-07-13
  • Contact: WU Yanling E-mail:wuyanling81@126.com

摘要: 针对一些面积较大、 节点分布密度过低的实际应用场景中, 由于节点间距离测量误差过大而导致定位算法结果精度较低的问题, 提出一种根据各邻居节点相关信息划分为若干个局部网络块的节点定位算法. 该算法首先将无线传感器网络节点定位技术与机器学习领域中的降维方法相结合; 然后根据节点间的距离越近, 测量
精度越高的规则及在一定通信半径内的各邻居节点相关信息共建网络块; 最后将网络块组建成全局坐标系, 利用全局构建以及锚节点的具体信息映射出各节点的坐标. 仿真实验结果表明, 该算法较其他节点定位算法在节点定位精度方面表现更优.

关键词: 测量, 无线传感器网络, 节点, 局部网络块, 定位算法, 流形学习

Abstract: In the case of large area and low distribution density of nodes, the accuracy of localization algorithm was too low because of the excessive measurement error between nodes. The author proposed a node localization algorithm based on dividing the information of each neighbor node into several local network blocks. The algorithm first combined wireless sensor network node localization technology with the dimensionality reduction method in machine learning domain, and then according to the rule of the closer the distance between the nodes, the measurement accuracy would be the higher, relying on the information related to a certain communication radius of each neighbor node to build network blocks. Finally, the network block was built into a global coordinate system, and the coordinates of each node were mapped by using the global as well as the detailed information of anchor nodes. The simulation results show that the proposed algorithm is better than the other node localization algorithms in the localization accuracy of nodes.

Key words: localization algorithm, wireless sensor network, manifold learning, local network block, node, measurement

中图分类号: 

  • TP391