基于距离几何约束的二次加权质心定位算法

利用二维实空间中Cayley-Menger行列式提供的距离几何约束条件,结合加权质心计算,提出一种基于距离几何约束的二次加权质心定位算法(DGC-TWCL)。Cayley-Menger行列式用于求解测距误差的优化解,从而可修正节点间的非精确距离。二次加权质心计算通过加权因子来体现锚节点在定位坐标确定中的影响程度。实验结果表明：DGC-TWCL具有较好的定位精度及算法可扩展性和鲁棒性。     

Multi-sensor data fusion methods for indoor localization under collinear ambiguity

Sensor node localization in mobile ad-hoc sensor networks is a challenging problem. Often, the anchor nodes tend to line up in a linear fashion in a mobile sensor network when nodes are deployed in an ad-hoc manner. This paper discusses novel node localization methods under the conditions of collinear ambiguity of the anchors. Additionally, the work presented herein also describes a methodology to fuse data available from multiple sensors for improved localization performance under conditions of collinear ambiguity. In this context, data is first acquired from multiple sensors sensing different modalities. The data acquired from each sensor is used to compute attenuation models for each sensor. Subsequently, a combined multi-sensor attenuation model is developed. The fusion methodology uses a joint error optimization approach on the multi-sensor data. The distance between each sensor node and anchor is itself computed using the differential power principle. These distances are used in the localization of sensor nodes under the condition of collinear ambiguity of anchors. Localization error analysis is also carried out in indoor conditions and compared with the Cramer–Rao lower bound. Experimental results on node localization using simulations and real field deployments indicate reasonable improvements in terms of localization accuracy when compared to methods likes MLAR and MGLR.     

基于负约束条件下最大似然估计的无线传感网络定位算法

针对基于RSSI(Received Signal Strength Indicator)的无线传感网络定位算法精度不高的问题,提出一种负约束条件下的似然估计定位算法。当未知节点在参考节点的通信范围之外时,引入负约束条件来提高定位精度。主要工作可分为三部分:第一,根据RSSI值测量参考节点与未知节点之间的距离。第二,根据参考节点与未知节点通信关系建立正约束和负约束条件下的似然估计函数。第三,利用粒子群优化算法找到未知节点的最佳位置。仿真结果表明,引入负约束条件可以提高定位精度,且优于传统的定位算法。     

一种基于动态跳数距离的有洞无线传感器网络定位方法

在无线传感器网络中,与距离无关的定位技术一直是一项挑战性的工作。尤其是在有洞的各向异性网络中,多}L节点之间的距离估算更是一个难点。针对有洞的无线传感器网络,提出一种新的距离无关定位方法,该方法可以较好地估算未知节点到参考节点之间的距离。其主要思想是,先佑算各信标节点对之间的平均单跳距离,然后选择平均单跳距离较大并且最短路径通过未知节点的信标节点对作为参考节点来估算未知节点的位置。新算法能够较好地滤除距离估算误差较大的信标节点作为参考节点。实验表明,新算法比以前的算法定位更准确。     

Efficient and accurate sensor network localization

Wireless sensor networks (WSN) have great potential in ubiquitous computing. However, the severe resource constraints of WSN rule out the use of many existing networking protocols and require careful design of systems that prioritizes energy conservation over performance optimization. A key infrastructural problem in WSN is localization—the problem of determining the geographical locations of nodes. WSN typically have some nodes called seeds that know their locations using global positioning systems or other means. Non-seed nodes compute their locations by exchanging messages with nodes within their radio range. Several algorithms have been proposed for localization in different scenarios. Algorithms have been designed for networks in which each node has ranging capabilities, i.e., can estimate distances to its neighbours. Other algorithms have been proposed for networks in which no node has such capabilities. Some algorithms only work when nodes are static. Some other algorithms are designed specifically for networks in which all nodes are mobile. We propose a very general, fully distributed localization algorithm called range-based Monte Carlo boxed (RMCB) for WSN. RMCB allows nodes to be static or mobile and that can work with nodes that can perform ranging as well as with nodes that lack ranging capabilities. RMCB uses a small fraction of seeds. It makes use of the received signal strength measurements that are available from the sensor hardware. We use RMCB to investigate the question: “When does range-based localization work better than range-free localization?” We demonstrate using empirical signal strength data from sensor hardware (Texas Instruments EZ430-RF2500) and simulations that RMCB outperforms a very good range-free algorithm called weighted Monte Carlo localization (WMCL) in terms of localization error in a number of scenarios and has a similar computational complexity to WMCL. We also implement WMCL and RMCB on sensor hardware and demonstrate that it outperforms WMCL. The performance of RMCB depends critically on the quality of range estimation. We describe the limitations of our range estimation approach and provide guidelines on when range-based localization is preferable.     

A new range-free localization method using quadratic programming

