Dynamic Hop-Limit Localization Algorithm Based on DV-Hop

Position information of individual nodes is useful in wireless sensor networks and a variety of localization algorithms have been proposed. Based on comprehensive analysis of DV-Hop localization algorithm, a Dynamic Limit DV-Hop (DLDV-Hop) algorithm is put forward in this paper to overcome some disadvantages of DV-Hop algorithm. In DLDV-Hop algorithm, the least hop number between nodes is limited to improve the positioning accuracy. And then some located nodes are promoted to anchors, so that most unknown nodes can be located by enough anchors nearby. Thus, the network coverage can nearly extend to all the unknown nodes. The simulation results demonstrate that the proposed algorithm DLDV-Hop is more efficient in precision than the DV-Hop, without sacrificing the network coverage. In addition, DLDV-Hop reduces the reliance on the evenness of network structure, and is adaptive to various environments even in irregular distribution shape sensor networks.