深入研究了UWB(ultra wideband)无线传感器网络中基于匹配滤波门限检测的TOA(time of arrival)估计算法.针对现有算法的不足,提出了一种三步TOA估计算法:先确定DP(direct path)搜索区域,然后使用门限检测确定DP的粗略位置,最后精确搜索...深入研究了UWB(ultra wideband)无线传感器网络中基于匹配滤波门限检测的TOA(time of arrival)估计算法.针对现有算法的不足,提出了一种三步TOA估计算法:先确定DP(direct path)搜索区域,然后使用门限检测确定DP的粗略位置,最后精确搜索到DP的中心.其中,用于计算检测门限的门限因子依据匹配滤波输出的峭度动态设置,设置模型独立于信道模式,其正确性通过与使用固定门限因子所获得的性能对比进行了验证.与其他算法的性能对比仿真结果表明,所提出的三步TOA估计算法在运算效率和TOA估计精度上取得了较好折衷,适合于当前实际应用.还通过对TOA估计误差的统计分析讨论了测距结果的可信度:依据峭度将测距结果划分为可信和不可信两个级别,并为各级别的TOA估计误差分别了建立概率密度模型.在定位模块中有效利用这些可信度信息,可进一步提高定位精度.展开更多
文章提出了一个UWB(Ultra-wide Band)无线传感器网络的无线节点定位系统模型,仿真分析表明,对于四个参考节点都是LOS(Line Of Sight)路径到达传感器节点的情况,其定位的精确度相当高;但是,如果四个参考节点中有一个节点是NLOS(Non Line ...文章提出了一个UWB(Ultra-wide Band)无线传感器网络的无线节点定位系统模型,仿真分析表明,对于四个参考节点都是LOS(Line Of Sight)路径到达传感器节点的情况,其定位的精确度相当高;但是,如果四个参考节点中有一个节点是NLOS(Non Line Of Sight)路径到达传感器节点的话,当信噪比低于30dB,则定位误差不小于5m,这时候要保证较高的定位准确度,就应该保证较高的信噪比或者增加参考节点数目。展开更多
This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor ne...This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.展开更多
文摘深入研究了UWB(ultra wideband)无线传感器网络中基于匹配滤波门限检测的TOA(time of arrival)估计算法.针对现有算法的不足,提出了一种三步TOA估计算法:先确定DP(direct path)搜索区域,然后使用门限检测确定DP的粗略位置,最后精确搜索到DP的中心.其中,用于计算检测门限的门限因子依据匹配滤波输出的峭度动态设置,设置模型独立于信道模式,其正确性通过与使用固定门限因子所获得的性能对比进行了验证.与其他算法的性能对比仿真结果表明,所提出的三步TOA估计算法在运算效率和TOA估计精度上取得了较好折衷,适合于当前实际应用.还通过对TOA估计误差的统计分析讨论了测距结果的可信度:依据峭度将测距结果划分为可信和不可信两个级别,并为各级别的TOA估计误差分别了建立概率密度模型.在定位模块中有效利用这些可信度信息,可进一步提高定位精度.
文摘文章提出了一个UWB(Ultra-wide Band)无线传感器网络的无线节点定位系统模型,仿真分析表明,对于四个参考节点都是LOS(Line Of Sight)路径到达传感器节点的情况,其定位的精确度相当高;但是,如果四个参考节点中有一个节点是NLOS(Non Line Of Sight)路径到达传感器节点的话,当信噪比低于30dB,则定位误差不小于5m,这时候要保证较高的定位准确度,就应该保证较高的信噪比或者增加参考节点数目。
基金supported by the National Natural Science Foundation of China(NSFC)under Grant No.61373126the Natural Science Foundation of Jiangsu Province of China under Grant No.BK20131107the Fundamental Research Funds for the Central Universities under Grant No.JUSRP51510
文摘This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.