摘要： 针对无线传感器网络，提出一种基于Monte Carlo方法的非测距无线传感器网络节点定位算法。该算法通过计算随机散布的粒子与锚节点之间的距离再与最大射频传送距离比较，根据权值的改变进行滤波，确定未知节点可能存在的位置。在不同粒子数和锚节点个数下，对定位算法进行了仿真，同时对锚节点比率分别为0.1~0.5的情况下，比较了该算法和DV-Hop算法的定位性能，结果表明该算法充分利用对传感器节点定位估计的有用信息，计算复杂度小，定位精度较高、健壮性好。

关键词: 无线传感器网络, 定位算法, Monte Carlo方法, 锚节点, DV-Hop算法

Abstract: A new range-free sensor node localization algorithm is proposed based on Monte Carlo method in wireless sensor networks. By computing the distance between random particles and anchor nodes, compared with the farthest RF sending distance and filtered according to power value, the algorithm ensures the unknown node’s position. It simulates at different quantity particles and anchors. At the same time, it is compared with DV-Hop algorithm’s localization performance in 0.1~0.5 ratio of anchor. Simulation result shows that the algorithm makes full use of node’s localization information, and reduces the complexity of computing with high accuracy and well robustness.

Key words: wireless sensor networks, localization algorithm, Monte Carlo, anchor node, DV-Hop

中图分类号: 

• TP393