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

发布时间：2018-05-07 03:20

本文选题：网络 + 节点定位　；参考：《计算机仿真》2015年11期

【摘要】：在对网络节点进行定位时,节点分布分散,产生的节点定位存在随机性,采用传统的方法时由于节点与质心之间存在关联性低,需要逐个遍历网络节点进行定位,导致定位时间长,精确度低,实用性弱。提出了一种改进RSSI算法的网络节点快速定位方法。通过采样的方式对网络待定位节点的初始位置进行估计,利用RSSI算法将网络固定节点间的距离和RSSI值作为依据计算网络中所有待定位节点与固定节点之间的权值,定义网络固定信标节点与质心位置的关系,在此基础上对网络固定节点的权值进行修正,进而精确地完成了对网络节点快速定位算法的优化。仿真结果证明,改进RSSI算法的网络节点快速定位方法定位精确度高,适用性强。
[Abstract]:In the localization of network nodes, the nodes are scattered and the resulting nodes are random. Because of the low correlation between the nodes and the centroid, it is necessary to traverse the network nodes one by one. It leads to long positioning time, low accuracy and weak practicability. A fast location method for network nodes based on improved RSSI algorithm is proposed. The initial position of the nodes to be located in the network is estimated by sampling, and the distance between the fixed nodes and the RSSI value of the network are calculated by using RSSI algorithm as the weights between all the nodes to be located and the fixed nodes in the network. On the basis of defining the relationship between the fixed beacon nodes and the position of the center of mass, the weights of the fixed nodes in the network are modified, and the optimization of the fast location algorithm for the network nodes is accomplished accurately. The simulation results show that the fast localization method based on improved RSSI algorithm has high accuracy and good applicability.
【作者单位】：重庆师范大学涉外商贸学院;
【分类号】：TN929.5;TP212.9

【参考文献】