基于邻居筛选的质心迭代定位算法

A Centroid Iterative Localization Algorithm Based on Neighbor-Filtering

无线传感器网络在经济、环境、军事等领域有着非常重要的价值和潜力,而节点自身定位问题是传感器网络的一个基本问题。该文对无线传感器网络中传统的DV-HOP节点定位算法存在的问题进行了分析;给出了筛选节点邻居算法减少消息发送的数量,节省了节点能量。并提出了一种新的质心迭代定位算法,有效控制了传统定位算法中不可定位节点的数量和定位误差。对于路由选择和数据融合有重要的作用。

In the economic, environmental, military fields and so on, wireless sensor network is a promising and practical technique. It is very essential for sensors how to locate themselves in a sensor networks system. After ana- lyzing the deficiency in traditional DV- HOP node localization algorithm, the paper proposed a neighbor- filtering algorithm which can effectively bring down the amount of message sent, saving nodes＇ energy. Furthermore, a novel centroid iterative localization algorithm with the important effect on muting and data- fusion is provided to effectively reduce the number of nodes which cannot be located in traditional algorithm as well as promote the positioning precision.