The cricket compass for context-aware mobile applications
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Computing vertex connectivity: new bounds from old techniques
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Discrete & Computational Geometry
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Distributed direction-based localization in wireless sensor networks
Computer Communications
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
Localization in cooperative Wireless Sensor Networks: A review
CSCWD '09 Proceedings of the 2009 13th International Conference on Computer Supported Cooperative Work in Design
Globally rigid circuits of the direction--length rigidity matroid
Journal of Combinatorial Theory Series B
High accuracy localization method using AoA in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Despite a large number of approaches developed for wireless sensor network (WSN) localization, there are still many unsolved problems in this area. The challenges to be addressed are both in analyzing characteristics of the localizable WSNs and designing efficient localization algorithms under a variety of conditions. In this paper we first draw on powerful results from graph rigidity theory and combinatorial theory, revealing that the combination of distance constraint and bearing constraint leads to necessary and sufficient condition for unique localization. This enlightens our proposing an anchor-free and computationally simple ad hoc localization algorithm for WSNs. A novel combination of distance and direction estimation technique is introduced to detect and estimate ranges between neighbors. Using this information we construct unidirectional local coordinate systems to avoid the reflection ambiguity. Such local maps then converge to form a global network wide coordinate system using a transformation matrix [T], which finally leads to node absolute positions. Simulation results have shown that our algorithm achieves high accuracy without using any error refining schemes.