基于AUPF的TDOA几何定位跟踪算法研究

使用无源时差（TDOA）定位技术确定无人机等小型辐射源目标的位置是当前研究的热点,针对时差定位算法较为复杂的实际情况,推导了时差双曲线的几何解,并提出了一种基于自适应无迹粒子滤波（AUPF）技术的移动目标定位跟踪方法。通过仿真对该方法在不同场景的应用效果进行了验证,进一步比较分析了算法的定位精度。结果表明,基于自适应无迹粒子滤波的时差几何定位跟踪算法可以在多种情况下较好地拟合出目标真实运动轨迹,实现对运动目标的定位跟踪,同时拥有更低的定位误差和更高的轨迹包容度,使用该方法可以显著提高对非合作移动辐射源目标的位置估计性能。     

Distributed cooperative target detection and localization in decentralized wireless sensor networks

In many network applications such as surveillance systems, it is crucial to detect the target and estimate its location. Distributed processing algorithms are capable of providing fast, secure, scalable and robust solutions. In this paper, we study the problem of target detection and localization in a wireless sensor network. Most of the current researches have focused on centralized algorithms and the works done on distributed algorithms usually need center assistance and practical issues such as communication link failure is not addressed in them. In this paper, we first propose a distributed consensus-based algorithm for target detection and then propose a distributed consensus-based localization algorithm. We assume that the target transmits a radio signal that is received in sensors equipped with limited computational and power resources. We consider the communication link failure and use the collaboration of sensor nodes to detect the presence of target. In the proposed target localization algorithm, sensor nodes estimate their distance toward the target using the received signal strength. In both the proposed algorithms, sensor nodes exchange information only with their neighbors and each makes an individual decision. We further prove the convergence of the proposed algorithms. Computer simulations confirm that the proposed algorithms are very fast and applicable in high-performance networks. We improve the localization accuracy at least by 25 % in terms of localization error compared with some recent algorithms.     

无线传感器网络节点自身定位算法研究

无线传感器网络中节点自身位置信息是实现其应用的最重要因素之一.针对节点自身定位的研究很多,但很大一部分都集中在算法的改进和新算法的开发上,很少给出纵向直观的仿真效果比较.研究选取无需测距算法中4种典型的算法,给出它们在不同参数下的仿真定位效果图,对于工程人员根据实际选取最优算法有很好的借鉴作用.在此基础上,利用曲线拟合...     

非视距环境下室内RFID标签定位算法研究

在室内无线定位中,由于受到非视距NLOS的影响,信号的传播变得复杂起来。复杂的传播环境使得传统的定位算法例如最小二乘算法(LS)或者CHAN算法无法达到我们需要的精度。在使用无源超高频无线射频识别(Passive UHF RFID)技术的基础上,分析和建立了UHF RFID信道模型,并由此对定位误差进行了分析。基于运用相位法POA进行测距而得到的距离信息,提出了一种两步式标签定位算法:首先使用凸优化中的内点法将非视距误差消除,再使用加权残差方法进行精确定位。通过仿真结果的比较,表明本文提出的算法优于传统算法。     

Adaptive swarm optimization for locating and tracking multiple targets

Locating and tracking multiple targets in the dynamic and uncertain environment is a crucial and challenging problem in many practical applications. The main task of this paper is to investigate three fundamental problems, which are composed of the identification of irregular target, locating multiple targets and tracking multiple targets. Firstly, the proposed objective function successfully gets the target's shape to discern eccentric target in the specific environment. Secondly, for the sake of locating multiple targets, the adaptive PSO algorithm divides the swarm into many subgroups, and adaptively adjusts the number of particles in each subgroup by the competition and cooperation technology. Thirdly, in order to track multiple targets in the dynamic environment, the proposed swarm optimization has the characteristic of the adaptively covered radius of the subgroup according to the minimum distance among other subgroups. To show the efficiency and high performance of the proposed algorithms, several algorithms chiefly concentrate on locating and tracking three ants in the practical systems.     

A unified learning algorithm to extract principal and minor components

Recently, many unified learning algorithms have been developed to solve the task of principal component analysis (PCA) and minor component analysis (MCA). These unified algorithms can be used to extract principal component and if altered simply by the sign, it can also serve as a minor component extractor. This is of practical significance in the implementations of algorithms. Convergence of the existing unified algorithms is guaranteed only under the condition that the learning rates of algorithms approach zero, which is impractical in many practical applications. In this paper, we propose a unified PCA & MCA algorithm with a constant learning rate, and derive the sufficient conditions to guarantee convergence via analyzing the discrete-time dynamics of the proposed algorithm. The achieved theoretical results lay a solid foundation for the applications of our proposed algorithm.     

Geometric interpretation of theoretical bounds for RSS-based source localization with uncertain anchor positions

