earticle

논문검색

Comparative Performance Study of Localization Schemes in Wireless Sensor Networks

원문정보

초록

영어

Localization is one of the most important tasks for location-aware applications in wireless sensor networks (WSNs). The accuracy of positioning information gives the applications a great number of advantages and, thus, it is very important to choose a localization scheme with the highest accuracy. In this paper, we review three typical localization schemes for WSNs and, then, compare their performance via computer simulation in terms of localization accuracy. The simulation study shows that the probability grid localization scheme achieves the best performance with the minimum location error rate.

목차

Abstract
 1. Introduction
 2. Localization Schemes
  2.1. Distance Vector Hop Algorithm (DV-Hop)
  2.2. The Probability Grid Localization Scheme
  2.3. Localization Algorithm Using Expected Hop Progress in WSNs (LAEP)
 3. Performance Evaluation and Comparison
  3.1. Simulation Environment
  3.2. Simulation Results and Discussion
 4. Conclusion
 Acknowledgements
 References

저자정보

  • Han Su Dept. of Computer Eng., Chosun University
  • Sangman Moh Dept. of Computer Eng., Chosun University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.