Localization in Sensor Networks with Fading Channels Based on Nonmetric Distance Models
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Design and implementation of a navigation system for autonomous mobile robots
International Journal of Ad Hoc and Ubiquitous Computing
Distributed Push-pull Estimation for node localization in wireless sensor networks
Journal of Parallel and Distributed Computing
A new range-free localization method using quadratic programming
Computer Communications
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measuring air quality in city areas by vehicular wireless sensor networks
Journal of Systems and Software
Three-dimensional localization algorithm based on LIE
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I
Low-cost two-hop anchor node-based distributed range-free localization in wireless sensor networks
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
Wireless Communications & Mobile Computing
ACM Transactions on Embedded Computing Systems (TECS) - Special issue on embedded systems for interactive multimedia services (ES-IMS)
| Hi-index | 0.00 |
Localization is a fundamental and essential issue for wireless sensor networks (WSNs). Existing localization algorithms can be categorized as either range-based or range-free schemes. Range-based schemes are not suitable for WSNs because of their irregularity of radio propagation and their cost of additional devices. In contrast, range-free schemes do not need to use received signal strength to estimate distances and only need simple and cheap hardware, and are thus more suitable for WSNs. However, existing range-free schemes are too costly and not accurate enough or are not scalable. To improve previous work, we present a fully distributed range-free localization scheme for WSNs. We assume that only a few sensor nodes, called anchors, know their locations, and the remaining (normal) nodes need to estimate their own locations by gathering nearby neighboring information. We propose an improved grid-scan algorithm to find the estimated locations of the normal nodes. Furthermore, we derive a vector-based refinement scheme to improve the accuracy of the estimated locations. Analysis, simulation, and experiment results show that our scheme outperforms the other range-free schemes even when the communication radius is irregular.