The Received Signal Strength based source localization can encounter severe problems originating from uncertain information about the anchor positions in practice. The anchor positions, although commonly assumed to be precisely known prior to the source localization, are usually obtained using previous estimation algorithm such as GPS. This previous estimation procedure produces anchor positions with limited accuracy that result in degradations of the source localization algorithm and topology uncertainty. We have recently addressed the problem with a joint estimation framework that jointly estimates the unknown source and uncertain anchors positions and derived the theoretical limits of the framework. This paper extends the authors previous work on the theoretical performance bounds of the joint localization framework with appropriate geometric interpretation of the overall problem. It exploits the properties of semi-definiteness and symmetry of the Fisher Information Matrix and the Cramèr–Rao Lower Bound to derive Information and Error Ellipses, respectively. The numerical results aim to illustrate and discuss the usefulness of the geometric interpretation. They provide in-depth insight into the geometrical properties of the joint localization problem underlining the various possibilities for practical design of efficient localization algorithms.     

Distributed mutual exclusion algorithms for grid applications: A hierarchical approach

The majority of current distributed mutual exclusion algorithms are not suited for parallel or distributed applications on a Grid as they do not consider the heterogeneity of latency on Grids. We propose two distributed mutual exclusion algorithms, based on Naimi–Trehel's token-based algorithm, which take into account latency gaps, especially those between local and remote clusters of machines. Our first algorithm exploits cluster locality by giving higher priority to critical section requests issued from nodes of the same cluster when compared to those from remote nodes. Our second algorithm adds a router layer to the first algorithm, bringing it closer to Grid network topology. Viewing each cluster as a single node, the Naimi–Trehel algorithm is applied to this router layer. Redirection of inter-cluster messages to cluster's nodes is then minimized.     

基于圆形麦克风阵列的声源定位改进算法

针对波达方向估计中传统互功率谱法声源方位估计准确性差、方位模糊的问题,提出了一种基于圆形麦克风阵列的声源定位改进算法,并进行了实验验证。在该改进算法中,先设计了十二元圆形麦克风阵列,由麦克风对接收语音信号的时延与相位得到相位旋转因子,再将其引入到语音信号的互功率谱中,新定义了圆形集成互功率谱,由该功率谱进行声源方位估计。仿真与实测实验结果表明,本文的圆形集成互功率谱法对声源方位进行估计,估计的准确度高于传统互功率谱法。     

Privacy-preserving identity-based broadcast encryption

Broadcast encryption enables a broadcaster to encrypt messages and transmit them to some subset S of authorized users. In identity-based broadcast encryption schemes, a broadcasting sender typically encrypts a message by combining public identities of receivers in S and system parameters. However, previous identity-based broadcast encryption schemes have not been concerned about preserving the privacy of receivers. Consequently, all of the identities of broadcast receivers in S are exposed to the public in the previous schemes, which may be subject to attacks on user privacy in lots of pragmatic applications. We propose a novel privacy-preserving identity-based broadcast encryption scheme against an active attacker. The proposed scheme protects the privacy of receivers of broadcasted messages by hiding the identities of receivers in S. Additionally, it achieves less storage and computation costs required to encrypt and decrypt the broadcast message, compared to the previous identity-based broadcast encryption schemes that do not provide user privacy.     

基于RSSI等级的蒙特卡罗定位算法应用研究

感知节点的定位是无线传感网应用的基础。现有的静态定位算法无法应用于动态传感网。针对一类目标节点移动而锚节点静止的传感网应用,提出了一种RRMCL（RSSI Rank Monte Carlo Localization）定位算法。该算法以蒙特卡罗算法为基础,利用RSSI（Received Signal Strength Indication）值与距离的单调递减关系划分通信域,减少采样区域大小。为了避免锚节点共线出现定位失效的情况,引入共线影响角度,提出了一种约束策略。仿真结果表明,提出的RRMCL与现有的MCL和MCB定位算法相比,能有效缩小采样区域,提高了定位精度和速度。     

A successive projection method for binary pattern recognition with multilayer feedforward neural networks

Error back-propagation (BP) is one of the most popular ideas used in learning algorithms for multilayer neural networks. In BP algorithms, there are two types of learning schemes, online learning and batch learning. The online BP has been applied to various problems in practice, because of its simplicity of implementation. However, efficient implementation of the online BP usually requires an ad hoc rule for determining the learning rate of the algorithm. In this paper, we propose a new learning algorithm called SPM, which is derived from the successive projection method for solving a system of nonlinear inequalities. Although SPM can be regarded as a modification of online BP, the former algorithm determines the learning rate (step-size) adoptively based on the output for each input pattern. SPM may also be considered a modification of the globally guided back-propagation (GGBP) proposed by Tang and Koehler. Although no theoretical proof of the convergence for SPM is given, some simulation results on pattern classification problems indicate that SPM is more effective and robust than the standard online BP and GGBP     

A parametric extension of mixed time/frequency robustidentification

A parametric extension to the time/frequency robust identification framework is presented. The results can be applied to stable linear time-invariant systems on which time and/or frequency experiments have been performed. The parametric portion of the model should be affine in the unknown parameters, which includes practical applications such as flexible structures. The consistency problem is cast as a constrained finite-dimensional convex optimization problem that can be formulated as a linear matrix inequality. The proposed procedure provides an interpolating identification algorithm, convergent and optimal up to a factor of two (with respect to central algorithms)     

多层前向网络的研究——遗传BP算法和结构优化策略

