Geometric range-free localization algorithm based on optimal anchor node selection in wireless sensor networks

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In range-free localization scheme of wireless sensor networks, estimating the distance to the anchor nodes having the actual location is common to compute the position of unknown node. Since the range-free scheme is based on the topology information, the accuracy of distance estimation is considerably affected by node density or node deployment. In this paper, we propose a geometric range-free localization algorithm which estimates the unknown positions geometrically by topological information without considering the distance estimation. To achieve this, we propose an optimal anchor node selection algorithm which selects the anchor nodes connected topologically well for the geometrical location estimation. Simulation results show that the proposed algorithm offers considerably an improved performance compared to the other existing studies. © 2014 Hyunjae Woo and Chaewoo Lee.

Cite

CITATION STYLE

APA

Woo, H., & Lee, C. (2014). Geometric range-free localization algorithm based on optimal anchor node selection in wireless sensor networks. International Journal of Distributed Sensor Networks, 2014. https://doi.org/10.1155/2014/509892

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free