摘要
针对DV-Distance定位算法受网络拓扑结构和环境噪声影响大等问题,从2个方面对算法进行了改进。改进的DV-Distance算法在原算法基础上,通过设定共线度阈值来优化多跳网络中定位锚节点分组的选择,使其能更好的适应低密度、不规则网络,并利用最小二乘算法与泰勒级数展开法相结合方法来估计最终位置,从而提高算法的鲁棒性。仿真结果表明,改进算法与原算法相比,具有更高的定位精度,并且在锚节点数量比较小和节点密度低情况下,仍具有较好的定位性能。
Based on analysis of the problem in DV-Distance localization,two improved schemes for the algorithm are proposed.The principle for the improved schemes is to introduce the degree of collinearity into the selection phase of anchor nodes,and thus to propose a method for estimating the final position by Least Squares and Taylor.Improved algorithm is characterized by consideration of the topological relations between anchor nodes and improvement of the robustness.Simulation result indicates that the improved algorithm is higher in localization accuracy and robustness than traditional algorithm,particularly when the number of anchor nodes is relatively small and the network is fairly low in nodes density.
出处
《通信技术》
2012年第3期52-54,共3页
Communications Technology
