作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 移动互联与通信技术 • 上一篇    下一篇

融合质心算法的快速改进型MDS-MAP 算法

李海峰   

  1. (山西财经大学信息管理学院,太原030006)
  • 收稿日期:2014-06-25 出版日期:2015-05-15 发布日期:2015-05-15
  • 作者简介:李海峰(1982 - ),男,讲师、硕士,主研方向:无线传感器网络定位,网络信息安全,数据挖掘。

Fast Improved MDS-MAP Algorithm Fused with Centroid Algorithm

LI Haifeng   

  1. (School of Information Management,Shanxi University of Finance & Economics,Taiyuan 030006,China)
  • Received:2014-06-25 Online:2015-05-15 Published:2015-05-15

摘要: 针对MDS-MAP 算法中多维定标矩阵过于庞大而造成计算繁琐的问题,提出一种快速改进型MDS-MAP 算法。将MDS-MAP 算法与质心算法进行结合,得到改进的迭代定位算法。构造无线传感器节点间距的矩阵,根 据锚节点间的跳数与具体距离对无线传感器网络节点间平均每跳的距离进行估算,按每个节点相互间的跳数矩阵 对每个节点相互间距进行求解,从而获得其相对和绝对坐标。仿真实验结果表明,该算法在设定的误差下具有较 高的精度,并且在一定程度上降低了运行时间。

关键词: MDS-MAP 算法, 无线传感器网络, 节点定位, 质心算法, 锚节点, 跳数矩阵

Abstract: In view of the complex calculating problem caused by too large Multi Dimensional Scaling(MDS) matrix in the MDS-MAP algorithm,this paper presents a fast improved MDS-MAP algorithm. This algorithm fuses improved iterative positioning algorithm of centroid algorithm on the basis of the original algorithm on MDS-MAP,as an alternative to the classical MDS solution. It configures the distance among the wireless sensor nodes as a matrix,first according the hops of the anchor nodes and the actual distance between the anchor nodes to estimate the average distance per hop of the wireless sensor nodes. Then according the constructed hops matrix between the nodes,it calculates the distance between the nodes,finally obtains the relative coordinates to absolute coordinates of the wireless sensor nodes. Simulation results show that the algorithm in the error sets ensure the considerable accuracy of the MDS-MAP algorithm,while also reduces the running time of the algorithm significantly.

Key words: MDS-MAP algorithm, Wireless Sensor Network(WSN), node positioning, centroid algorithm, anchor node, hop matrix

中图分类号: