椭圆定位的测距算法

针对无线传感器网络定位中传统的三边测距算法,为了降低算法中每个已知节点均具有发射和接收信号能力而造成的高额成本,提出了已知节点单发射多接收的定位模型,并基于该模型提出了椭圆定位算法.该算法通过刻画未知节点距已知节点可能的椭圆运动轨迹,进而运用牛顿迭代法求解所构造的二次轨迹方程组,实现对未知节点的定位.同时,对定位可能出现的错误进行了概率分析,得出错误概率与锚点个数之间的函数关系.实验定位与传统算法相比降低了实验成本,证明了锚点的线性增加会使错误概率指数趋势减少的特征,最后针对该定位错误问题提出了合理的解决方案.     

Distributed efficient localization in swarm robotics using Min–Max and Particle Swarm Optimization

In a wireless sensors network in general, and a swarm of robots in particular, solving the localization problem consists of discovering the sensor’s or robot’s positions without the use of external references, such as the Global Positioning System – GPS. In this problem, the solution is performed based on distance measurements to existing reference nodes also known as anchors. These nodes have knowledge about their respective positions in the environment. Aiming at efficient yet accurate method to approach the localization problem, some bio-inspired algorithms have been explored. In this sense, targeting the accuracy of the final result rather than the efficiency of the computational process, we propose a new localization method based on Min–Max and Particle Swarm Optimization. Generally, the performance results prove the effectiveness of the proposed method for any swarm configuration. Furthermore, its efficiency is demonstrated for high connectivity swarms. Specifically, the proposed method was able to reduce the localization average error by 84%, in the worst case, considering a configuration of 10 anchors and 100 unknown nodes and by almost 100%, in the best case, considering 30 anchors and 200 unknown nodes. This proves that for high connectivity networks or swarms, the proposed method provides almost exact solution to the localization problem, which is a big shift forward in the state-of-the-art methods.     

基于锚节点连通性的移动WSN定位优化算法

为提高传统移动无线传感网络非测距方式定位算法的节点定位精度、降低算法对锚节点密度的要求,提出一种基于网络中锚节点连通性的蒙特卡洛优化定位算法,并分析了其节点定位性能.算法首先引入平均锚节点连通度的概念来评价网络锚节点连通性,然后提出根据节点实时分布情况进行采样区域划分,并实时控制移动锚节点分布,提升网络的整体定位精度.仿真结果表明,相较于传统的移动无线传感网络中基于蒙特卡洛方法的节点定位算法,所提出的算法有效提升了整体的定位精度,并有效降低了算法对于锚节点密度的要求,提升了算法节点定位性能.     

A survey on sensor localization

Localization is one of the fundamental problems in wireless sensor networks (WSNs), since locations of the sensor nodes are critical to both network operations and most application level tasks. Although the GPS based localization schemes can be used to determine node locations within a few meters, the cost of GPS devices and non-availability of GPS signals in confined environments prevent their use in large scale sensor networks. There exists an extensive body of research that aims at obtaining locations as well as spatial relations of nodes in WSNs without requiring specialized hardware and/or employing only a limited number of anchors that are aware of their own locations. In this paper, we present a comprehensive survey on sensor localization in WSNs covering motivations, problem formulations, solution approaches and performance summary. Future research issues will also be discussed.     

A two-objective evolutionary approach based on topological constraints for node localization in wireless sensor networks

To know the location of nodes plays an important role in many current and envisioned wireless sensor network applications. In this framework, we consider the problem of estimating the locations of all the nodes of a network, based on noisy distance measurements for those pairs of nodes in range of each other, and on a small fraction of anchor nodes whose actual positions are known a priori. The methods proposed so far in the literature for tackling this non-convex problem do not generally provide accurate estimates. The difficulty of the localization task is exacerbated by the fact that the network is not generally uniquely localizable when its connectivity is not sufficiently high. In order to alleviate this drawback, we propose a two-objective evolutionary algorithm which takes concurrently into account during the evolutionary process both the localization accuracy and certain topological constraints induced by connectivity considerations. The proposed method is tested with different network configurations and sensor setups, and compared in terms of normalized localization error with another metaheuristic approach, namely SAL, based on simulated annealing. The results show that, in all the experiments, our approach achieves considerable accuracies and significantly outperforms SAL, thus manifesting its effectiveness and stability.     

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.     

无线传感器网络基于凸规划的改进定位算法： convex—PIT

定位技术是无线传感器网络的关键技术之一,为了提高无线传感器网络的定位精度,在Convex算法基础上提出了Convex-PIT算法.Convex-PIT算法通过引入锚节点构成的三角形进一步滤掉节点不可能存在的区域,缩小节点可能存在范围,提高定位精度.Convex-PIT算法增加了判断未知节点是否在锚节点组成的三角形内的计算量,但不需要增加节点的硬件条件和额外的功能.仿真结果表明,和Convex算法相比,Convex-PIT可以明显的提高定位精度,在锚节点的比例从10%增加到30%的过程中,定位精度提高幅度平均约15%.     

无线传感器网络节点OSFL-TLBO定位算法

