DV-Hop localization algorithms in wireless sensor networks




Du, Xiaoxi

Journal Title

Journal ISSN

Volume Title



Localization algorithms are becoming more and more important in wireless sensor networks (WSNs). Localization algorithms can be classified into two categories: range-based and range-free. Distance vector-hop (DV-Hop) is a range-free localization algorithm using the numbers of hops to estimate distance. This project focuses on the performance of DV-Hop and two variations of DV-Hop: DV-Hop with correction (CDV-Hop) and improved DV-Hop (IDV-Hop). The simulation of these algorithms is written in the Java programming language using an open source WSN simulator called NetTopo. This project investigates the performance of these algorithms with multiple factors: the anchor node density (AND), the number of sensor nodes (SNN), the transmission radius (TR) of the sensor nodes, and the neighborhood size (NS) of the sensor nodes. The connected k-neighborhood (CKN) algorithm is used as a tool in the investigation of the NS. CKN extracts a subset of sensor nodes with k-neighborhood connectivity (k approximates the NS of the network of the extracted subset of sensor nodes). Based on the above factors, the localization accuracy of the three DV-Hop algorithms is examined. Experimental results compare the performance of the three algorithms and give hints on the choice of the parameters.



wireless sensor networks, DV-Hop, localization, CKN