大多数传统的方法并不能处理一些影响定位算法性能的因素,如各向相异的投放环境,不精确的锚节点位置以及带误差的距离测量。该文提出一种鲁棒的区域定位算法,通过建立一个全局约束集来处理如上所述的影响因素。使用可行解区域投影方法计算每个节点的可行地理区域,将传感器节点的真实位置限定于该区域中,同时利用非凸约束计算其存在的内部空洞。此外为了提高该方法的实用性,提出了一种基于分簇的分布式迭代算法。仿真结果表明算法受地理环境,测量误差等因素的影响较小,能适用于传感器网络应用。
Traditional localization methods usually can not handle sensor networks which are affected by several practical factors, such as anisotropic deployment terrain, imprecise anchor node position and noisy range measurements. In this paper, a robust region localization approach is proposed to naturally address these factors by constructing a global constraint set. A projection method is given to compute feasible geographic region, which can assuredly bound actual node position. The infeasible holes within the region are also computed using non-convex constraints. To enhance the practicability of this method, an iterative and distributed implementation based on clustering. Simulation results show that the algorithm is not affected by deployment terrain and measurement noise, thus it is applicable for sensor networks.