DV-Hop定位算法是无线传感器网络实现无测距节点定位的一种典型方法,针对其定位精度和覆盖率的不足,提出了一种按节点优先级进行定位并升级为新锚节点的改进算法;该算法是从第二轮次开始增加一次新锚节点广播,由各未知节点根据自身所收到的新旧锚节点广播的多少来确定其优先级,选择该轮次中优先级最高的节点按DV—Hop算法实现定位并升级为新锚节点;仿真结果表明了该算法的有效性。
DV-Hop is a typical way for the range-free localization in wireless sensor network. As a result of the shortage of localiza tion accuracy and coverage, an improved algorithm is proposed that locates the nodes and updates them to new anchors in terms of the PRI. This algorithm adds a broadcast of the new anchor from second round, then confirms the PRI of unknown nodes according to the number of their received broadcasts from anchors, and chooses the node with the highest PRI and locates it by DV-Hop, and then updates it to a new anchor. The result of the simulation shows its availability.