共查询到20条相似文献,搜索用时 93 毫秒
1.
无线传感器网络由于其自组织性、鲁棒性及节点数量巨大的特点,非常适合于目标跟踪。无线传感器网络目标跟踪大体分为单目标跟踪与面目标跟踪。单目标跟踪主要采用双元检测协作跟踪、信息驱动协作跟踪、传送树跟踪算法等方法。面目标跟踪采用对偶空间转换算法等方法。在无线传感器网络目标跟踪中,跟踪精度、跟踪能量消耗和跟踪可靠性是需要考虑的主要问题。 相似文献
2.
水下无线传感网络(UWSN)执行目标跟踪时,因为各个传感器节点测量值对目标状态估计的贡献不一样以及节点能量有限,所以探索一种好的节点融合权重方法和节点规划机制能够获得更好的跟踪性能。针对上述问题,该文提出一种基于Grubbs准则和互信息熵加权融合的分布式粒子滤波(PF)目标跟踪算法(GMIEW)。首先利用Grubbs准则对传感器节点所获得的信息进行分析检验,去除干扰信息和错误信息。其次,在粒子滤波的重要性权值计算的过程中,引入动态加权因子,采用传感器节点的测量值与目标状态之间的互信息熵,来反映传感器节点提供的目标信息量,从而获得各个节点相应的加权因子。最后,采用3维场景下的簇-树型网络拓扑结构,跟踪监测区域内的目标。实验结果显示,该算法可有效提高水下传感器网络测量数据对目标跟踪预测的准确度,降低跟踪误差。 相似文献
3.
4.
将对等式结构应用于多传感器目标数据关联,提出了对等结构下系统误差修正航迹关联算法.针对雷达受外界影响造成系统误差的问题,实现时间精同步后,利用对等结构可通信协作的优势在高低精度节点间建立误差修正模型,补偿低精度节点参数误差,并利用灰关联法完成航迹关联.仿真表明:该算法能够对低精度节点的极径、方位角、俯仰角数据进行有效的... 相似文献
5.
脉冲多普勒雷达(PDR)是一个超宽带雷达系统,不仅能探测目标位置,也可通过多普勒效应测量其径向速度。然而,传统的雷达信号处理技术与极限计算和典型无线传感器微粒上的存储资源不相匹配。利用小型脉冲多普勒雷达作为传感器节点,通过设计一个新的目标跟踪系统来探索脉冲多普勒雷达和微型无线传感器节点的兼容性。该系统由几个PDR传感器节点组成,来检测移动目标的存在和位置,一个基站节点用来收集传感器节点的检测数据,一个算法来估计目标的位置。结果表明该系统有较小的偏差,可实现目标跟踪。 相似文献
6.
7.
完全分布式的机动目标跟踪是传感器网络等应用中亟待解决的关键问题。本文针对变拓扑非完全连通网络,提出一种基于网络共识的多模型信息滤波器( Consensus based Multiple Model Information Filter, C-MMIF)。 C-MMIF基于标准IMM框架,保证了估计最优性;并通过构造目标运动模式概率和状态估计的信息滤波形式,使节点间运算相互独立。同时,每个独立节点仅需与其相邻节点通讯,利用平均网络共识分布式优化算法对自身信息状态进行更新,实现节点间对目标运动模式及状态的一致估计。最后在无人机与地面传感器网络协同对地机动目标跟踪场景下进行算法仿真验证,结果证明该方法可以在无融合处理中心且网络拓扑变化情况下,使各节点实现对机动目标的一致有效跟踪。 相似文献
8.
9.
单个传感器受到战场视角、目标机动、环境影响等因素限制,难以连续有效获取目标高精度位置信息。多个节点平台利用宽带通信网络,建立多传感器协同的战场环境感知能力,可解决单一传感器定位时间长、定位精度较低、连续跟踪性能较差等问题。介绍了多节点协同探测概念及模式,综述了多节点雷达协同、无源探测协同、光电/红外协同以及异构传感器协同等不同类型协同模式的处理算法研究现状,分析了不同方式下的协同处理流程及效能,最后给出多节点传感器协同探测技术发展趋势及展望。 相似文献
10.
11.
12.
13.
被动传感器阵列中基于粒子滤波的目标跟踪 总被引:1,自引:1,他引:0
针对被动传感器阵列中的机动目标跟踪问题,该文提出了一种基于多模Rao-Blackwellized粒子滤波的机动目标跟踪新方法。算法首先基于Rao-Blackwellization理论将机动目标跟踪问题划分为模型选择和目标跟踪两个子问题;采用多模Rao-Blackwellized粒子滤波对目标运动模型进行选择,扩展Kalman滤波对目标进行更新,有效降低了抽样粒子状态维数,节省了计算时间;最后,建立了被动传感器阵列的非线性观测模型。实验结果表明,提出方法可以有效地对目标模型进行选择,算法的跟踪性能及稳定性要好于交互多模型(IMM)方法。 相似文献
14.
利用无线传感器网络进行目标跟踪时,由于各传感器节点的能量有限,数据蕴含的有效信息又各不相同,因此有必要规划参与目标跟踪的节点集和参与方式,以降低系统开销。本文提出了一种新的基于领导节点的节点规划算法,综合考虑收集数据和领导节点迁移过程中的通信开销,以最大化目标跟踪的性能。求解中以跟踪过程中的误差矩阵作为目标度量,采用高斯-赛德尔(Gauss-Seidel)和凸松弛等方法,使得复杂的带约束优化问题能够在接近O(N3)的时间复杂度内得到求解。仿真结果表明,与对比算法相比,本算法在相同的通信能量约束下能够达到更好的跟踪性能。 相似文献
15.
Distributed Active Sensor Scheduling for Target Tracking in Ultrasonic Sensor Networks 总被引:1,自引:0,他引:1
Fan Zhang Jiming Chen Hongbin Li Youxian Sun Xuemin Shen 《Mobile Networks and Applications》2012,17(5):582-593
Active ultrasonic sensors for target tracking application may suffer from inter-sensor-interference if these highly dense deployed sensors are not scheduled, which can degrade the tracking performance. In this paper, we propose a dynamic distributed sensor scheduling (DSS) scheme, where the tasking sensor is elected spontaneously from the sensors with pending sensing tasks via random competition based on Carrier Sense Multiple Access (CSMA). The channel will be released immediately when sensing task is completed. Both simulation results and testbed experiment demonstrate the effectiveness of DSS scheme for large scale sensor networks in terms of system scalability and high tracking performance. 相似文献
16.
17.
In this article, a survey of techniques for tracking multiple targets in distributed sensor networks is provided and introduce some recent developments. The single target tracking in distributed sensor networks is reviewed. The tracking and resource management issues can be readily extended to MTT. The MTT problem is also briefly reviewed and describe the traditional approaches in centralized systems. Then focus on MTT in resource-constrained sensor networks and present two distinct example methods demonstrating how limited resources can be utilized in MTT applications. Finally, the most important remaining problems are discussed and suggest future directions 相似文献
18.
为了解决无线传感器网络跟踪非线性运动目标的分布式数据融合问题,使用了基于扩展信息滤波器(EIF)的分布式估计算法.对于活跃传感器的选择方法,采用了基于与目标位置接近程度的近邻选择算法和基于信息贡献的信息选择算法.仿真结果表明,与分布式扩展信息滤波器(DEIF)算法相比,近邻选择算法和信息选择算法得到了相似的响应曲线,且具有减少能量消耗和简化计算的优点. 相似文献
19.
In this paper, we address the problem of genetic algorithm optimization for jointly selecting the best group of candidate sensors and optimizing the quantization for target tracking in wireless sensor networks. We focus on a more challenging problem of how to effectively utilize quantized sensor measurement for target tracking in sensor networks by considering best group of candidate sensors selection problem. The main objective of this paper is twofold. Firstly, the quantization level and the group of candidate sensors selection are to be optimized in order to provide the required data of the target and to balance the energy dissipation in the wireless sensor network. Secondly, the target position is to be estimated using quantized variational filtering (QVF) algorithm. The optimization of quantization and sensor selection are based on the Fast and Elitist Multi-objective Genetic Algorithm (NSGA-II). The proposed multi-objective (MO) function defines the main parameters that may influence the relevance of the participation in cooperation for target tracking and the transmitting power between one sensor and the cluster head (CH). The proposed algorithm is designed to: i) avoid the problem lot of computing times and operation counts, and ii) reduce the communication cost and the estimation error, which leads to a significant reduction of energy consumption and an accurate target tracking. The computation of these criteria is based on the predictive information provided by the QVF algorithm. The simulation results show that the NSGA-II -based QVF algorithm outperforms the standard quantized variational filtering algorithm and the centralized quantized particle filter. 相似文献
20.
Ali Shokouhi Rostami Farahnaz Mohanna Hengameh Keshavarz 《Wireless Personal Communications》2017,95(4):3585-3599
Energy consumption is one of the main challenges in wireless sensor networks. Additionally, in target tracking algorithms, it is expected to have a longer lifetime for the network, when a better prediction algorithm is employed, since it activates fewer sensors in the network. Most target tracking methods activate a large number of nodes in sensor networks. This paper proposes a new tracking algorithm reducing the number of active nodes in both positioning and tracking by predicting the target deployment area in the next time interval according to some factors including the previous location of the target, the current speed and acceleration of the target without reducing the tracking performance. The proposed algorithm activates the sensor nodes available in the target area by predicting the target position in the next time interval. The problem of target loss is also considered and solved in the proposed tracking algorithm. In the numerical analysis, the number of nodes involved in target tracking, energy consumption and the network lifetime are compared with other tracking algorithms to show superiority of the proposed algorithm. 相似文献