分析了引起BP算法局部收敛现象的原因,探讨了解决的途径.通过对遗传算法中 的基因群体的实数化,并将其与BP算法有机地集成起来,提出了遗传BP算法.此外,在借鉴 网络剪枝法思想的基础上,重新定义网络结构复杂度函数,并以遗传算法直接求解网络结构 优化问题,给出了网络结构优化策略.仿真结果和实际应用均表明了上述研究的成效.     

Sparse representations and sphere decoding for array signal processing

Array processing algorithms are used in many applications for source localization and signal waveform estimation. When the number of snapshots is small and/or the signal-to-noise ratio (SNR) is low, it becomes a challenge to discriminate closely-spaced sources. In this paper, two new array processing algorithms exploiting sparsity are proposed to overcome this problem. The first proposed method combines a well-known sparsity preserving algorithm, namely the least absolute shrinkage and selection operator (LASSO), with the Bayesian information criterion (BIC) to eliminate user parameters. The second proposed algorithm extends the sphere decoding algorithm, which is widely used in communication applications for the recovery of signals belonging to a finite integer dictionary, to promote the sparsity of the solution. The proposed algorithms are compared with several existing sparse signal estimation techniques. Simulations involving uncorrelated and coherent sources demonstrate that the proposed algorithms, especially the algorithm based on sphere decoding, show better performance than the existing methods. Moreover, the proposed algorithms are shown to be more practical than the existing methods due to the easiness in selecting their user parameters.     

基于无线传感器网络的自适应声源定位算法

基于声源能量的无线传感器网络（ WSNs）最大似然定位算法抗噪声干扰能力强,定位精度高,同时适用于多个目标定位,但是计算量大,不适用于实时定位。针对现有算法的缺点,提出了一种基于自适应迭代的最大似然定位算法。该算法将代价函数作为目标函数,在给定的梯度误差范围内自适应地搜索目标位置。为了提高算法的收敛速度和定位精度,提出了基于Sigmoid函数的变步长的搜索算法。仿真实验结果表明：与最大似然定位算法相比,自适应迭代算法运算量小,定位精度高,能满足对目标定位精度和速度要求较高的场合,具有一定的实际应用意义。     

基于飞行理论萤火虫算法的TDOA与GROA定位机制

节点定位是无线传感器网络中最为关键的一项技术。针对无源定位的问题,提出一种到达时间差(TDOA)和到达信号增益比(GROA)联合定位算法,并且采用飞行机制的萤火虫算法(GSO)来求得最终结果。结合TDOA和GROA定位模型,引入辅助变量将方程伪线性化,然后采用修正两步加权最小二乘算法(TSWLS)来进行求解。并且在不影响收敛速度和精度的前提下,采用带有飞行机制的GSO算法来寻求目标定位的最优解,克服粒子群算法易陷入局部最优的缺点。仿真结果表明,该算法相比较TDOA算法而言,定位精度提高了23 dB,并且具有相对较高和较稳定的定位精度。     

一种应用约束优化理论的TOA定位算法

移动通信、声源探测等领域的应用要求通过分布在不同位置的信号接收站得到的TOA测量值实现对辐射信号源进行定位。针对这个问题,提出了一种应用约束优化理论的基于TOA的定位算法,将由定位方程得到的加权线性最小二乘函数作为目标函数,并选择未知矢量元素之间的关系作为约束条件。仿真实验中将该方法与两步加权最小二乘等方法和CRLB进行比较的结果表明,约束优化理论的应用有效提高了定位精度。     

Process Arrival Pattern Aware Alltoall and Allgather on InfiniBand Clusters

Recent studies show that MPI processes in real applications could arrive at an MPI collective operation at different times. This imbalanced process arrival pattern can significantly affect the performance of the collective operation. MPI_Alltoall() and MPI_Allgather() are communication-intensive collective operations that are used in many scientific applications. Therefore, their efficient implementations under different process arrival patterns are critical to the performance of scientific applications running on modern clusters. In this paper, we propose novel RDMA-based process arrival pattern aware MPI_Alltoall() and MPI_Allgather() for different message sizes over InfiniBand clusters. We also extend the algorithms to be shared memory aware for small to medium size messages under process arrival patterns. The performance results indicate that the proposed algorithms outperform the native MVAPICH implementations as well as other non-process arrival pattern aware algorithms when processes arrive at different times. Specifically, the RDMA-based process arrival pattern aware MPI_Alltoall() and MPI_Allgather() are 3.1 times faster than MVAPICH for 8 KB messages. On average, the applications studied in this paper (FT, RADIX, and N-BODY) achieve a speedup of 1.44 using the proposed algorithms.     

基于蒙特卡罗算法煤矿井下人员定位研究

对比分析几种常用的无线传感器网络节点定位方法.针对煤矿井下节点移动性可能导致普通的定位算法变得不精确,提出了蒙特卡罗定位(Monte Carlo Localization)算法.该方法利用物体运动的连续性,通过选取合适的模型完成移动节点位置预测与定位.经仿真验证在低密度锚节点环境下,蒙特卡罗方法位置估计误差明显低于其它方法,提高了移动节点定位算法的准确性.