水下传感器网络目标跟踪时的非短视比特优化分配算法

由于水下传感器网络(Underwater Sensor Network,USN)的能量、带宽有限,传输原始量测数据前需要进行量化处理。面向目标跟踪,在传输比特数据量的约束下,提出了非短视量化比特分配算法。首先,推导了量化量测下的条件后验克拉美罗下界,并将其设为优化目标,建立了比特分配优化模型。在此基础上,提出了一种双层近似动态规划的算法来实现比特分配的优化,在所设时间窗内利用第一层近似动态规划分配各个时刻的比特,并利用第二层近似动态规划在各分支上实现水下传感器节点的比特分配,进一步提升了计算效率。仿真结果表明,所提算法在满足实时性的要求下具有更稳定的跟踪性能。     

无线传感器网络中基于多比特量化的极大似然分布式估计方法

在无线传感器网络背景下的分布式估计中,由于传输网络对发送功率和传输带宽的限制,压缩信源冗余、降低通信数据量便成为一个重要的课题.为此,本文提出了一种基于多比特量化观测的分布式估计方法（MQS）,利用渐进性能作为优化准则构造量化阈值优化问题,运用粒子群算法对其进行求解得到最优量化阈值,给出了克拉美罗下界的解析表达式,并与均匀量化方法（UQS）和未量化方法（NQS）进行对比.理论分析和仿真实验表明,MQS的性能优于UQS.当量化深度增大到3时,MQS的估计性能十分接近NQS的估计性能.     

水下无线传感器网络目标跟踪低复杂度节点行径策略

针对水下无线传感器网络节点选择“组合爆炸冶的问题,研究了低计算复杂度节点选择问题。首先,在量化量测的条件下推导了后验克拉美罗下界(PCRLB)与节点位置的关系,为节点选择提供了准则;然后,将GBFOS 算法、贪心算法和随机算法与推导的PCRLB 相结合,设计了低计算复杂度的节点选择策略。实验结果表明,GBFOS 算法和贪心算法可以在保持跟踪性能不退化的情况下,大幅度降低计算复杂度,非常适合解决密集水下网络节点选择问题。此外,还将GBFOS 算法应用到非理想信道条件下节点选择问题,实验结果显示考虑非理想信道的影响可以大幅提高跟踪性能。     

基于马尔科夫决策过程的多传感器协同检测与跟踪调度方法

针对多任务场景下的传感器调度问题,该文提出一种面向目标协同检测与跟踪的多传感器调度方法。首先,该方法基于部分可观马尔科夫决策过程(POMDP)构建传感器调度模型,并基于后验克拉美-罗下界(PCRLB)设计优化目标函数。其次,考虑传感器切换时间和目标数目的时变性,采用随机分布粒子计算新生目标的检测概率,给出了固定目标数目和时变目标数目情形下的传感器调度方法。最后,为满足在线调度的实时性需求,采用自适应多种群协同差分进化(AMCDE)算法求解传感器调度方案。仿真结果表明,该方法能够有效应对多任务场景,实现多传感器资源的合理调度。     

基于数据融合理论的多传感器几何定位算法

为解决多部(3部及以上)2D传感器网络对三维空间目标的定位估计和定位精度问题,克服地球曲率对观测模型的影响,建立了考虑实际地球曲率的等效地球模型和传感器观测模型,提出了此模型中基于二次数据融合的多传感器组网几何定位算法,该方法将几何定位与数据融合理论相结合,并对融合数据进行二次融合,充分利用了各传感器的量测数据。仿真实验证明了方法的有效性和实用性,在多部2D传感器组网的情况下可对三维空间内目标实现精确定位,定位误差趋近于克拉美-罗下界(CRLB),具有工程实用价值。     

基于动态联盟的多传感器协同探测与跟踪

