A Ranging-free Localization based on RSS-comparison in Wireless Sensor Networks 


Vol. 35,  No. 10, pp. 808-814, Oct.  2010


PDF
  Abstract

Wireless sensor networks are becoming more widely used in various fields. Localization is a fundamental and crucial issue for sensor network operation and management. In this paper, we propose a simple, distributed and low cost localization algorithm which approaches the benefits of ranging-free schemes. The proposed algorithm utilizes the location information of neighbor anchor nodes to estimate an estimative area which has the unknown node inside. Then, by using RSS (Received Signal Strength)-comparison, it compares the RSS of received signals from the neighbor anchor nodes and reduces the estimative area. Simulation results show that our proposed algorithm is more accurate and stable than the traditional CPE (Convex Position Estimation) algorithm which has the same approach.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Q. T. Hoang, T. N. Le, J. Kim, Y. Shin, "A Ranging-free Localization based on RSS-comparison in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 10, pp. 808-814, 2010. DOI: .

[ACM Style]

Quan T. Hoang, Tan N. Le, Jongho Kim, and Yoan Shin. 2010. A Ranging-free Localization based on RSS-comparison in Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 35, 10, (2010), 808-814. DOI: .

[KICS Style]

Quan T. Hoang, Tan N. Le, Jongho Kim, Yoan Shin, "A Ranging-free Localization based on RSS-comparison in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 10, pp. 808-814, 10. 2010.