A Selective Anchor Node Localization Algorithm for Wireless Sensor Networks

Authors:
Shuang Tian;Xinming Zhang;Xinguo Wang;Peng Sun;Haiyang Zhang
Affiliations:
-;-;-;-;-
Venue:
ICCIT '07 Proceedings of the 2007 International Conference on Convergence Information Technology
Year:
2007

Citing 0
Cited 3

Distributed Push-pull Estimation for node localization in wireless sensor networks

Journal of Parallel and Distributed Computing
Resilient secure localization and detection of colluding attackers in WSNs

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Design and VLSI implementation of power efficient processor for object localisation in large WSN

International Journal of High Performance Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

widely used in many different scenarios. The localization information is an important criterion for the capability of WSN. Nowadays, there are many localization algorithms. DV-hop is a classical Range-free localization algorithm, by which unknown nodes can obtain anchors' information within designated hops, and estimate the distances from themselves to anchors. Unknown nodes then use the information to localize themselves. But the estimative distances may incur large error, and will jeopardize the localization precision. In order to solve the problem, we propose a selective anchor node localization algorithm (SANLA) for wireless sensor networks in this paper, and it can make unknown nodes choose three anchors which are the most accurate to execute trilateration. The experiment results illustrate that our algorithm is valid and effective. Keywords-DV-hop; localization; trilateration; wireless sensor networks I.