定位技术对于无线传感器的应用是至关重要的,没有位置坐标的传感器节点信息是没有意义的。针对非测距的DV-Hop算法定位精度不高的问题,提出了一种新的基于反向蛙跳-教学优化(OSFL-TLBO)定位算法,以改进DV-Hop用平均跳距来代替欧式距离时的累积误差问题和利用最小二乘法求解非线性方程时对初值敏感,受测量误差影响较大的问题。把无线传感器网络节点的定位问题转化为求解最优解的问题。仿真结果表明,所提算法的定位准确度提高大约10%~25%,有效的提高了定位精度。     

非合作信标条件下水下无线传感网可靠定位技术

传统假设水下无线传感器网络的传感器节点和信标节点都是合作的,但是在军事应用等特殊场合下,某些节点容易被敌方捕获或入侵,因而水下无线传感网络中有时会存在一些非合作的恶意节点。针对存在若干非合作信标的水下无线传感器网络定位应用,提出了一种非合作信标节点约束下水下无线传器网的可靠节点定位算法。本文算法利用一跳邻居范围内信标节点独自投票机制实现对非合作信标的判决与剔除,从而减少由于存在非合作信标节点对定位误差的影响,同时也分析了不同比例非合作信标下的定位误差界限。仿真结果验证了本文提出的算法相比传统定位算法,在平均定位精度和定位覆盖率等方面都有所提高。     

DRFL 一种分布式的无线传感网的非测距定位算法

本文提出了一种分布式的非测距算法(DRFL), 该算法不需要测量节点间的距离,只需锚节点广播它们的信标信息,盲节点接收并存储监听到的信标信息,并根据这些信息估计自身节点位置. 与现有的非测距算法相比,DRFL算法的通信开销比较小,且其定位的性能与网络连接度(network connectivity)无关.在ANR=8,DOI=0,16个锚节点统一布置在仿真区域的情况下,DRFL算法的定位误差小于盲节点通信半径的8%,且消除了APIT算法中的"Undetermined Nodes"问题.     

On the design of a novel two-objective harmony search approach for distance- and connectivity-based localization in wireless sensor networks

In several wireless sensor network applications the availability of accurate nodes' location information is essential to make collected data meaningful. In this context, estimating the positions of all unknown-located nodes of the network based on noisy distance-related measurements (usually referred to as localization) generally embodies a non-convex optimization problem, which is further exacerbated by the fact that the network may not be uniquely localizable, especially when its connectivity degree is not sufficiently high. In order to efficiently tackle this problem, we propose a novel two-objective localization approach based on the combination of the harmony search (HS) algorithm and a local search procedure. Moreover, some connectivity-based geometrical constraints are defined and exploited to limit the areas in which sensor nodes can be located. The proposed method is tested with different network configurations and compared, in terms of normalized localization error and three multi-objective quality indicators, with a state-of-the-art metaheuristic localization scheme based on the Pareto archived evolution strategy (PAES). The results show that the proposed approach achieves considerable accuracies and, in the majority of the scenarios, outperforms PAES.     

基于RSSI测距的信标节点自校正定位算法

节点定位是无线传感器网络中的重要应用之一.为了有效抑制各种因素对无线传感器节点定位精度的影响,以三边定位算法为基础,提出了一种基于误差校正的定位算法.该算法通过测量信标节点之间的距离,获得信标节点RSSI值测量误差和网络的定位误差,并对误差进行补偿,从而提高整个网络的定位精度.实验结果显示,该算法能明显提高定位精度和稳定性,具有普遍应用意义.     

面向无线传感器网络节点定位的移动锚节点路径规划

节点定位是无线传感器网络技术研究的一个基本问题,大多数无线传感器网络的应用和中间件技术都需要节点的位置信息.目前比较实用的定位方法是利用一些移动锚节点(如安装有GPS)根据有效的规划路径移动,通过发送包含其自身坐标的信息来定位其他节点,该方法不过多地增加无线传感器网络成本,还可以获得较高的定位精度.在该方法中,移动锚节点的路径规划问题是需要解决的基本问题.主要研究移动锚节点的路径规划问题,把图论引入到无线传感器网络节点定位系统.把无线传感器网络看成一个连通的节点无向图,路径规划问题转化为图的生成树及遍历问题,提出了宽度优先和回溯式贪婪算法.仿真实验和真实系统实验结果表明,该方法能够很好地适应无线传感器网络节点随机分布的节点定位,可以取得较高的定位精度.     

A cellular learning automata-based deployment strategy for mobile wireless sensor networks

One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown network area so that the covered section of the area is maximized. In a mobile sensor network, this problem can be addressed by first deploying sensor nodes randomly in some initial positions within the area of the network, and then letting sensor nodes to move around and find their best positions according to the positions of their neighboring nodes. The problem becomes more complicated if sensor nodes have no information about their positions or even their relative distances to each other. In this paper, we propose a cellular learning automata-based deployment strategy which guides the movements of sensor nodes within the area of the network without any sensor to know its position or its relative distance to other sensors. In the proposed algorithm, the learning automaton in each node in cooperation with the learning automata in the neighboring nodes controls the movements of the node in order to attain high coverage. Experimental results have shown that in noise-free environments, the proposed algorithm can compete with the existing algorithms such as PF, DSSA, IDCA, and VEC in terms of network coverage. It has also been shown that in noisy environments, where utilized location estimation techniques such as GPS-based devices and localization algorithms experience inaccuracies in their measurements, or the movements of sensor nodes are not perfect and follow a probabilistic motion model, the proposed algorithm outperforms the existing algorithms in terms of network coverage.     

