Computer Engineering and Applications ›› 2017, Vol. 53 ›› Issue (22): 61-65.DOI: 10.3778/j.issn.1002-8331.1605-0287

Previous Articles     Next Articles

Hierarchical location algorithm in wireless sensor networks

ZHU Jianrui, SONG Ling   

  1. School of Computer & Electronics Information, Guangxi University, Nanning 530004, China
  • Online:2017-11-15 Published:2017-11-29


主建蕊,宋  玲   

  1. 广西大学 计算机与电子信息学院,南宁 530004

Abstract: In view of node location problems in the wireless sensor networks, in order to improve the positioning accuracy of unknown nodes, in this paper, a hierarchical location algorithm which has nothing to do with the distance(IDV-Hop+IMP) is put forward. IDV-Hop method is proposed for normal nodes which have less than three neighbor anchors; IMP method is proposed for normal nodes which have three neighbor anchors; the weighted centroid location algorithm is proposed for normal nodes which have more than three neighbor anchors. Under the environment of sparse anchor nodes, simulation results show that while guaranteeing the positioning coverage, IDV-Hop+IMP algorithm has higher positioning accuracy than DV-Hop and centriod algorithm.

Key words: wireless sensor networks, node location, positioning accuracy, DV-Hop, centroid algorithm

摘要: 对无线传感器网络节点定位问题进行了研究,为了提高未知节点的定位精度,提出了一种与距离无关的分级定位算法(IDV-Hop+IMP)。当未知节点周围邻居锚节点的数量少于三个时,采用IDV-Hop算法;当未知节点周围有三个邻居锚节点时,采用IMP算法;当未知节点周围邻居锚节点的数量大于三个时,采用加权质心定位算法。仿真结果表明,在稀疏锚节点的环境下,在保证定位覆盖率的同时IDV-Hop+IMP算法比现有的如质心、DV-Hop有更高的定位精度。

关键词: 无线传感器网络, 节点定位, 定位精度, DV-Hop, 质心算法