论文部分内容阅读
本文提出了一种分布式的非测距算法(DRFL),该算法不需要测量节点间的距离,只需锚节点广播它们的信标信息,盲节点接收并存储监听到的信标信息,并根据这些信息估计自身节点位置.与现有的非测距算法相比,DRFL算法的通信开销比较小,且其定位的性能与网络连接度(network connectivity)无关.在ANR=8,DOI=0,16个锚节点统一布置在仿真区域的情况下,DRFL算法的定位误差小于盲节点通信半径的8%,且消除了APIT算法中的“Undetermined Nodes”问题.
This paper presents a distributed non-ranging algorithm (DRFL), which does not need to measure the distance between nodes, only the anchor nodes broadcast their beacon information, the blind node receives and stores the monitored beacon information, and Based on these information, the node location is estimated.Compared with the existing non-ranging algorithms, the DRFL algorithm has a lower communication overhead and the performance of the DRFL algorithm is independent of the network connectivity.When ANR = 8, DOI = 0 , 16 anchor nodes are uniformly arranged in the simulation area, the positioning error of the DRFL algorithm is less than 8% of the blind node communication radius, and the problem of “Undetermined Nodes” in the APIT algorithm is eliminated.