3D-RABLC：一种基于LQI置信度的三维空间定位求精算法

提出一种基于LQI置信度的三维空间定位求精算法(3D-RABLC)。通过大量节点实验,获得节点间一跳RSSI值与距离的关系、LQI与分组错误率的关系,依此划分LQI置信度,对测得的RSSI值进行过滤,建立三维多跳求精模型或弥补求精方法对置信度低的RSSI值进行修正。节点实验表明,该算法大大降低了RSSI测距误差,比已有三维定位算法具有更好的定位精度。     

基于平均跳距修正的无线传感器网络节点迭代定位算法

针对无需测距DV-Hop定位算法存在较大定位误差的问题,从3个方面对其进行了改进:采用最小二乘法准则校正了信标节点间的平均每跳距离;基于对多信标节点平均每跳距离的加权处理修正了用于位置估计的平均每跳距离;通过设定定位精度门限,给出了对估计的定位节点坐标进行迭代求精的数值方法.给出了改进定位算法的实现流程,并对算法的性能进行了仿真研究.仿真结果表明,在适当增加节点计算量和通信开销的条件下,改进算法的定位精度和精度稳定性有明显改善,是一种可行的无线传感器网络节点定位的解决方案.     

基于支持向量回归的无线传感器网络定位算法

针对一些增量定位中误差容易累积和集中式算法通信开销较大问题,提出了一种基于支持向量回归的半集中式定位算法,中心节点收集锚节点位置和网络连通信息作为训练样本,使用支持向量回归技术得到连通信息到节点位置的映射函数,分发到普通节点后即可使用此函数完成自身定位.为增加训练样本,对邻居锚节点达到3个的普通节点,使用基于RSSI测距的最小二乘法进行定位,升级为锚节点.分析和仿真表明,算法减少了通信开销,减轻了测距误差影响,并获取了较高的定位精度.     

基于最小均方误差选择参考节点的RSS测距定位算法

无线传感网中的多类应用均需要准确的定位算法.为了降低定位成本,减少能量消耗,常采用基于接收信号强度RSS(Received Signal Strength)测距,并建立相应的方程,再利用线性最小二乘LLS(Linear Least Squares)法求解节点的位置,将此定位算法记为RSS+LLS算法.RSS+LLS算法随机选择参考节点,这有损定位精度,同时,LLS算法并没有考虑每个测距值的误差,这些不足降低算法的定位性能.为此,提出基于RSS+LLS的优化算法,记为RSS+WLS+OPT算法.该算法先通过RSS测距,并基于最小均方误差原则选择参考节点,从而提高定位精度,同时,给每个测距值引入权重系数,采用基于协方差矩阵的加权最小二乘法WLS(Weighted Least Squares)求解节点位置,进而降低了测量误差对定位精度的影响.仿真结果表明,与RSS+ LLS相比,提出的RSS+WLS+OPT算法的定位精度提高了约2米,并没有增加计算时间,降低对测距误差的敏感性.     

基于RSSI的无线传感器网络距离修正定位算法

节点自身定位是无线传感器网络目标定位的基础。无线传感器网络节点定位算法包括基于距离和距离无关两类。其中基于RSSI的定位算法由于实现简单而被广泛使用,但RSSI方法的测距误差较大,从而影响了节点定位精度。提出了一种基于RSSI的无线传感器网络距离修正定位算法。该算法通过RSSI测距,计算近似质心的位置,以此为参考点进行距离修正,然后确定节点的位置。仿真结果表明该算法可以提高节点定位精度。     

传感器网络的粒子群优化定位算法

无线传感器网络定位问题是一个基于不同距离或路径测量值的优化问题。由于传统的节点定位算法采用最小二乘法求解非线性方程组时很容易受到测距误差的影响,为了提高节点的定位精度,将粒子群优化算法引入到传感器网络定位中,提出了一种传感器网络的粒子群优化定位算法。该算法利用未知节点接收到的锚节点的距离信息,通过迭代方法搜索未知节点位置。仿真结果表明,该算法有效地抑制了测距误差累积对定位精度的影响,提高了节点的定位精度。     

基于RSSI测距和距离几何约束的节点定位算法

节点定位是无线传感器网络的基础问题之一,基于RSSI测距技术被广泛应用到节点定位中。由于RSSI测距受到环境影响而产生测距误差,进而影响节点定位的精度。本文利用距离几何约束来减小RSSI测距误差,并结合三角形质心定位算法。仿真结果表明该算法比基于RSSI三角质心定位算法的定位精度有较大提高。     

无线传感器网络基于APIT的混合定位算法

为了克服定位算法近似三角形内点测试法(approximate point-in-triangulation teat,APIT)的误差影响,将接收信号强度指示器(received signal strength indicator,RSSI)测距与APIT相结合,提出了APIT算法的改进算法-RAPIT(RSSI and APIT)定位算法.该算法引入限定距离的概念,将引起误差的节点的位置限定在以锚节点为圆心,以限定距离为半径的圆的重叠区域内.实验证明,该算法有效减少了误差,提高了定位覆盖度.     

