基于无线电相干的传感器网络节点定位

目前无线传感器网络节点定位算法中,能够兼顾高精度和远距离定位的算法只有RIPS方法,然而该方法利用汇聚节点进行集中定位。提出了一种基于无线电相干的角度估计算法,并分布式定位节点,在高精度、远距离定位节点的同时,可大规模应用该算法,且定位速度快。实验表明,该方法平均方位估计误差是3.20,90%的测量值误差在6.4度以内。     

容积卡尔曼一致滤波

针对卡尔曼一致滤波的应用受限于被估计系统需 满足线性条件的问题,通过容积卡尔曼滤波(CKF)和一致性策 略的动态结合,提出一种容积卡尔曼一致滤波(CKCF)算法。算法采用分布式融合机制, 传感器节点采集可通信相邻 节点的信息,并作为自身节点的量测信息应用于CKF,获取局部状态估计 值。在此基础上,利用一 致性策略实现对整个量测系统中传感器节点局部估计值的优化,进而通过增强传感器节点估 计值一致性实现目标 状态估计精度的提升。相对于标准卡尔曼一致滤波,本文算法将一致性策略推广到非线性系 统估计领域。理论分析 与仿真实验验证了算法的可行性与有效性。     

Geolocation in ad hoc networks using DS-CDMA and generalized successive interference cancellation

Channel estimation and distributed positioning algorithms are presented for geolocation in a wireless ad hoc network. The network uses a direct-sequence code-division multiple-access-based handshaking protocol, in which nodes receive multiple acknowledgment packets in response to a request-to-send waveform. Round-trip travel time (RTT) and angle-of-arrival (AOA) measurements are obtained using the generalized successive interference cancellation/matching pursuits (GSIC/MP) algorithm. The performance of GSIC/MP is evaluated via simulation and comparison to the Crame/spl acute/r-Rao bound. Position estimates are initialized using linearized least-squares and updated by an extended Kalman filter-based algorithm that includes measurement validation for nonline-of-sight error mitigation. The method is generalized for distributed estimation in sparsely connected networks: at each node, position estimates from connected nodes are incorporated via a fusion algorithm and updated using locally processed RTT/AOA measurements. Finally, comprehensive ad hoc network simulations are presented including channel ray tracing, RTT/AOA estimation and validation, and distributed positioning.     

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

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

Power efficient range-free localization algorithm for wireless sensor networks

Considering energy consumption, hardware requirements, and the need of high localization accuracy, we proposed a power efficient range-free localization algorithm for wireless sensor networks. In the proposed algorithm, anchor node communicates to unknown nodes only one time by which anchor nodes inform about their coordinates to unknown nodes. By calculating hop-size of anchor nodes at unknown nodes one complete communication between anchor node and unknown node is eliminated which drastically reduce the energy consumption of nodes. Further, unknown node refines estimated hop-size for better estimation of distance from the anchor nodes. Moreover, using average hop-size of anchor nodes, unknown node calculates distance from all anchor nodes. To reduce error propagation, involved in solving for location of unknown node, a new procedure is adopted. Further, unknown node upgrades its location by exploiting the obtained information in solving the system of equations. In mathematical analysis we prove that proposed algorithm has lesser propagation error than distance vector-hop (DV-Hop) and other considered improved DV-Hop algorithms. Simulation experiments show that our proposed algorithm has better localization performance, and is more computationally efficient than DV-Hop and other compared improved DV-Hop algorithms.     

基于改进DV-Hop的无线传感器网络节点定位算法

针对DV-Hop距算法定位误差大的难题,提出一种改进离估计误差,并利用DV-Hop的传感器节点定位算法。首先修正知节点与信标节DV-Hop算法对节点进行定位;然后对进V-Hop算法定位误差行校正,最后在Matlab 2012平台上对算法性能进行仿真分析。仿真结果表明,本文算法可以较好地克服DV-Hop算法存在的不足,提高了传感器节点的定位精度。     

Distributed Estimation in Energy-Constrained Wireless Sensor Networks

In this paper, we consider distributed estimation of a noise-corrupted deterministic parameter in energy-constrained wireless sensor networks from energy-distortion perspective. Given a total energy budget allowable to be used by all sensors, there exists a tradeoff between the subset of active sensors and the energy used by each active sensor in order to minimize the estimation MSE. To determine the optimal quantization bit rate and transmission energy of each sensor, a concept of equivalent unit-energy MSE function is introduced. Based on this concept, an optimal energy-constrained distributed estimation algorithm for homogeneous sensor networks and a quasi-optimal energy-constrained distributed estimation algorithm for heterogeneous sensor networks are proposed. Moreover, the theoretical energy-distortion performance bound for distributed estimation is addressed and it is shown that the proposed algorithm is quasi-optimal within a factor 2 of the theoretical lower bound. Simulation results also show that the proposed method can achieve a significant reduction in the estimation MSE when compared with other uniform schemes. Finally, the proposed algorithm is easy to implement in a distributed manner and it adapts well to the dynamic sensor environments.     