In this paper, we propose a new range-free localization algorithm called optimal proximity distance map using quadratic programming (OPDMQP). First, the relationship between geographical distances and proximity among sensor nodes in the given wireless sensor network is mathematically built. Then, the characteristics of the given network is represented as a set of constraints on the given network topology and the localization problem is formulated into a quadratic programming problem. Finally, the proposed method is applied to two anisotropic networks the topologies of which are very similar to those of the real-world applications. Unlike the most of previous localization methods which work well in the isotropic networks but not in the anisotropic networks, it is shown that the proposed method exhibits excellent and robust performances not only in the isotropic networks but also in the anisotropic networks.     

基于改进粒子群优化的无线传感器网络定位算法

无线电干涉定位系统获取的干涉距离是4个传感器节点间距离的线性组合值.针对以两个节点间距离作为输入的传统定位算法无法直接利用上述干涉距离进行定位的问题,提出一种基于改进粒子群优化的定位方法.利用干涉距离的实验数据,分析比较了遗传算法和改进粒子群优化在无线传感器网络节点定位问题中的性能.结果表明,基于改进粒子群优化的定位方法的平均耗费时间远远小于基于遗传算法的定位方法,具有更高的优化效率.     

基于平均跳距估计和位置修正的DV-Hop定位算法

针对传统DV-Hop定位算法只考虑了最近一个锚节点估计的平均跳距,而导致定位误差较大这一问题,提出了一种基于平均跳距估计和位置修正的改进DV-Hop定位算法.改进算法在计算未知节点到各个锚节点距离时,考虑到离该未知节点最近的锚节点到其它锚节点的距离及跳数的不同,计算出不同的平均跳距,使其更接近于实际平均跳距,另外,改进算法还对初步定位结果进行了循环位置修正.仿真结果表明,与传统DV-Hop算法相比,改进算法在不需要增加节点的硬件开销的基础上能更有效地提高定位精度,并且算法简单,计算量小,是无线传感器网络中节点定位的一种实用方案.     

基于平均跳距估计的改进DV-Hop定位算法

传统DV—Hop定位算法只考虑了最近一个锚节点估计的平均每跳距离,而单个锚节点估计的平均每跳距离值无法准确地反映网络的实际平均跳距,导致定位误差较大。针对这一问题,提出一种基于平均跳距估计的改进DV—Hop定位算法。改进算法在计算未知节点到各个锚节点距离时,考虑到离该未知节点最近的锚节点到其它锚节点的距离及跳数的不同,计算出不同的平均跳距,使其更接近于实际平均跳距。仿真结果表明,与传统DV—Hop算法相比,改进算法在不需要增加节点的硬件开销的基础上能更有效地提高定位精度,并且算法简单,计算量小,是无线传感器网络中节点定位的一种实用方案。     

无线传感器网络距离自调整的MDS定位算法

定位技术是无线传感器网络中的关键支撑技术之一。针对移动无线传感器网络的特点,在深入分析现有多维定标节点定位算法的基础上,提出一种改进机制,即距离自调整的多维定标节点定位算法(SA_MDS)。该算法运用3种方法估算节点的两跳距离,然后自动调整节点间的估算距离,从而提高定位精度。仿真结果表明,采用SA_MDS算法,节点的定位精度有较大提高。     

基于人工蜂群算法的DV-Hop定位改进

针对无线传感器网络无需测距依赖的DV-Hop定位算法节点定位精度不高的问题,将鲁棒性强、收敛速度快且全局寻优性能优异的人工蜂群算法引入到DV-Hop算法的设计中,提出了一种ABDV-Hop(Artificial Bee ColonyDV-Hop)算法。该算法在传统DV-Hop算法的基础上,利用节点间的距离和锚节点的位置信息,在DV-Hop算法的最后阶段,通过建立目标优化函数,实现对未知节点坐标的估计。仿真结果表明,与传统DV-Hop算法相比,在不增加传感器节点的硬件开销的基础上,改进算法能有效降低定位误差。     

A framework based on barycentric coordinates for localization in wireless sensor networks

Localization is a fundamental and vital problem in wireless sensor networks. This paper presents an optimizing framework for localization based on barycentric coordinates. The framework consists of two components. The first component retains the structure revealed by the distances between pairs of nodes; the second component constrains the boundary nodes to maintain the distance with their neighbor nodes. A hybrid localization algorithm is derived on top of the optimizing framework. A part of the computation is performed collaboratively by nodes, whereas the rest is executed on the sink node. Experimental results show that the proposed localization algorithm obtains lower location errors without higher communication costs.     

High accuracy localization method using AoA in sensor networks

In sensor networks, several applications such as habitat monitoring and moving objects tracking, require the knowledge of nodes positions. Position estimation most often includes errors due to the measurements of distance and incoming angles between neighbors. Erroneous positions are propagated from a node to other nodes exacerbating the degree of errors in the estimation of the positions of these nodes. In this paper, we propose a new localization method, called HA-A2L (High Accuracy localization based on Angle to Landmark); it consists of (a) a new protocol that allows nodes to exchange information pertinent to the localization process; and (b) a localization algorithm that uses estimation of distances and incoming angles to locate nodes in sensors networks. Compared, via simulations, to previous methods, such as APS and A2L, HA-A2L considerably increases the number of located nodes with far better accuracy.     

