基于DV-Hop的RSSI-Hop算法

RSSI-Hop Algorithm Based on DV-Hop

在无线传感器网络中,监测到时间之后关心的一个重要问题就是该事件发生的位置。传感器节点能量有限、可靠性差、节点规模大且随机布放、无线模块通信距离有限,对定位算法和定位技术提出了很高的要求。针对随机布放、节点配置低的无线传感器网络,提出一种新的RSSI-Hop定位方法,该方法可以在不增加硬件开销的基础上,有效降低节点能量消耗,较准确地估算未知节点到参考节点之间的距离,减少累积误差,提高定位的准确性。其主要思想是,节点信息根据RSSI强弱,估算各节点到信标节点之间的距离。实验表明,新算法比以前的算法定位更准确。

In the wireless sensor network, it is important to know where the event took place after the occurrence time has been detected. Sensor nodes have limited energy and low reliability, and the node scale is large and wireless communication distance limited, which pose very high demand on localization and positioning technology. Node localization algorithm must have good fault tolerance. Aimed at randomly out wireless sensor network with low node configuration,this paper proposes the RSSI-Hop localization method. This method can estimate the distance between unknown nodes and reference nodes accurately, reduce accumulative error, and improve the accuracy of the positioning on the basis of reducing the node energy consumption effectively, without any increase in hardware. According to the strength of RSSI node information,the distances between the beacon nodes and nodes are estimated. Experiments show that the new algorithm is superior to the algorithm previously used.