【摘要】 针对无线传感器网络中的节点定位问题,分析了节点在网络中满足可定位性的测距图条件。在满足图刚性的前提下,给出一种基于分簇结构的节点可定位性判定算法。该分布式算法通过邻居节点间信息交换,能够识别网络中的可定位节点形成的分簇,相比于传统Wheel扩展法提高了算法有效性,能够缓解锚节点不在同一个wheel图中无法启动的问题,因此算法识别可定位节点的能力更强。更多还原

【Abstract】 This paper analyzes the localizability conditions for a node in wireless sensor network(WSN),with respect to the ranging graph.To satisfy the rigidity of graph,this paper proposes an algorithm to test if a node in WSN can be localized via clustering the sensor nodes.This distributed algorithm could find the clusters formed by localizable nodes in network.Compared with Wheel extension,the proposed algorithm performs efficiently and can alleviate the problem caused by anchors distribution.更多还原