在空战场协同攻击中,常涉及到多传感器协同探测及跟踪,由于目标的出现与消失具有随机性,所以在协同中既要考虑已有目标的跟踪,更要重视新生目标的及时探测和捕获。为此,建立了新生目标的探测概率模型,并阐述了不同传感器联盟对新生目标的探测能力,依据后验克拉美-罗下界(Posterior Cramer-Rao Lower Bound,PCRLB)对已跟踪目标组建传感器联盟,利用二值粒子群优化(Binary Particle Swarm Optimization,BPSO)算法及PCRLB研究基于动态联盟的多传感器协同探测与跟踪方法。仿真表明,该方法跟踪精度较高,误差小且稳定。     

基于二值粒子群优化的多目标协同检测与跟踪方法

针对如何根据目标被探测状态(被检测或者被跟踪)对有限的雷达资源进行分配的问题,本文将其转化为组合优化问题,提出了一种新颖的基于后验克拉美罗下界(PCRLB)-二值粒子群优化(BPSO)的雷达-目标自动分配算法。该算法采用PCRLB作为已跟踪目标的跟踪精度衡量标准,并将其与新生目标的检测概率构成BPSO的适应度函数,在最大化新生目标检测概率的条件下,最小化已跟踪的多个目标的PCRLB,自适应地为目标分配雷达完成恰当的探测(检测与跟踪)行为。仿真结果表明,该算法不仅能够及时检测新生目标,而且能够持续且优化跟踪已有目标,使网络的整体精度得到明显提高。     

相干激光探测中微动参数估计的克拉美-罗界

为选择最佳参数估计方法估计目标微多普勒特征,需要研究参数估计的克拉美-罗界,来评价各估计方法的性能。以相干激光探测为背景,考虑噪声方差未知的影响,严格推导了高斯白噪声环境下微动目标回波信号各参数估计的克拉美-罗界的闭合表达式,仿真分析了目标相对于雷达的位置信息、数据处理长度以及回波信噪比与参数估计方差下界的关系。结果表明,克拉美-罗界与噪声方差无关,目标相对于雷达的方位角、俯仰角越小,数据长度和信噪比越大,参数估计的方差下界越小。对目前常用的两种微动参数估计方法方差进行了计算,并与推导克拉美-罗界进行了对比。最后,与通过近似处理方法得到的克拉美-罗界进行了对比,指出了精确推导方差下界的意义。     

多雷达跟踪定位精度分析

多传感器组网的数据融合,可以提高目标的定位精度.文中提出了一种雷达网空中目标的空间位置融合的加权最小二乘算法,在目标位置估计Fisher信息矩阵基础上给出了目标位置估计误差的克拉美-罗下限.经蒙特卡罗仿真实验表明,该融合算法已逼近了克拉美-罗限,是一种理想的多雷达跟踪定位算法.     

基于CPCRLB的隐身目标协同检测与跟踪

针对雷达组网对隐身目标协同检测与跟踪时的动态分配问题,将条件后验克拉美罗下界(CPCRLB)用作系统跟踪性能的度量,结合改进二值粒子群优化(NBPSO)和粒子滤波,提出了一种基于CPCRLB的隐身目标协同检测与跟踪算法。该算法将雷达的动态分配问题转化成组合优化问题,根据新生目标的隐身特性对雷达分配方案的约束,借助分布在边界的检测粒子计算不同的雷达分配方案对新生目标的检测概率,并以已跟踪目标的CPCRLB 衡量跟踪精度,采用NBPSO全局搜索最优分配方案,最后进行粒子滤波与协方差交集融合。     

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.     

Optimal sensor and path selection for target tracking in wireless sensor networks

