Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Recursive Position Estimation in Sensor Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Error characteristics of ad hoc positioning systems (aps)
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Improving APS with Anchor Selection in Anisotropic Sensor Networks
ICAS-ICNS '05 Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services
Handbook of Algorithms for Wireless Networking and Mobile Computing (Chapman & Hall/Crc Computer & Information Science)
Localization systems for wireless sensor networks
IEEE Wireless Communications
Computers and Electrical Engineering
Energy consumption bounds analysis and its applications for grid based wireless sensor networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Localization systems have been identified as a key issue in the development and operation of wireless ssensor networks. DV-Hop, a well-known localization algorithm, has recently been proposed for WSNs. Its basic idea relies on transforming the distance to all beacon nodes from hops to meters by using the computed average size of a hop. Despite its advantages, the DV-Hop algorithm has some limitations, mainly due to its high communication cost and energy consumption, which unfortunately limit its applicability to small or medium-sized sensor networks. The scalability issue of DV-Hop is a challenging problem that needs to be addressed. In this article we propose a novel localization-based protocol and show how Voronoi diagrams can be used efficiently to scale a DV-Hop algorithm while maintaining and/or reducing further DV-Hop's localization error. In our localization scheme, nodes can also be localized by their Voronoi cells. In order to evaluate the performance of our scheme, we present an extensive set of simulation experiments using ns-2. Our results clearly indicate that our proposed algorithm performs and scales better than DV-Hop.