无线传感器网络中基于潜在博弈的分布式节点定位

分布式定位是无线传感器网络研究中的热点问题.传统的分布式定位机制存在定位精度低,算法求解复杂等问题.为此,以与邻居节点集距离误差和作为效益函数,提出基于博弈论的分布式定位模型.给出了该博弈模型为潜在博弈的形式化证明,并从理论上证明了纳什均衡的存在性及最终收敛解的有效性.进一步,仅通过与邻居节点进行策略信息交互,提出基于潜在博弈的分布式定位算法.最后设计了博弈策略空间的决策机制与未知节点的升级机制,以避免陷入局部最优并加速收敛至全网最优解.一系列仿真实验验证了所提算法的有效性.     

Three-Dimension Localization of Wideband Sources Using Sensor Network

Usually source localization using sensor networks requires many sensors to localize a few number of sources, and it is still very troublesome to deal with coherent sources. When the three-dimensional (3-D) space are considered, the localization will become more difficult. A new approach is proposed to localize 3-D wideband coherent sources based on distributed sensor network, which consists of two nodes and each node contains only two sensors. Direction-of-arrival (DOA) estimation is performed at each node by employing a new noise subspace proposed. Combining the pattern matching idea and the prior geometrical information of sources, a cost function is constructed to estimate the rough positions. A rotational projection algorithm is proposed to estimate the heights of sources and correct the rough positions, and consequently the localization of 3-D sources could be achieved. Numerical examples are provided to demonstrate the effectiveness of this approach.     

无线传感器网络定位的分布式求精算法

通过对WSN中基于测距的定位进行误差分析提出一种求精算法。该算法每次迭代中首先根据“磁极”思想确定“误差节点”和“有效节点”;然后在误差节点的邻居节点中选择2个相对偏差最小的节点作为圆心,以它们到误差节点的测距值为半径分别作圆,得到两个交点;最后在它的当前定位位置和这2个交点之中选择误差较小的作为本轮的求精位置。仿真结果表明,该算法能够降低多边定位模型产生的节点位置误差,有效提高网络的定位精度。     

CRWSNP: cooperative range-free wireless sensor network positioning algorithm

Sensing events occur in an area without knowing the events locations, is meaningless. Since there is no priorly knowledge about the locations of most of the sensors which scattered randomly in an area, wireless sensor network localization methods try to find out where sensors are located. A new cooperative and distributed range-free localization algorithm, based on only connectivity information is proposed in this paper. The method first uses convex optimization techniques to find primitive target nodes locations estimation, then nodes cooperate with each other in several iterations to improve the whole network location estimation. CRWSNP converges after a finite number of iterations because of applying two novel heuristic location correction techniques. As well as, results of the algorithm have been compared with six range-free based methods like CPE, DV-hop, APIT; and CRWSNP algorithm provides more accurate results over 50 random topologies for the network, in mean error and maximum error metrics.     

DUCR: Distributed unequal cluster‐based routing algorithm for heterogeneous wireless sensor networks

Designing energy efficient communication protocols for wireless sensor networks (WSNs) to conserve the sensors' energy is one of the prime concerns. Clustering in WSNs significantly reduces the energy consumption in which the nodes are organized in clusters, each having a cluster head (CH). The CHs collect data from their cluster members and transmit it to the base station via a single or multihop communication. The main issue in such mechanism is how to associate the nodes to CHs and how to route the data of CHs so that the overall load on CHs are balanced. Since the sensor nodes operate autonomously, the methods designed for WSNs should be of distributed nature, i.e., each node should run it using its local information only. Considering these issues, we propose a distributed multiobjective‐based clustering method to assign a sensor node to appropriate CH so that the load is balanced. We also propose an energy‐efficient routing algorithm to balance the relay load among the CHs. In case any CH dies, we propose a recovery strategy for its cluster members. All our proposed methods are completely distributed in nature. Simulation results demonstrate the efficiency of the proposed algorithm in terms of energy consumption and hence prolonging the network lifetime. We compare the performance of the proposed algorithm with some existing algorithms in terms of number of alive nodes, network lifetime, energy efficiency, and energy population.     

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

Network Lifetime Maximization for Estimation in Multihop Wireless Sensor Networks

