skip to main content
10.1145/1868612.1868615acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Exploiting the distribution of distances between nodes to efficiently solve the localization problem in wireless sensor networks

Published:20 October 2010Publication History

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.

References

  1. 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 ScholarGoogle ScholarCross RefCross Ref
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarCross RefCross Ref
  4. J. Dall and M. Christensen. Random geometric graphs. Physical Review E, 66:016121, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. K. Langendoen and N. Reijers. Distributed localization in wireless sensor networks: a quantitative comparison. Computer Networks, 43:499--518, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Nagpal. Organizing a global coordinate system from local information on an amorphous computer. A.I. Memo 1666, MIT A.I. Laboratory, 1999.Google ScholarGoogle Scholar
  9. D. Niculescu and B. Nath. Ad hoc positioning system (APS). Proc. IEEE Global Telecommunications Conference, 5:2926--2931, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  10. 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 ScholarGoogle ScholarCross RefCross Ref
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. K. Römer and F. Mattern. The design space of wireless sensor networks. IEEE Wireless Communications, 11(6):54--61, December 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Exploiting the distribution of distances between nodes to efficiently solve the localization problem in wireless sensor networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      PM2HW2N '10: Proceedings of the 5th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
      October 2010
      98 pages
      ISBN:9781450302784
      DOI:10.1145/1868612

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 October 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      PM2HW2N '10 Paper Acceptance Rate13of40submissions,33%Overall Acceptance Rate74of226submissions,33%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader