Energy-efficient collaborative target tracking algorithm using cost-reference particle filtering in wireless acoustic sensor networks

Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to save the limited resource of sensor nodes. A new robust and energy-efficient collaborative target tracking framework is proposed in this article. After a target is detected, only one active cluster is responsible for the tracking task at each time step. The tracking algorithm is distributed by passing the sensing and computation operations from one cluster to another. An event-driven cluster reforming scheme is also proposed for balancing energy consumption among nodes. Observations from three cluster members are chosen and a new class of particle filter termed cost-reference particle filter (CRPF) is introduced to estimate the target motion at the cluster head. This CRPF method is quite robust for wireless sensor network tracking applications because it drops the strong assumptions of knowing the probability distributions of the system process and observation noises. In simulation experiments, the performance of the proposed collaborative target tracking algorithm is evaluated by the metrics of tracking precision and network energy consumption.     

Distributed Energy Optimization for Target Tracking in Wireless Sensor Networks

Energy constraint is an important issue in wireless sensor networks. This paper proposes a distributed energy optimization method for target tracking applications. Sensor nodes are clustered by maximum entropy clustering. Then, the sensing field is divided for parallel sensor deployment optimization. For each cluster, the coverage and energy metrics are calculated by grid exclusion algorithm and Dijkstra's algorithm, respectively. Cluster heads perform parallel particle swarm optimization to maximize the coverage metric and minimize the energy metric. Particle filter is improved by combining the radial basis function network, which constructs the process model. Thus, the target position is predicted by the improved particle filter. Dynamic awakening and optimal sensing scheme are then discussed in dynamic energy management mechanism. A group of sensor nodes which are located in the vicinity of the target will be awakened up and have the opportunity to report their data. The selection of sensor node is optimized considering sensing accuracy and energy consumption. Experimental results verify that energy efficiency of wireless sensor network is enhanced by parallel particle swarm optimization, dynamic awakening approach, and sensor node selection.     

基于格拉布斯准则和改进粒子滤波算法的水下传感网目标跟踪

水下无线传感网络(UWSN)执行目标跟踪时,因为各个传感器节点测量值对目标状态估计的贡献不一样以及节点能量有限,所以探索一种好的节点融合权重方法和节点规划机制能够获得更好的跟踪性能。针对上述问题,该文提出一种基于Grubbs准则和互信息熵加权融合的分布式粒子滤波(PF)目标跟踪算法(GMIEW)。首先利用Grubbs准则对传感器节点所获得的信息进行分析检验,去除干扰信息和错误信息。其次,在粒子滤波的重要性权值计算的过程中,引入动态加权因子,采用传感器节点的测量值与目标状态之间的互信息熵,来反映传感器节点提供的目标信息量,从而获得各个节点相应的加权因子。最后,采用3维场景下的簇-树型网络拓扑结构,跟踪监测区域内的目标。实验结果显示,该算法可有效提高水下传感器网络测量数据对目标跟踪预测的准确度,降低跟踪误差。     

基于粒子群优化和M-H采样粒子滤波的传感器网络目标跟踪方法

针对实际应用条件下传感器节点的观测数据与目标动态参数间呈现为非线性关系的特性,提出了一种基于粒子群优化和M-H抽样粒子滤波的传感器网络目标跟踪方法。该方法采用分布式结构,在动态网络拓扑结构下,由粒子群优化和M-H抽样技术实现滤波中的重抽样过程,抑制粒子退化现象,并通过粒子间共享历史信息,降低单个粒子历史状态间的相关性使各粒子能快速收敛至最优分布,从而实现高精度的目标跟踪效果。仿真结果表明,相比现有的基于信息粒子滤波和并行粒子滤波技术的传感器网络目标跟踪方法,所提出的方法能降低网络总能耗,同时保证目标跟踪的精度。     

被动传感器阵列中基于粒子滤波的目标跟踪

针对被动传感器阵列中的机动目标跟踪问题,该文提出了一种基于多模Rao-Blackwellized粒子滤波的机动目标跟踪新方法。算法首先基于Rao-Blackwellization理论将机动目标跟踪问题划分为模型选择和目标跟踪两个子问题;采用多模Rao-Blackwellized粒子滤波对目标运动模型进行选择,扩展Kalman滤波对目标进行更新,有效降低了抽样粒子状态维数,节省了计算时间;最后,建立了被动传感器阵列的非线性观测模型。实验结果表明,提出方法可以有效地对目标模型进行选择,算法的跟踪性能及稳定性要好于交互多模型(IMM)方法。     

基于性能边界和量化数据的WSN目标跟踪传感器选择算法

对能量和带宽受限的无线传感器网络下的目标跟踪问题,基于量化的观测数据和条件后验克拉美-罗下界提出一种传感器选择方法.为了节约网络能量和带宽,对传感器接收到的观测数据进行量化压缩,推导了传感器量化数据下目标状态估计的条件后验克拉美-罗下界,将其作为传感器选择和优化的准则,并且利用粒子滤波器给出一种条件后验克拉美-罗下界的近似计算方法.与基于无条件后验克拉美-罗下界和互信息的传感器选择方法进行了对比仿真,结果表明了条件后验克拉美-罗下界作为传感器选择准则的有效性以及对跟踪性能的改进.     

基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法

针对无线传感器网络中节点通信能力及能量有限的情况,该文提出基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法。该方法以动态分簇的方式将监测区域内随机部署的传感器节点划分为若干个簇,并对簇内成员节点与簇首节点之间、簇首节点与基站之间的通信路由进行优化,确保网络能耗的均衡分布,在此基础上,被激活的簇内成员节点并行地执行分布式粒子滤波算法实现目标跟踪。仿真结果表明,该方法能有效地降低传感器网络中节点的总能耗,能在实现跟踪的同时保证目标跟踪的精度。     

伯努利滤波器在纯角度跟踪场景中的应用

所获得信息只包含角度信息的传感器被称为纯角度传感器，基于纯角度传感器的目标跟踪被称之为纯角度跟踪（Bearings-only Tracking，BOT）。BOT是目标跟踪领域的重要课题，在被动目标跟踪场景中能够发挥重要作用。伯努利滤波器（Bernoulli Filter，BF）是贝叶斯框架内的最优单目标滤波器，可以求得目标的存在概率和完整的后验概率密度函数，并判断目标出现和消失。作者将伯努利滤波器应用于纯角度跟踪场景下的单目标跟踪问题，提出了一种纯角度跟踪伯努利滤波器。在所提出的滤波器中，将目标相对于传感器的角度及其变化率作为状态矢量，用于估计目标是否存在；若目标存在，估计其状态信息。同时，还给出了所提出滤波器的粒子滤波（Particle Filter，PF）实现方法。仿真结果显示，与普通伯努利滤波器相比，所提出的纯角度跟踪伯努利滤波器能够更好地判断目标是否存在，同时滤波器对于目标估计的误差也更小。因此，所提出的滤波器具有更好的跟踪性能和更高的跟踪精度，能够有效应用于被动跟踪场景中。     

Distributed Energy Efficient Tracking in Hybrid wireless sensor network (DEETH)

In wireless sensor network (WSN), it is a complex task to track the target when it is moving randomly in an unknown environment. It also becomes difficult to cover a complete searching area because of the limited searching range and energy of sensor nodes as they are few in number. The author proposes a distributed energy efficient tracking in a hybrid WSN (DEETH) to track a randomly moving target in an unknown searching. Hybrid WSN that is proposed has both static sensor nodes (SSNs) and mobile sensor nodes (MSNs), which are deployed in the searching area. The MSNs move collectively using particle swarm techniques to search a target. The SSNs are deployed for tracking the presence of a target and giving this information to the base station. As per the information given by SSN, MSNs travel to the target and track it. Simulation results prove that proposed technique successfully tracks the target using less number of nodes and also less amount of energy.     

基于多传感器的弱小目标检测与跟踪方法

弱小目标检测与跟踪是一个具有挑战性的研究课题,传统的数据处理方法主要是基于单传感器的备类检测前跟踪算法,其中由粒子滤波实现的算法因其稳健性高、适用范围广,受到了越来越多的关注。本文正是试图将该类算法推广应用于多传感器的目标检测与跟踪,以提高系统对弱小目标的检测概率与跟踪精度。仿真试验验证了所提方法的有效性。     

Genetic Algorithm-based Adaptive Optimization for Target Tracking in Wireless Sensor Networks

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.     

Energy‐Efficient Adaptive Dynamic Sensor Scheduling for Target Monitoring in Wireless Sensor Networks

Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy‐efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless sensor networks. Owing to excessive scheduling of an individual node, one node with a high value generated by a decision function is preferentially selected as a tasking node to balance the local energy consumption of a dynamic clustering, and the node with the highest value is chosen as the cluster head. Others with lower ones are in reserve. In addition, an optimization problem is derived to satisfy the problem of sensor scheduling subject to the joint detection probability for tasking sensors. Particles of the target in particle filter algorithm are resampled for a higher tracking accuracy. Simulation results show this algorithm can improve the required tracking accuracy, and nodes are efficiently scheduled. Hence, there is a 41.67% savings in energy consumption.     

基于量子遗传粒子滤波的WSN目标跟踪算法

粒子滤波器是解决非线性非高斯运动跟踪的一种有效方法,很适合于无线传感器网络的目标跟踪.但是粒子滤波算法存在严重的退化现象.常规的重采样方法虽可解决退化问题,但容易导致粒子耗尽.本文针对此问题,将量子遗传算法引入粒子滤波,提出了基于量子遗传粒子滤波的无线传感器网络目标跟踪算法.通过量子遗传算法的编码方式增加粒子集的多样性...     

Dynamic sensor collaboration via sequential Monte Carlo

We consider the application of sequential Monte Carlo (SMC) methods for Bayesian inference to the problem of information-driven dynamic sensor collaboration in clutter environments for sensor networks. The dynamics of the system under consideration are described by nonlinear sensing models within randomly deployed sensor nodes. The exact solution to this problem is prohibitively complex due to the nonlinear nature of the system. The SMC methods are, therefore, employed to track the probabilistic dynamics of the system and to make the corresponding Bayesian estimates and predictions. To meet the specific requirements inherent in sensor network, such as low-power consumption and collaborative information processing, we propose a novel SMC solution that makes use of the auxiliary particle filter technique for data fusion at densely deployed sensor nodes, and the collapsed kernel representation of the a posteriori distribution for information exchange between sensor nodes. Furthermore, an efficient numerical method is proposed for approximating the entropy-based information utility in sensor selection. It is seen that under the SMC framework, the optimal sensor selection and collaboration can be implemented naturally, and significant improvement is achieved over existing methods in terms of localizing and tracking accuracies.     

基于均值漂移和粒子滤波的红外目标跟踪

为了提高红外目标跟踪的准确性和稳健性,提出了基于均值漂移(mean shift)和粒子滤波(PF)相结合的红外目标跟踪方法.在PF理论框架下,使用均值漂移为一种迭代模式寻找过程,对随机粒子样本进行重新分配,使粒子向目标状态的最大后验核密度估计方向移动,在均值漂移迭代过程中对样本权值进行更新.红外目标的状态后验概率分布用重新分配的加权随机样本集表示,对随机样本集使用PF算法实现红外目标运动的跟踪.实验结果表明,和一般PF和均值漂移相比,本文方法具有优越性和更强的稳健性.     

视野有限的传感器网络中分布式多目标跟踪

在传感器网络的多目标跟踪研究中,大多数现有的跟踪算法通常设定网络中所有节点具有相同的视野,即所有节点都能够得到目标的测量,但在实际中,节点的感测范围通常是有限的。针对这一问题,本文提出了一种能够在感测范围有限的多传感器网络中实现多目标跟踪的分布式概率假设密度滤波算法,该算法通过融合传感器网络视野范围内的后验概率假设密度粒子集来克服传感器节点感测范围的局限。仿真结果表明,提出的算法可以在感测范围有限的情况下实现多目标状态和数目的有效跟踪,同时可以在一定程度上抑制杂波,具有较好的跟踪稳定性。      

能量有效的分布式粒子滤波

该文根据无线传感器网络节点能量有限的特点,从节能的角度提出了能量有效的分布式粒子滤波算法.该文首先给出了算法的一个总体框架,然后从大数定理出发,研究粒子数对算法性能的影响.接着,基于节点的位置信息和测量方程,提出了一种节点选择算法.通过节点选择,可以把粒子滤波算法的计算复杂度分布到各个节点,进行分布式处理.最后,通过仿真验证算法的有效性.     

基于激光信息和射频识别的运动轨迹跟踪研究

为提高运动轨迹跟踪精度,设计了基于激光信息和射频识别的运动轨迹跟踪方法,首先将射频识别阅读器与激光传感器采集数据进行速度估算处理,并利用加权因子对激光传感器估算速度进行平滑处理,然后通过相似度对比方法匹配激光传感器与射频识别阅读器获取的运动目标速度,采用粒子滤波算法融合激光传感器与射频传感器获取的运动目标速度,通过粒子滤波的预测、更新与重采样三个阶段实现准确的运动目标轨迹跟踪,最后实验结果表明,该方法对目标的运动轨迹跟踪精确度高达99%。     

一种改进的粒子滤波和Mean Shift联合跟踪算法

为了提高视频运动目标跟踪的准确性和实时性,提出一种改进的粒子滤波和Mean Shift联合跟踪算法.针对传统粒子滤波跟踪算法中颜色直方图观测模型存在的局限性,提出了一种基于分块颜色直方图的观测模型描述方法,并根据该分块直方图的特点,重新设计了粒子权值的更新策略;针对粒子滤波算法实时性差的问题,提出了一种基于积分直方图的颜色特征快速计算方法,极大地降低了算法的运算量;为了降低相似背景干扰对跟踪效果的影响,提出了一种基于Gabor幅度谱的Mean Shift跟踪算法,并利用改进的Mean Shift算法对粒子滤波跟踪结果进行优化,提高了跟踪算法在复杂背景下的搜索能力.实验结果表明了算法的有效性.     

An adaptive target tracking method for 3D underwater wireless sensor networks

Today, underwater target tracking using underwater wireless sensor networks (UWSNs) is an essential part in many military and non-military applications. Most of moving target tracking studies in UWSNs are considered in two-dimensional space. However, most practical applications require to be implemented in three-dimensional space. In this paper an adaptive method based on Kalman filter for moving target tracking in three dimensional space using UWSNs is proposed. Since, energy protection is a vital task in UWSNs; the proposed method reduces the energy consumption of the entire network by a sleep/wake plan. In this plan only 60% of the closer nodes along the path of the moving target will be waked up using a sink activation message and participate in the tracking, while the other nodes remain in sleep state. At each stage of tracking, the location of the target is estimated using a 3D underwater target tracking algorithm with the trilateration method. Subsequently, the estimations and target tracking results are inserted into the Kalman filter as measuring model to produce the final result. Performance evaluation and simulations results indicated that the proposed method improves the average location error by 45%, average estimated velocity by 86%, and average energy consumption by 33% in comparison to the trilateration method. However, computation time is increased as a result of improving tracking accuracy; and tracking accuracy is lost about 20% due to saving energy. It was shown that the proposed method has been able to adaptively achieve a trade-off between tracking accuracy and energy consumption based on real-time user requirements. Such adaption can be controlled trough the sink node based on real-time requirements.