We consider the distributed estimation by a network consisting of a fusion center and a set of sensor nodes, where the goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional. In energy-limited wireless sensor networks, both local quantization and multihop transmission are essential to save transmission energy and thus prolong the network lifetime. The network lifetime optimization problem includes three components: i) optimizing source coding at each sensor node, ii) optimizing source throughput of each sensor node, and iii) optimizing multihop routing path. Fortunately, source coding optimization can be decoupled from source throughput and multihop routing path optimization, and is solved by introducing a concept of equivalent 1-bit MSE function. Based on the optimal source coding, the source throughput and multihop routing path optimization is formulated as a linear programming (LP) problem, which suggests a new notion of character-based routing. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods.     

基于最优阶估计与分布式分簇的传感器网络数据压缩方法研究

在无线传感器网络的诸多应用中,被监测区域发生异常情况的概率通常较小,正常情况下,同一传感器节点在前后连续时刻所采集的数据具有时间相关性,处于相邻区域的不同传感器节点在同一时刻所采集的数据具有空间相关性,发送存在时间、空间冗余的数据至基站必将耗费节点大量的能量。该文提出了基于最优阶估计和分布式分簇的传感器网络数据压缩方法,利用节点采集数据的时空相关性,基于最优阶估计在基站处建立相关系数,经分布式分簇,节点仅需传送少量数据,基站根据时空相关性恢复原始数据。仿真结果表明应用该算法,可以有效减少传感器网络中冗余数据传输量和节点能耗,进而延长系统寿命。     

视觉传感器网络中基于RANSAC的顽健定位算法

视觉传感器网络由于节点故障或环境变化将导致节点对目标的观测数据出现错误,而基于最小二乘的多视觉信息融合定位方法将因此造成较大的定位误差。针对此问题提出一种基于集中式RANSAC的顽健定位算法,将错误数据进行筛选剔除,从而提高定位精度,进一步针对集中式 RANSAC 将会导致单个节点的计算复杂度过高而导致网络节点能耗不平衡问题,提出基于分布式 RANSAC 的顽健定位算法,从而将大量的迭代计算平均分布在各个节点中并行处理,在保证定位过程顽健性的同时保证了网络的计算能耗平衡性。最后通过实验对no-RANSAC、cen-RANSAC 和 dis-RANSAC算法的定位性能进行了比较,验证了该算法能够依照预定的概率获得良好的定位结果,并对算法的时间复杂度进行了分析。     

Distributed Information Consensus Filters for Simultaneous Input and State Estimation

This paper describes the distributed information filtering where a set of sensor networks are required to simultaneously estimate input and state of a linear discrete-time system from collaborative manner. Our research purpose is to develop a consensus strategy in which sensor nodes communicate within the network through a sequence of Kalman iterations and data diffusion. A novel recursive information filtering is proposed by integrating input estimation error into measurement data and weighted information matrices. On the fusing process, local system state filtering transmits estimation information using the consensus averaging algorithm, which penalizes the disagreement in a dynamic manner. A simulation example is provided to compare the performance of the distributed information filtering with optimal Gillijins–De Moor’s algorithm.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

Node distribution-based localization for large-scale wireless sensor networks

Distributed localization algorithms are required for large-scale wireless sensor network applications. In this paper, we introduce an efficient algorithm, termed node distribution-based localization (NDBL), which emphasizes simple refinement and low system-load for low-cost and low-rate wireless sensors. Each node adaptively chooses neighboring nodes, updates its position estimate by minimizing a local cost-function, and then passes this updated position to neighboring nodes. This update process uses a node distribution that has the same density per unit area as large-scale networks. Neighbor nodes are selected from the range in which the strength of received signals is greater than an experimentally based threshold. Based on results of a MATLAB simulation, the proposed algorithm was more accurate than trilateration and less complex than multi-dimensional scaling. Numerically, the mean distance error of the NDBL algorithm is 1.08–5.51 less than that of distributed weighted multi-dimensional scaling (dwMDS). Implementation of the algorithm using MicaZ with TinyOS-2.x confirmed the practicality of the proposed algorithm.     

WSN中基于稀疏观测和异步传输的分布式实时定位算法

针对无线传感器网络（WSN）中现有集中式多维标度（MDS-MAP）节点定位算法在定位精度和分布式方面的不足,提出一种基于稀疏观测和异步传输的分布式实时定位算法。首先在传统MDS-MAP算法中融入稀疏观测机制,使其能够更好地符合实际观测场景;然后提出一种异步传输序列,使节点能够分布式计算距离观测,并通过分布式计算结果给出位置估计;最后通过提出的位置估计精化操作减小估计误差,最终实现节点的精确定位。实验结果表明,该算法具有较高的定位精度。