ABSTRACT
The localization problem is a central one in the field of wireless sensor networks, but despite the ingenuity of previous attempts at solution, developing an efficient and accurate localization method has remained essentially an open problem. This is so, in our view, because there has been a lack of theoretical results to support more solid advances. In this paper, we build on the semi-analytical approach we developed elsewhere, by exploiting its results regarding the relationship between Euclidean distances and hop distances in wireless sensor networks to improve on one of the most robust localization methods we know of, the well-known DV-hop. Our improvements result in better accuracy, reduced communication costs and local processing, as well as time and energy savings. The results we present are based on simulations through which we compare the new method with the original DV-hop. In addition to the new, more efficient localization method, we also provide a new perspective on the distance relationships, and thereby also contribute to furthering the establishment of a better theoretical understanding of the subject.
- P. Bahl and V. Padmanabhan. RADAR: An in-building RF-based user location and tracking system. In Proc. International Annual Joint Conference of the IEEE Computer and Communications Societies, pages 775--784, 2000.Google ScholarCross Ref
- M. Bradonjic, R. Elsässer, T. Friedrich, T. Sauerwald,and A. Stauffer. Efficient broadcast on random geometric graphs. In Proc. Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1412--1421, 2010. Google ScholarDigital Library
- N. Bulusu, J. Heidemann, and D. Estrin. GPS-less low-cost outdoor localization for very small devices. IEEE Personal Communications, 7(5):28--34, 2000.Google ScholarCross Ref
- J. Dall and M. Christensen. Random geometric graphs. Physical Review E, 66:016121, 2002.Google ScholarCross Ref
- T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher. Range-free localization schemes in large scale sensor networks. In Proc. ACM International Conference on Mobile Computing and Networking, pages 81--95, 2003. Google ScholarDigital Library
- K. Langendoen and N. Reijers. Distributed localization in wireless sensor networks: a quantitative comparison. Computer Networks, 43:499--518, 2003. Google ScholarDigital Library
- R. S. C. Leão and V. C. Barbosa. Approximate conditional distributions of distances between nodes in a two-dimensional sensor network. In K. Al-Begain, D. Fiems, and G. Horv´ath, editors, Analytical and Stochastic Modeling Techniques and Applications, volume 5513 of Lecture Notes in Computer Science, pages 324--338. Springer-Verlag, Berlin, Germany, 2009. Google ScholarDigital Library
- R. Nagpal. Organizing a global coordinate system from local information on an amorphous computer. A.I. Memo 1666, MIT A.I. Laboratory, 1999.Google Scholar
- D. Niculescu and B. Nath. Ad hoc positioning system (APS). Proc. IEEE Global Telecommunications Conference, 5:2926--2931, 2001.Google ScholarCross Ref
- D. Niculescu and B. Nath. Ad hoc positioning system (APS) using AOA. In Proc. International Annual Joint Conference of the IEEE Computer and Communications Societies, volume 3, pages 1734--1743, 2003.Google ScholarCross Ref
- N. Priyantha, A. Chakraborty, and H. Balakrishnan. The Cricket location-support system. In Proc. ACM International Conference on Mobile Computing and Networking, pages 32--43, 2000. Google ScholarDigital Library
- K. Römer and F. Mattern. The design space of wireless sensor networks. IEEE Wireless Communications, 11(6):54--61, December 2004. Google ScholarDigital Library
- C. Savarese, J. Rabaey, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In Proc. USENIX Technical Annual Conference, pages 317--328, 2002. Google ScholarDigital Library
Index Terms
- Exploiting the distribution of distances between nodes to efficiently solve the localization problem in wireless sensor networks
Recommendations
Localization Schemes in Wireless Sensor Networks
ACCT '12: Proceedings of the 2012 Second International Conference on Advanced Computing & Communication TechnologiesIn wireless sensor networks, nodes are deployed in sensor field for various monitoring applications such as tracking, rescue operations, disaster relief, traffic monitoring, etc. So node localization is one of the fundamental challenges in the wireless ...
Cooperative localization techniques for wireless sensor networks: free, signal and angle basedtechniques
This paper addresses the problem of localization in sensor networks where, initially, a certain number of sensors are aware of their positions either by using GPS or by being hand-placed and are referred to as anchors. Our goal is to localize all ...
An Optimization Algorithm for Wireless Sensor Networks Localization Using Multiplier Method
CSO '10: Proceedings of the 2010 Third International Joint Conference on Computational Science and Optimization - Volume 02One of the main problems facing sensor localization in wireless communication systems is accuracy. In this paper, we propose an optimization algorithm for wireless sensor networks localization based on time-of-arrival (TOA) technique. The optimal points ...
Comments