An algorithm for two-dimensional rigidity percolation: the pebble game
Journal of Computational Physics
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A kernel-based learning approach to ad hoc sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Distributed environmental monitoring using random sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
IEEE Communications Magazine
Hi-index | 0.00 |
In this paper, we propose a robot assisted localization guided by rigidity checking. For a network to be localizable, it must be rigid, which means given the existing edge constraints, there is only one location for each node in it. Many networks, however, are not rigid. To localize these nonrigid network, a robot can be used to add additional distance measure between nodes so that the network becomes rigid and localizable. To facilitate the localization and reduce the travel cost of the robot, the rigid subregions of the network are first identified. The identification of rigid subregions provides a guide for the movement of robots. A brief introduction to rigidity theory is presented in this paper. Experiments that evaluate the performance of the proposed approach are presented. The experimental results prove that the proposed approach is sound and gives excellent results compared to previous approaches for localization.