Multihop Range-Free Localization with Virtual Hole Construction in Anisotropic Sensor Networks 


Vol. 38,  No. 1, pp. 33-42, Jan.  2013


PDF
  Abstract

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.

  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]

S. Lee and S. Kim, "Multihop Range-Free Localization with Virtual Hole Construction in Anisotropic Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 1, pp. 33-42, 2013. DOI: .

[ACM Style]

Sangwoo Lee and Sunwoo Kim. 2013. Multihop Range-Free Localization with Virtual Hole Construction in Anisotropic Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 38, 1, (2013), 33-42. DOI: .

[KICS Style]

Sangwoo Lee and Sunwoo Kim, "Multihop Range-Free Localization with Virtual Hole Construction in Anisotropic Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 1, pp. 33-42, 1. 2013.