基于RSSI的无线传感器网络节点自身定位算法

节点自身定位是无线传感器网络的基础性问题之一.提出了一种基于接收信号强度指示(RSSI)的节点自身定位算法.该算法利用RSSI值估算网络中所有可通信节点间距离的相对大小,得到网络中各节点位置之间的几何约束关系,并以此为约束条件,以锚节点质心和未知节点质心之间的距离最小为目标,将定位问题转化为非线性最优化问题.实验结果显示,当锚节点分布在网络边缘时,该算法可以达到较好的定位效果.     

节点分布对无线传感器节点定位性能的影响

为了提高无线传感器节点的定位准确性,针对当前算法没有考虑节点分布对无线传感器节点定位性能的影响,提出一种考虑节点分布的无线传感器节点定位算法。分析节点分布对无线传感器节点定位性能的影响,估计锚节点之间的实际距离和估算距离的误差,并采用DV-Hop算法进行初步定位,综合学习粒子群算法对DV-Hop算法的定位误差进行修正,采用多个实验对算法性能测试。实验结果表明,无论在节点分布均匀或分布不均匀条件下,该算法可以较好地修正DV-Hop算法定位误差,均明显提高了未知传感器节点的定位精度。     

一种适用于无线传感器网络的健壮的有序定位算法

提出了一种分布式无线传感器网络有序定位算法,利用邻居节点间的测量距离和两跳邻居的坐标信息来对网络中的节点进行定位,在测量距离误差较大的情况下仍然能够比较理想地估算出节点的地理位置.先对约束条件比较多的节点进行定位,这样该节点的定位精度就比较高,一个节点得到坐标后又会引入若干约束条件,这些条件又作为定位其他节点的约束,就这样一直定位下去.实验证明此种优化手段可以显著改善定位精度.详细分析了该定位算法中采用的各种技术,并针对邻居数目和测量距离精度做了很多实验来研究其对定位结果的影响.     

Evolutionary approach on connectivity-based sensor network localization

The sensor network localization based on connectivity can be modeled as a non-convex optimization problem. It can be argued that the actual problem should be represented as an optimization problem with both convex and non-convex constraints. A two-objective evolutionary algorithm is proposed which utilizes the result of all convex constraints to provide a starting point on the location of the unknown nodes and then searches for a solution to satisfy all the convex and non-convex constraints of the problem. The final solution can reach the most suitable configuration of the unknown nodes because all the information on the constraints (convex and non-convex) related to connectivity have been used. Compared with current models that only consider the nodes that have connections, this method considers not only the connection constraints, but also the disconnection constraints. As a MOEA (Multi-Objective Evolution Algorithm), PAES (Pareto Archived Evolution Strategy) is used to solve the problem. Simulation results have shown that better solution can be obtained through the use of this method when compared with those produced by other methods.     

基于非凸约束信息的传感器网络节点定位方法

节点定位是无线传感器网络中的关键性问题,大多数定位方法无法评估每个节点的定位精度。该文提出一种无需测距的定位算法,将传感器节点的真实位置限定于一个区域中,使用该区域的面积评估传感器节点的位置精确度,利用网络中的非凸约束提高定位精度。仿真结果表明,在使用非凸约束的情况下,对于节点总数为250,20%为已知位置节点的传感器网络来说,90%的节点能较好地被定位。     

一种高斯噪声下基于最大分散度的WSN半定规划定位算法

基于最大分散度的概念,本文提出了一种新的高斯噪声下基于半定规划的WSN定位算法——MSDSDP算法。该算法将定位问题建模成一个将最大化网络分散度作为目标函数,由节点测量距离和噪声标准差确定的不等式作为约束条件的最优化问题,并将该最优化问题松弛为半定规划模型进行求解。分析及实验结果表明,该算法能有效地克服fullSDP节点估计位置向锚节点凸包中心汇聚的问题,在计算复杂度相同的情况下明显提高定位精度。将MSDSDP算法的结果作为初始点进行梯度搜索,能进一步提高定位精度。     

基于凸优化算法的无人水下航行器协同定位

In this paper, a cooperative localization algorithm for autonomous underwater vehicles (AUVs) is proposed. A ``parallel" model is adopted to describe the cooperative localization problem instead of the traditional ``leader-follower" model, and a linear programming associated with convex optimization method is used to deal with the problem. After an unknown-but-bounded model for sensor noise is assumed, bearing and range measurements can be modeled as linear constraints on the configuration space of the AUVs. Merging these constraints induces a convex polyhedron representing the set of all configurations consistent with the sensor measurements. Estimates for the uncertainty in the position of a single AUV or the relative positions of two or more nodes can then be obtained by projecting this polyhedron onto appropriate subspaces of the configuration space. Two different optimization algorithms are given to recover the uncertainty region according to the number of the AUVs. Simulation results are presented for a typical localization example of the AUV formation. The results show that our positioning method offers a good localization accuracy, although a small number of low-cost sensors are needed for each vehicle, and this validates that it is an economical and practical positioning approach compared with the traditional approach.