Towards Unique and Anchor-Free Localization for Wireless Sensor Networks
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.
KeywordsUnique localization analysis Anchor-free Transformation matrix Wireless sensor network
Unable to display preview. Download preview PDF.
- 2.Priyantha, N. B., Miu, A. K. L., Balakrishnan, H., & Teller, S. (2001). The cricket compass for context-aware mobile applications. Proceedings Annual ACM International Conference on Mobile Computing and Networking, 1–14.Google Scholar
- 3.Guvenc, I., Gezici, S., & Sahinoglu, Z. (2008). Ultra-wideband range estimation: theoretical limits and practical algorithms. Proceedings of the IEEE International Conference on Ultra-Wideband, 93–96.Google Scholar
- 5.Niculescu, D., & Nath, B. (2003). Ad hoc positioning system (APS) using AOA. Proceedings of the IEEE International Conference on Computer Communications, 3, 1734–1743.Google Scholar
- 8.Savvides, A., Han, C. C., & Srivastava, M. (2001). Dynamic fine-grained localization in ad-hoc networks of sensors. Proceedings of the IEEE/ACM Annual Conference on Mobile Computing and Networks 166–179.Google Scholar
- 10.Iyengar, R., & Sikdar, B. (2003). Scalable and distributed GPS free positioning for sensor networks. Proceedings of the IEEE International Conference on Communications, 1, 338–342.Google Scholar
- 11.Cheng, X., Thaeler, A., Xue, G., & Chen, D. (2004). TPS: a time-based positioning scheme for outdoor sensor networks. Proceedings of the IEEE International Conference on Computer Communications, 4, 2685–2696.Google Scholar
- 12.Moore, D., Leonard, J., Rus, D., & Teller, S. (2004). Robust distributed network localization with noisy range measurements. Proceedings of the ACM Conference on Embedded Networked Sensor Systems, 50–61.Google Scholar
- 13.Youssef, A., & Agrawala, A. (2005). Accurate anchor-free node localization in wireless sensor networks. Proceedings of the IEEE International Performance Computing and Communications Conference, 465–470.Google Scholar
- 14.Wen, C. Y., & Hsiao, Y. C. (2008). Decentralized anchor-free localization for wireless ad-hoc sensor networks. Proceedings of the IEEE International Conference on System, Man, and Cybernetic, 2776–2784.Google Scholar
- 17.Bal, M., Liu, M., Shen, W., & Ghenniwa, H. (2009). Localization in cooperative wireless sensor networks: a review. Proceedings of the IEEE International Conference on Computer Supported Cooperative Work in Design, 438–443.Google Scholar
- 24.Henzinger, M. R., Rao, S., & Gabow, H. N. (1996). Computing vertex connectivity: new bounds from old techniques. Proceedings of the IEEE Annual Symposium on Foundations of Computer Science, 462–471.Google Scholar
- 25.Kannan, A. A., Fidan, B., & Mao, G. (2008). Robust distributed sensor network localization based on analysis of flip ambiguities. Proceedings of the IEEE Global Telecommunications Conference, 1–6.Google Scholar