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

›› 0, Vol. ›› Issue (): 0-0.

• 信息科学与工程 •    下一篇

基于估计距离的MDS-MAP定位算法

孟颍辉1,闻英友1,陈剑2,赵宏3   

  1. 1. 东北大学
    2. 辽宁省沈阳市东北大学341信箱
    3.
  • 收稿日期:2013-08-28 修回日期:2013-10-21 出版日期:2014-07-15 发布日期:2014-04-11
  • 通讯作者: 孟颍辉
  • 基金资助:
    国家自然科学基金项目;中央高校基本科研业务费资;沈阳市科技计划项目

MDS-MAP Localization Algorithm Based on Estimated Distances

  • Received:2013-08-28 Revised:2013-10-21 Online:2014-07-15 Published:2014-04-11

RichHTML

0

摘要： 针对无需测距定位算法定位误差大的问题，本文提出了一种基于估计距离的MDS-MAP定位算法。首先分析了两个邻居节点之间距离和通信范围相交面积之间的关系，得到一个函数。函数的输入是两个邻居节点通信范围相交面积中包含的节点个数和其中一个节点通信范围中包含的节点个数，输出是一个表示两个邻居节点之间距离远近关系的参数，称之为距离参数。然后用距离参数和锚节点之间的距离计算邻居节点之间的估计距离。最后根据估计距离和MDS-MAP计算未知节点的估计位置。仿真结果表明，本文算法的定位误差低于当前同类型的定位算法。

关键词: 无需测距, MDS-MAP, 邻居节点, 通信范围, 锚节点, range-free, MDS-MAP, neighbor nodes, communication range, anchor nodes

Abstract: To address the high localization error of range-free localization algorithms, this paper proposes a MDS-MAP localization algorithm based on estimated distances. First, we analyze the relation between the distance of two neighbor nodes and the intersection area of them, and get a function. The input of the function is the number of nodes within the intersection area and the number of nodes within in the communication range of a node. The output is a distance parameter which can represent the distance of neighbor nodes. We use the distances of anchor nodes and the distance parameter of neighbor nodes to calculate estimated distances between neighbor nodes. Then, we calculate the estimated positions of non-anchor nodes based on estimated distances and the MDS-MAP algorithm. Simulation results show that the localization error of the proposed algorithm is lower than the current range-free algorithms.