动态节点定位过程中锚节点的自适应移动方案

Anchor Adaptive Movement Algorithm for Mobile Nodes Localization

移动传感器网络中节点的位置信息是至关重要的。现有的定位方法多是基于MCL(Monte Carlo Localization)进行改进,鲜有对锚节点路径优化的算法。锚节点的随机移动往往造成资源以及能量的浪费。针对这种不足,借鉴节点效益最大化准则对锚节点路径进行优化,实现其自适应移动;在自适应移动的基础上对算法进行改进,采用阈值代替遍历的方法减少了计算量和定位时间;针对自适应移动出现的锚节点聚集的情况,对锚节点进行分区置点,较大程度地对未知节点进行覆盖,提高了未知节点的定位数量。

Location awareness is very important in mobile sensor networks. The existing methods mainly focus on the improvement based on the MCL （Monte Carlo Localization）, few of them study the anchor path planning. However, anchors random movement usually causes the waste of energy and resource. Aiming at this deficiency, this paper adopts the grid benefit criterion and achieves anchors adaptive movement. Threshold instead of traversal method is used to reduce the amount of calculation and positioning time. In order to solve the anchors aggregation problem during adaptive movement, we divide the target area into four subareas and constrain part of the anchors moving in the subarea. By this method we improve the amount of localized unknown nodes obviously.