Skip to main content

Probabilistic Distance Estimation in Wireless Sensor Networks

  • Conference paper
Mobile and Ubiquitous Systems: Computing, Networking, and Services (MobiQuitous 2010)

Abstract

Since all anchor-based range-free localization algorithms require estimating the distance from an unknown node to an anchor node, such estimation is crucial for localizing nodes in environments as wireless sensor networks. We propose a new algorithm, named EDPM (Estimating Distance using a Probability Model), to estimate the distance from an unknown node to an anchor node. Simulation results show that EDPM reaches a slightly higher accuracy for distance estimation than the traditional algorithms for regularly shaped networks, but reveals significantly higher accuracy for irregularly shaped networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Niculescu, D., Nath, B.: DV Based Positioning in Ad hoc Networks. Journal of Telecommunication Systems 22(1-4), 267–280 (2003)

    Article  Google Scholar 

  2. He, T., et al.: Range-free localization schemes in large scale sensor networks. In: 9th Annual International Conference on Mobile Computing and Networking, USA (2003)

    Google Scholar 

  3. Ji, W., Liu, Z.: Study on the Application of DV-Hop Localization Algorithms to Random Sensor Networks. Journal of Electronics & Information Technology 30(4) (April 2008)

    Google Scholar 

  4. Niu, Y., Zhang, S., Xu, X., Huo, H., Gao, S.: An Enhanced DV-hop Localization Algorithm for Irregularly Shaped Sensor Networks. In: Zhang, H., Olariu, S., Cao, J., Johnson, D.B. (eds.) MSN 2007. LNCS, vol. 4864, pp. 694–704. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Guo, Y., et al.: Hop-based Refinement Algorithm for Localization in Wireless Sensor Networks. Computer Engineering 35(3), 145–147 (2009)

    Google Scholar 

  6. Cheng, K.-Y., et al.: Improving aps with anchor selection in anisotropic sensor networks. In: International Conference on Networking and Services, pp. 49–49 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Huang, G., Delicato, F.C., Pires, P.F., Zomaya, A.Y. (2012). Probabilistic Distance Estimation in Wireless Sensor Networks. In: Sénac, P., Ott, M., Seneviratne, A. (eds) Mobile and Ubiquitous Systems: Computing, Networking, and Services. MobiQuitous 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29154-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29154-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29153-1

  • Online ISBN: 978-3-642-29154-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics