网络节点快速定位算法的优化与仿真

Optimization and Simulation of Fast Location Algorithm of Network Nodes

在对网络节点进行定位时,节点分布分散,产生的节点定位存在随机性,采用传统的方法时由于节点与质心之间存在关联性低,需要逐个遍历网络节点进行定位,导致定位时间长,精确度低,实用性弱。提出了一种改进RSSI算法的网络节点快速定位方法。通过采样的方式对网络待定位节点的初始位置进行估计,利用RSSI算法将网络固定节点间的距离和RSSI值作为依据计算网络中所有待定位节点与固定节点之间的权值,定义网络固定信标节点与质心位置的关系,在此基础上对网络固定节点的权值进行修正,进而精确地完成了对网络节点快速定位算法的优化。仿真结果证明,改进RSSI算法的网络节点快速定位方法定位精确度高,适用性强。

In network node localizating, node distribution is scattered, and the created localization of nodes is randomness. In the paper, a fast location method for network node based on improved RSSI algorithm was proposed. The initial position of the network node to be located was estimated by sampling. The distance between fixed nodes in network and the RSSI value were taken as the basis by using RSSI algorithm, to calculate the weights between all the nodes to be located and fixed nodes in the network. The relationship between the fixed beacon nodes in network and the position of the center of mass was defined. On this basis, the weights of the fixed network nodes were modified, and the optimization of the fast location algorithm for network node was accomplished accurately. The simulation results show that the fast location method for network node based on improved RSSI algorithm has high accuracy and strong applicability.