A holistic approach to decentralized structural damage localization using wireless sensor networks

Wireless sensor networks (WSNs) have become an increasingly compelling platform for Structural Health Monitoring (SHM) applications, since they can be installed relatively inexpensively onto existing infrastructure. Existing approaches to SHM in WSNs typically address computing system issues or structural engineering techniques, but not both in conjunction. In this paper, we propose a holistic approach to SHM that integrates a decentralized computing architecture with the Damage Localization Assurance Criterion algorithm. In contrast to centralized approaches that require transporting large amounts of sensor data to a base station, our system pushes the execution of portions of the damage localization algorithm onto the sensor nodes, reducing communication costs by two orders of magnitude in exchange for moderate additional processing on each sensor. We present a prototype implementation of this system built using the TinyOS operating system running on the Intel Imote2 sensor network platform. Experiments conducted using two different physical structures demonstrate our system’s ability to accurately localize structural damage. We also demonstrate that our decentralized approach reduces latency by 65.5% and energy consumption by 64.0% compared to a typical centralized solution.     

动态可靠信标结点无线传感器网络定位算法

在无线传感器网络中,距离无关定位技术得到了人们广泛的关注.在有洞的各向异性网络中,为提高普通结点到信标结点之间距离估计的准确性,提出一种距离无关的动态可靠信标结点定位算法.该算法以不同信标结点对之间最短路径上平均单跳距离差异为基础,得到普通结点的直接可靠参考信标结点集和间接可靠参考信标结点集.然后,从可靠参考信标结点集中选择参考结点对普通结点进行定位.仿真结果表明,与以前算法相比,新算法能降低定位误差.     

无线传感器网络节点的协作式定位

无线传感器网络是当前的一个热门研究领域,本文分析了传感器网络节点的协作式定位方法,即充分利用网络内所有的节点来进行定位,有利于节省节点能量,延长系统寿命。大量的仿真实验显示:协作式定位方法能有效的对传感器网络节点进行定位。     

Wireless sensor network minimum beacon set selection algorithm based on tree model

Wireless sensor networks (WSNs) are highly attractive both in academia and in practice as a wholly new platform for information transmission. Localization technology is a key technology of WSNs. The structure of the beacon node set is very important to the positioning of the nodes. A method for constructing a minimum beacon set is proposed in this thesis based on the tree model, in which unimportant nodes are identified as early as possible and then pruned. Thus, we avoid unnecessary calculations when establishing the minimum beacon set. This method can provide a reliable guarantee for the unknown node localization. According to our experiment, this algorithm is rapid and stable.

     

A novel heuristic approach for distance- and connectivity-based multihop node localization in wireless sensor networks

The availability of accurate location information of constituent nodes becomes essential in many applications of wireless sensor networks. In this context, we focus on anchor-based networks where the position of some few nodes are assumed to be fixed and known a priori, whereas the location of all other nodes is to be estimated based on noisy pairwise distance measurements. This localization task embodies a non-convex optimization problem which gets even more involved by the fact that the network may not be uniquely localizable, especially when its connectivity is not sufficiently high. To efficiently tackle this problem, we present a novel soft computing approach based on a hybridization of the Harmony Search (HS) algorithm with a local search procedure that iteratively alleviates the aforementioned non-uniqueness of sparse network deployments. Furthermore, the areas in which sensor nodes can be located are limited by means of connectivity-based geometrical constraints. Extensive simulation results show that the proposed approach outperforms previously published soft computing localization techniques in most of the simulated topologies. In particular, to assess the effectiveness of the technique, we compare its performance, in terms of Normalized Localization Error (NLE), to that of Simulated Annealing (SA)-based and Particle Swarm Optimization (PSO)-based techniques, as well as a naive implementation of a Genetic Algorithm (GA) incorporating the same local search procedure here proposed. Non-parametric hypothesis tests are also used so as to shed light on the statistical significance of the obtained results.     

无线传感器网络分布式的移动节点定位研究

针对WSN野外二维特定应用环境,提出了一种到主信标节点信号强度差定位算法（SSDLB）与运动预测定位算法（MPL）相结合的基于分布式的高覆盖率移动WSN节点定位算法,解决了在定位过程中未知节点在某定位时刻其邻居信标节点的个数小于3个的定位问题,并且避免了传统RSSI定位算法把信号强度值转化成距离再进行定位所带来的计算误差与计算开销,一定程度上提高了节点定位精度和覆盖率。仿真实验表明：此算法在较低的信标节点密度的条件下,能够达到较高的定位精度和定位覆盖率,与传统的RSSI算法相比定位性能有显著的提高。