This paper addresses target tracking in wireless sensor networks where the nonlinear observed system is assumed to progress according to a probabilistic state space model. Thus, we propose to improve the use of the quantized variational filtering by jointly selecting the optimal candidate sensor that participates in target localization and its best communication path to the cluster head. In the current work, firstly, we select the optimal sensor in order to provide the required data of the target and to balance the energy dissipation in the wireless sensor networks. This selection is also based on the local cluster node density and their transmission power. Secondly, we select the best communication path that achieves the highest signal‐to‐noise ratio at the cluster head; then, we estimate the target position using quantized variational filtering algorithm. The best communication path is designed to reduce the communication cost, which leads to a significant reduction of energy consumption and an accurate target tracking. The optimal sensor selection is based on mutual information maximization under energy constraints, which is computed by using the target position predictive distribution provided by the quantized variational filtering algorithm. The simulation results show that the proposed method outperforms the quantized variational filtering under sensing range constraint, binary variational filtering, and the centralized quantized particle filtering. Copyright © 2012 John Wiley & Sons, Ltd.     

Tracking in Wireless Sensor Networks Using Particle Filtering: Physical Layer Considerations

In this paper, a new framework for target tracking in a wireless sensor network using particle filters is proposed. Under this framework, the imperfect nature of the wireless communication channels between sensors and the fusion center along with some physical layer design parameters of the network are incorporated in the tracking algorithm based on particle filters. We call this approach ldquochannel-aware particle filtering.rdquo Channel-aware particle filtering schemes are derived for different wireless channel models and receiver architectures. Furthermore, we derive the posterior Cramer-Rao lower bounds (PCRLBs) for our proposed channel-aware particle filters. Simulation results are presented to demonstrate that the tracking performance of the channel-aware particle filters can reach their theoretical performance bounds even with relatively small number of sensors and they have superior performance compared to channel-unaware particle filters.     

Bits from photons: oversampled image acquisition using binary Poisson statistics

We study a new image sensor that is reminiscent of a traditional photographic film. Each pixel in the sensor has a binary response, giving only a 1-bit quantized measurement of the local light intensity. To analyze its performance, we formulate the oversampled binary sensing scheme as a parameter estimation problem based on quantized Poisson statistics. We show that, with a single-photon quantization threshold and large oversampling factors, the Cramér-Rao lower bound (CRLB) of the estimation variance approaches that of an ideal unquantized sensor, i.e., as if there were no quantization in the sensor measurements. Furthermore, the CRLB is shown to be asymptotically achievable by the maximum-likelihood estimator (MLE). By showing that the log-likelihood function of our problem is concave, we guarantee the global optimality of iterative algorithms in finding the MLE. Numerical results on both synthetic data and images taken by a prototype sensor verify our theoretical analysis and demonstrate the effectiveness of our image reconstruction algorithm. They also suggest the potential application of the oversampled binary sensing scheme in high dynamic range photography.     

无线传感器网络中用于目标跟踪的节点规划算法

利用无线传感器网络进行目标跟踪时,由于各传感器节点的能量有限,数据蕴含的有效信息又各不相同,因此有必要规划参与目标跟踪的节点集和参与方式,以降低系统开销。本文提出了一种新的基于领导节点的节点规划算法,综合考虑收集数据和领导节点迁移过程中的通信开销,以最大化目标跟踪的性能。求解中以跟踪过程中的误差矩阵作为目标度量,采用高斯-赛德尔（Gauss-Seidel）和凸松弛等方法,使得复杂的带约束优化问题能够在接近O（N3）的时间复杂度内得到求解。仿真结果表明,与对比算法相比,本算法在相同的通信能量约束下能够达到更好的跟踪性能。     

时延受限传感器网络移动Sink路径选择方法研究

已有研究表明sink移动方案能有效提升无线传感器网络的能耗效率,但sink点移动速度的限制通常会带来较大的数据收集时延,与某些实时性要求较高的应用产生矛盾.为解决该问题,本文以满足时延要求和最小化网络整体能耗为优化目标,提出了一种基于虚拟点优先级的移动sink路径优化选择方法.仿真试验结果表明,与基准算法相比,该方法在牺牲少量能耗的前提下能显著降低算法时间复杂度,具有良好的规模可扩展性.