Abstract: Now the precision of free nodes’ position depends on distributing density strictly. This paper puts forward a new algorithm with one more power center node. All free points may compute the distance to the centre from the RSSI of the center node. At the same time, they compute the distance to their neighbors. The information of distance and neighbors is transmitted to the control center. In the control center, the positions of all free nodes are figured out. According as the result of simulation, the position error of the new algorithm is 1/8 as that of DV-distance. The precision of localization is improved greatly.

Key words: wireless sensor networks, center node, self-localization, shortest route

摘要： 针对目前传感器网络的定位算法节点定位精度严重依赖节点分布密度的问题，提出一种有一个较大功率的中心节点的定位算法。该算法计算出所有待定位节点距离中心节点及其所有邻节点的距离，将距离信息和邻节点表传到控制中心进行集中计算，确定节点位置。依据仿真结果，在节点数较少时该算法的定位误差仅为DV-distance 算法的1/8，提高了定位精度。

关键词: 无线传感器网络, 中心节点, 自定位, 最短路径

CLC Number: 

• TP393