The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Distributed online localization in sensor networks using a moving target
Proceedings of the 3rd international symposium on Information processing in sensor networks
An Empirical Study of DV-Hop Localization Algorithm in Random Sensor Networks
ICICTA '09 Proceedings of the 2009 Second International Conference on Intelligent Computation Technology and Automation - Volume 04
A Weighted DV-Hop Localization Scheme for Wireless Sensor Networks
SCALCOM-EMBEDDEDCOM '09 Proceedings of the 2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded Computing
Hi-index | 0.00 |
Knowledge of nodes' locations is an important requirement for many applications in Wireless Sensor Networks. In the hop-based range-free localization methods, anchors broadcast the localization messages including a hop count value to the entire network. Each node receives this message and calculates its own distance with anchor in hops and then approximates its own location. In this paper, we review range-free localization methods and evaluate the performance of two methods: "DV-hop" and "amorphous" by simulation. We consider some parameters like localization accuracy, energy consumption, and network overhead. Recent papers that evaluate localization methods mostly concentrated on localization accuracy. But we have considered a group of evaluation parameters, energy consuming, and network overhead in addition to the location accuracy.