基于LS-Kalman的无线传感器算法研究

常用的定位算法用于无线传感器定位时的性能很不稳定且误差很大,为此提出一种更高精度的定位算法。该算法前期使用基于非测距的DV-HOP算法进行初始定位,后期用改进的最小二乘-卡尔曼滤波(LS-Kalman)对初始定位进行循环求精。本文采用MATLAB仿真软件分别对二维和三维无线传感器网络节点进行实验,实验结果表明该算法三维定位收敛更快,定位精度更高,且算法更简单。     

基于RSSI高斯滤波的LSSVR无线传感网络定位算法

为了降低基于接收信号强度指示(RSSI)测距误差对节点定位的影响,解决RSSI测距定位误差较大的问题,提出基于RSSI高斯滤波的最小二乘支持向量回归机LSSVR定位算法(LSSVR-GF-RSSI)。LSSVR-GF-RSSI算法先利用高斯函数滤除误差较大的RSSI值,筛选出较准确的RSSI值,再依据这些值计算未知节点离锚节点间的距离。将这些距离作为LSSVR的输入,建立基于RSSI测距的LSSVR定位算法模型,最终,估计未知节点的位置。仿真结果表明,提出的LSSVR-GF-RSSI算法能够有效地降低均方定位误差,比传统的基于RSSI的LSSVR定位算法减少了约12%~20%。     

一种基于迭代聚类的无线传感器网络定位算法

In wireless sensor networks, node localization is a fundamental middleware service. In this paper, a robust and accurate localization algorithm is proposed, which uses a novel iterative clustering model to obtain the most representative intersection points between every two circles and use them to estimate the position of unknown nodes. Simulation results demonstrate that the proposed algorithm outperforms other localization schemes (such as Min-Max, etc.) in accuracy, scalability and gross error tolerance.     

Local Patches Alignment Embedding Based Localization for Wireless Sensor Networks

Localization for wireless sensor networks (WSNs) is a challenging research topic. Let the set of sensor nodes that are close to each other be a “patch”, in this paper, we propose a new manifold learning method named local patches alignment embedding (LPAE), and then present a computationally efficient range-based WSNs localization approach using LPAE. Unlike the existing range-based localization methods using “patching” techniques, LPAE approach has the following features: 1) learning local position of all sensor nodes efficiently on a set of overlapping patches, which are constructed based on anchor nodes, rather than on neighborhood of each node, 2) aligning patches with the constraints of anchor nodes thus avoiding the accumulation of error, and 3) obtaining absolute positions of all sensor nodes directly without any other refinement technology. The proposed approach has been shown to be able to achieve satisfactory performance on both accuracy and efficiency via extensive simulations.     

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.     

基于连通度和加权校正的移动节点定位算法

移动节点定位问题是无线传感器网络中的研究重点。针对移动节点定位误差大的问题,提出一种基于连通度和加权校正的移动节点定位算法。在未知节点移动过程中,根据节点间连通度大小选取参与定位的信标节点,利用加权校正方法修正RSSI测距信息,然后用最小二乘法对未知节点进行位置估计。仿真分析表明,节点通信半径和信标密度在一定范围内,该算法表现出良好的定位性能,定位精度明显提升。     

Reference node placement and selection algorithm based on trilateration for indoor sensor networks

The key problem of location service in indoor sensor networks is to quickly and precisely acquire the position information of mobile nodes. Due to resource limitation of the sensor nodes, some of the traditional positioning algorithms, such as two‐phase positioning (TPP) algorithm, are too complicated to be implemented and they cannot provide the real‐time localization of the mobile node. We analyze the localization error, which is produced when one tries to estimate the mobile node using trilateration method in the localization process. We draw the conclusion that the localization error is the least when three reference nodes form an equilateral triangle. Therefore, we improve the TPP algorithm and propose reference node selection algorithm based on trilateration (RNST), which can provide real‐time localization service for the mobile nodes. Our proposed algorithm is verified by the simulation experiment. Based on the analysis of the acquired data and comparison with that of the TPP algorithm, we conclude that our algorithm can meet real‐time localization requirement of the mobile nodes in an indoor environment, and make the localization error less than that of the traditional algorithm; therefore our proposed algorithm can effectively solve the real‐time localization problem of the mobile nodes in indoor sensor networks. Copyright © 2008 John Wiley & Sons, Ltd.     

Concentric Distributed Localization Based on the Tripodal Anchor Structure and Grid Scan for Wireless Sensor Networks

