【摘要】 针对无线传感器网络的定位问题,提出了一种分布式的算法MDS-MAP(D),明确给出了节点相对坐标计算和局部网络融合的过程,并对算法进行了计算复杂性分析和仿真。MDS-MAP(D)以分布式节点分簇为基础,利用网络的连接关系,在不需要高精度测距技术支持的条件下对节点坐标进行估计,减小了节点定位的计算复杂度和能量消耗。分析与仿真结果表明,算法的计算复杂度由O(N 3)下降到O(Nm 2),m<N,并且定位精度提高了1%～3%。更多还原

【Abstract】 A new distributed locating algorithm MDS-MAP(D) was proposed,which attempted to improve the perform-ance of node localization in wireless sensor networks.The process of the computation about node relative coordinates and the aggregation from local network to global network are introduced explicitly.Further,the analyses to computational complexity and the simulations of the algorithm are also present.MDS-MAP(D),which is based on node clustering mechanism and uses connectivity of nodes to estimate the coordinates of nodes,reduces the complexity and energy con-sumption of node localization on the absence of distance measurement with high precision.The simulation and analysis results indicate that the complexity of node localization algorithm falls to O(Nm 2),m < N from O(N 3) and the accu-racy is improved 1%～3%.更多还原