Skip to Main Content
Localization systems have been identified as a key issue in the development and operation of wireless sensor 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.
Date of Publication: April 2009