Difficult to solve the Euclidean-distance based multi-hop localization, the concept of rigid graph with globally rigid graph is introduced, rigid framework theory and graph theory are applied to the wireless sensor networks, the most important issue in multi-hop localization - unique solvability problem is converted into identification of globally rigid graph, and the sufficient and necessary conditions are provided to the global rigidity identification, the analysis of complex rigid framework of the theory is effectively reduced. Triangular extension method is adopted to gradually build the globally rigid graph, and then more and more nodes can be positioned uniquely, finally, to determine the purpose of all locate the position of the node.
NETL
NSTL
万方数据
维普