Achieving high accuracy with minimum reference nodes, anchor nodes, and computation and communication costs is a goal for the localization in wireless sensor networks. Targeting at this goal, a localization scheme called concentric distributed localization with the tripodal anchor structure and grid scan (CDL-TAGS) requiring two reference nodes and a few anchor nodes is proposed in this paper. Under the precondition that the system has randomly distributed normal sensor nodes, a tripodal anchor structure is first designed. With this structure, the localization process is started from the centroid node and then stretched outward to the farthest normal nodes. Based on the two best reference nodes, a virtual point is generated to serve as the third reference node. In the CDL-TAGS scheme, a grid scan algorithm is employed to estimate the position of a normal node. Finally, we show that the communication overhead and time and space complexities among sensor nodes for CDL-TAGS can be kept at a low level. In addition, CDL-TAGS can achieve better accuracy with minimum anchor nodes as compared to some closely related localization schemes in the literature through simulation results.     

一种基于误差距离加权与跳段算法选择的遗传优化DV-Hop定位算法

针对Distance Vector-Hop (DV-Hop) 定位算法存在较大定位误差的问题,该文提出了一种基于误差距离加权与跳段算法选择的遗传优化DV-Hop定位算法,即WSGDV-Hop定位算法。改进算法用基于误差与距离的权值处理锚节点的平均每跳距离;根据判断的位置关系选择适合的跳段距离计算方法;用改进的遗传算法优化未知节点坐标。仿真结果表明,WSGDV-Hop定位算法的性能明显优于Distance Vector-Hop (DV-Hop) 定位算法,减小了节点定位误差、提高了算法定位精度。     

基于边框定界的WSN分布式全搜索定位算法

提出一种基于边框定界的WSN分布式全搜索定位算法。该算法通过节点测距得到邻居节点的坐标和距离信息,然后通过边框定界方法确定节点存在的位置区域,最后将位置区域网格化,并用全搜索方法在该区域搜索最佳估计点,最佳估计点的坐标即为节点的定位坐标。该算法应用到网络时需运行多轮,通过逐步求精得到节点的定位坐标。仿真实验表明该算法达到当前其他复杂定位算法的性能。     

Computational intelligence based localization of moving target nodes using single anchor node in wireless sensor networks

Wireless Sensor Networks (WSNs) have tremendous ability to interact and collect data from the physical world. The main challenges for WSNs regarding performance are data computation, prolong lifetime, routing, task scheduling, security, deployment and localization. In recent years, many Computational Intelligence (CI) based solutions for above mentioned challenges have been proposed to accomplish the desired level of performance in WSNs. Application of CI provides independent and robust solutions to ascertain accurate node position (2D/3D) with minimum hardware requirement (position finding device, i.e., GPS enabled device). The localization of static target nodes can be determined more accurately. However, in the case of moving target nodes, accurate position of each node in network is a challenging problem. In this paper, a novel concept of projecting virtual anchor nodes for localizing the moving target node is proposed using applications of Particle Swarm Intelligence, H-Best Particle Swarm Optimization, Biogeography Based Optimization and Firefly Algorithm separately. The proposed algorithms are implemented for range-based, distributed, non-collaborative and isotropic WSNs. Only single anchor node is used as a reference node to localize the moving target node in the network. Once a moving target node comes under the range of a anchor node, six virtual anchor nodes with same range are projected in a circle around the anchor node and two virtual anchor nodes (minimum three anchor nodes are required for 2D position) in surrounding (anchor and respective moving target node) are selected to find the 2D position. The performance based results on experimental mobile sensor network data demonstrate the effectiveness of the proposed algorithms by comparing the performance in terms of the number of nodes localized, localization accuracy and scalability. In proposed algorithms, problem of Line of Sight is minimized due to projection of virtual anchor nodes.     

LIP: an efficient lightweight iterative positioning algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are increasingly being used in remote environment monitoring, security surveillance, military applications, and health monitoring systems among many other applications. Designing efficient localization techniques have been a major obstacle towards the deployment of WSN for these applications. In this paper, we present a novel lightweight iterative positioning (LIP) algorithm for next generation of wireless sensor networks, where we propose to resolve the localization problem through the following two phases: (1) initial position estimation and (2) iterative refinement. In the initial position estimation phase, instead of flooding the network with beacon messages, we propose to limit the propagation of the messages by using a random time-to-live for the majority of the beacon nodes. In the second phase of the algorithm, the nodes select random waiting periods for correcting their position estimates based on the information received from neighbouring nodes. We propose the use of Weighted Moving Average when the nodes have received multiple position corrections from a neighbouring node in order to emphasize the corrections with a high confidence. In addition, in the refinement phase, the algorithm employs low duty-cycling for the nodes that have low confidence in their position estimates, with the goal of reducing their impact on localization of neighbouring nodes and preserving their energy. Our simulation results indicate that LIP is not only scalable, but it is also capable of providing localization accuracy comparable to the Robust Positioning Algorithm, while significantly reducing the number of messages exchanged, and achieving energy savings.