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

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

基于延迟锁相环的到达时间估计算法

超宽带脉冲信号具有高时间分辨能力,能达到厘米级的定位精度。目前,脉冲超宽带测距定位系统中普遍采用基于能量检测的非相关到达时间(TOA)估计算法的性能通常受限于阈值门限和估计偏差。该文在原先锁相环方案基础之上引入延时迟支路和衰减因子,提出了一种易于实现的基于延迟锁相环的TOA估计算法。通过在迟支路中设置不同的衰减因子,仿真结果表明,在IEEE802.15.4a4种信道模型CM1~CM4中,新算法均能有效提升测距定位精度,即缩短了首达路径与锁相环稳态锁定点之间的时差,其估计偏差最低可降至原有方案的1/10。     

基于临近锚节点修正的DBSCAN聚类加权定位算法

为了提高无线传感器网络节点的定位精确度,给出一种基于临近锚节点修正(CAAN)的具有噪声的基于密度的聚类(DBSCAN)加权定位算法。首先,在未知节点通信范围内的锚节点中选择三个构成三角形,证明当未知节点处在此三角形外接圆圆心位置时定位误差最小,然后据此选择合适的锚节点,结合滤波后的接收信号强度指示(RSSI)值进行定位计算,并利用DBSCAN聚类算法剔除误差较大的值。其次,把聚类后所得簇的核心点个数当作权值,采用加权定位算法得到未知节点的初始坐标。最后,计算锚节点坐标与初始坐标间的距离,选择临近的锚节点修正初始坐标,使最终的定位结果更加精确。仿真结果表明：相比于加权质心定位算法和基于RSSI测距滤波优化的加权质心定位算法,所给算法的定位精确度分别提高了69.55%和38.64%。     

Timing-Based Mobile Sensor Localization in Wireless Sensor and Actor Networks

In this paper, localization problem in wireless sensor and actor networks (WSAN) is addressed. In WSAN, the performance of event detection and tracking highly depends on the exact location information of the events that must be reported along with the event features. Having precise location information of the sensor nodes, actors are able to execute actions more effectively in the region of detected events. In this context, the accurate localization of sensor nodes is essential with respect to the actors. Particularly, the problem becomes much more complicated when the sensor nodes as well as the anchor nodes (actors) are mobile. In order to localize the mobile sensor nodes relative to the actors, a novel Timing-based Mobile Sensor Localization (TMSL) algorithm is introduced. In TMSL, sensor nodes determine their distance from actors by using propagation time and speed of RF signal. In order to determine distance from the actors, actors actively broadcast reference beacons in a pattern of intervals adaptively defined according to the mobility of sensor nodes and the required level of localization accuracy. These reference beacons carry the interval numbers in which they were transmitted. The interval numbers are then used by the sensor nodes to calculate the start time of the beacons locally which is then used to determine the propagation time. TMSL does neither require nor assume any time synchronization among the sensor nodes or with the actors. Performance evaluations clearly show that TMSL is adaptive to velocity of mobile sensor and actor nodes and can be configured according to the required localization accuracy in order to avoid overhead raised due to high velocity.     

RSS协助的ray-tracing室内定位算法

针对室内定位,当信号受到非视距(non-line-of-sight, NLOS)和多径传播的影响时,本文提出一种接收信号强度(Received Signal Strength, RSS)协助的Ray-tracing室内定位算法,改进已经提出的基于虚拟基站方法的信号到达时间 (Time of Arrival, TOA)和信号到达角度(Direction of Arrival, DOA)室内无线信号Ray-tracing模型,利用信号RSS测量值优化算法,实现TOA、DOA和RSS协同定位,提高室内多径及非视距环境下,无线定位的精度,降低算法复杂度,提高算法处理信号多重散射的能力并降低了对基站的依赖性适用环境更为广泛。首先通过RSS得到信号源可能存在的位置,随后利用Ray-tracing原理并使用虚拟基站,将非视距路径定位问题转化为视距路径定位问题,利用TOA和DOA对直射、透射、反射和绕射情况进行分析建模,最后使用最小二乘法对可能的位置进行筛选,得到信号源的最终位置。仿真结果表明,本算法较改进前拥有更高的定位精度。      

基于像素距离加权的室内成像定位研究

针对室内成像定位技术受随机噪声的影响较大、定位误差较高的问题,提出了一种基于像素距离加权的室内成像定位技术。在室内屋顶布设多个红外LED,依靠成像传感器获得红外LED信标的像点,将成像点到成像传感器中心的像素距离作为加权因子引入室内成像定位算法中,可以有效地提高室内定位精度。并进行了仿真实验,实验选择4m×4m×3m的空间区域模拟室内环境,当布设的红外LED信标数量为3时,应用改进后的算法可以获得10cm以内的定位误差性能,并且误差波动不超过5cm。另外,随着布设信标数量的增加,定位误差继续减小。改进后的定位算法有效地提高了室内定位的精度以及成像定位算法的普适性。     

非视距环境下基于RSS-TOA的定位算法

在无线传感器网络定位系统中,尤其是在室内定位中,非视距（NLOS）误差的存在使定位性能急剧下降。为克服非视距传播带来的定位误差,提出了一种针对非视距环境下联合接收信号强度（RSS）和到达时间（TOA）的定位算法。该方法首先通过 RSS和 TOA的测量结果建立关于目标位置的非凸优化问题,然后通过二阶锥松弛理论,将原始的非凸优化问题转换为一种凸优化问题,由此能够快速得到原问题的一个次优解。通过计算机模拟仿真验证,新方法的估计精度更高,性能更好。     

无线传感器网络混合定位技术研究

在大规模复杂无线传感器网络中往往采用多种节点定位技术,在此结合现有无线传感器定位技术的现状,提出了一种混合定位技术以实现不同定位方法之间的互补。一方面利用RSSI定位弥补TDOA定位覆盖范围小的缺点;另一方面将测距信息引入到非测距定位DV—Hop算法中,用RSSI测距模型来提高DV-Hop算法中定位节点与信标节点间有效距离的精度。实验结果表明,该混合定位技术实现了TDOA,RSSI以及DV-HOP等定位技术的融合,有效地提高了复杂大规模无线传感器网络的节点定位精度。     

无源测向测时差定位算法研究

该文首先给出了无源测向测时差定位算法,然后对该算法的定位精度进行了分析。通过仿真将该方法与无源测向交叉法和时差法进行了比较,说明该方法是一种定位精度较高且对系统要求较低的无源定位方法,具有实用价值。     

时间反演联合TOA测距的室内指纹定位技术

在室内指纹定位中,室内环境会影响以接收信号强度指标(Received Signal Strength Indicator, RSSI)或信道状态信息(Channel State Information, CSI)的指纹数据,使得采集指纹数据构建的数据库具有不稳定性和不可靠性的特点,从而影响定位准确率和精度。基于此,本文提出了时间反演(Time Reversal, TR)联合到达时间(Time Of Arrival, TOA)测距的指纹定位技术。首先在定位区域建立坐标系,离线阶段采集两个已知参考点至网格点的距离作为指纹构建数据库,以坐标距离作为指纹可以忽略环境对指纹数据的影响,进而提高定位准确率;其次,在线阶段通过TR技术的空时聚焦性联合TOA,测出距离作为新指纹,与距离指纹进行对比匹配,根据相似度得出目标点的位置坐标。最后通过仿真结果得出:本方案实现了6 m的室内定位,并且定位误差在0.44 m以内,对比传统指纹定位,减小了指纹数据复杂度,提高了系统的鲁棒性和定位精度。      

基于DV-Hop的RSSI-Hop算法

在无线传感器网络中,监测到时间之后关心的一个重要问题就是该事件发生的位置。传感器节点能量有限、可靠性差、节点规模大且随机布放、无线模块通信距离有限,对定位算法和定位技术提出了很高的要求。针对随机布放、节点配置低的无线传感器网络,提出一种新的RSSI-Hop定位方法,该方法可以在不增加硬件开销的基础上,有效降低节点能量消耗,较准确地估算未知节点到参考节点之间的距离,减少累积误差,提高定位的准确性。其主要思想是,节点信息根据RSSI强弱,估算各节点到信标节点之间的距离。实验表明,新算法比以前的算法定位更准确。     

基于EKF的无线传感器网络移动信标定位算法

针对无线传感器网络节点定位精度较低的问题,提出一种基于扩展卡尔曼滤波的移动信标节点定位算法。该算法采用等距三重优化覆盖思想确定虚拟信标分布,利用蚁群算法获取最优遍历路径,同时引入扩展卡尔曼滤波算法以提高节点定位精度。通过对节点通信半径、虚拟信标数目、路径长度、迭代次数等参数分别进行仿真验证,结果表明本文算法定位精度明显优于普通质心定位算法,同时该算法在提高网络覆盖度、降低网络成本等方面也有较大优势。     

传感网络中基于移动信标的网格扫描定位算法

节点定位是传感网络最基本的技术之一,对此提出一种基于移动信标的网格扫描定位算法(Mobile Beacon Grid-Scan,MBGS)。该算法在网格扫描定位算法基础上,利用一个移动信标巡航整个传感区域,产生大量的虚拟信标,提高网络信标覆盖率,然后普通节点利用这些信标信息减小其可能区域(Estimative Rectangle,ER),并把新可能区域网格坐标质心作为其最新估计坐标。仿真结果表明,与Bounding Box、质心定位算法以及传统的网格扫描定位算法相比,MBGS定位方法的定位精度更高,算法性能更加稳定。     

Ranging error‐tolerable localization in wireless sensor networks with inaccurately positioned anchor nodes

Localization is essential for wireless sensor networks (WSNs). It is to determine the positions of sensor nodes based on incomplete mutual distance measurements. In this paper, to measure the accuracy of localization algorithms, a ranging error model for time of arrival (TOA) estimation is given, and the Cramer—Rao Bound (CRB) for the model is derived. Then an algorithm is proposed to deal with the case where (1) ranging error accumulation exists, and (2) some anchor nodes broadcast inaccurate/wrong location information. Specifically, we first present a ranging error‐tolerable topology reconstruction method without knowledge of anchor node locations. Then we propose a method to detect anchor nodes whose location information is inaccurate/wrong. Simulations demonstrate the effectiveness of our algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

Beacon deployment strategy for guaranteed localization in wireless sensor networks

In wireless sensor networks, beacons are always treated as infrastructures for localization. After beacons are deployed, non-beacon nodes can be located by simple schemes such as multilateration and multidimensional scaling (MDS). Deploying as many beacons as needed is an efficient way to improve localization accuracy where a global positioning system does not work well or a higher location accuracy is required. With more beacons to be deployed, the configuration of beacons’ positions will have to be done manually. Therefore position auto-configuration using measured distances between these beacons can save a lot of efforts for the deployment. One challenge of this auto-configuration is that the positions should be uniquely determined based on the measured distances. In graph theory, it is a problem of unique realization in which the positions of vertices are determined by edges between them. Addressing this problem is one major aspect of this paper. To determine whether the topology of a network is a unique realization, this paper proposes a novel category of topology named Uniquely Determined Topology, with which edges in a d-dimensional space can be reduced from \(d+1\) to d in each extension, which is less strict and more suitable for beacon deployment. The other aspect of this paper is to improve localization accuracy of the deployed beacons. In MDS and curvilinear component analysis, a shortest-path algorithm is adopted to approximately reconstruct the distance matrix between each two nodes, and our proposed Uniquely Determined Topology has a feature that a distance calculation model can be adopted to replace the shortest-path algorithm, therefore that the local distance matrix can be reconstructed more accurately. Theoretical analysis shows that it has a low computational complexity to determine whether a deployment is a Uniquely Determined Topology. Simulations show the advantages of the improved localization scheme, in that they do not depend on the connectivity level of the networks, and they can provide accurate localization when the estimation accuracy of distances is high.     

WSNs中基于无人机的强健节点定位算法

通过移动无人机(UAV)收集无线传感网络数据的方案已受到广泛关注,将感测的数据与产生此数据的传感节点位置关联起来是十分必要的。为此提出了基于无人机的强健节点定位算法(UAV-NL)。UAV-NL算法将UAV位置作为未知信息。传感节点接收由UAV在随机位置传输的beacon包,并记录接收信号强度指示(RSSI)矢量;通过理论推导2个RSSI矢量的范数距离与这2节点距离的线性关系;最后,通过RSSI值测距,并利用半定规划(SDP)算法估计节点位置。仿真结果表明,提出的UAV-NL算法即使在噪声信道条件下仍具有高的定位精确度。     

Distributed Energy Optimization for Target Tracking in Wireless Sensor Networks

Energy constraint is an important issue in wireless sensor networks. This paper proposes a distributed energy optimization method for target tracking applications. Sensor nodes are clustered by maximum entropy clustering. Then, the sensing field is divided for parallel sensor deployment optimization. For each cluster, the coverage and energy metrics are calculated by grid exclusion algorithm and Dijkstra's algorithm, respectively. Cluster heads perform parallel particle swarm optimization to maximize the coverage metric and minimize the energy metric. Particle filter is improved by combining the radial basis function network, which constructs the process model. Thus, the target position is predicted by the improved particle filter. Dynamic awakening and optimal sensing scheme are then discussed in dynamic energy management mechanism. A group of sensor nodes which are located in the vicinity of the target will be awakened up and have the opportunity to report their data. The selection of sensor node is optimized considering sensing accuracy and energy consumption. Experimental results verify that energy efficiency of wireless sensor network is enhanced by parallel particle swarm optimization, dynamic awakening approach, and sensor node selection.     

A fast handover protocol for 6LoWPAN wireless mobile sensor networks

Node localization is one of the most critical issues for wireless sensor networks, as many applications depend on the precise location of the sensor nodes. To attain precise location of nodes, an improved distance vector hop (IDV-Hop) algorithm using teaching learning based optimization (TLBO) has been proposed in this paper. In the proposed algorithm, hop sizes of the anchor nodes are modified by adding correction factor. The concept of collinearity is introduced to reduce location errors caused by anchor nodes which are collinear. For better positioning coverage, up-gradation of target nodes to assistant anchor nodes has been used in such a way that those target nodes are upgraded to assistant anchor nodes which have been localized in the first round of localization. For further improvement in localization accuracy, location of target nodes has been formulated as optimization problem and an efficient parameter free optimization technique viz. TLBO has been used. Simulation results show that the proposed algorithm is overall 47, 30 and 22% more accurate than DV-Hop, DV-Hop based on genetic algorithm (GADV-Hop) and IDV-Hop using particle swarm optimization algorithms respectively and achieves high positioning coverage with fast convergence.     

无线传感器网络中基于移动代理的信息驱动的多分辨率算法研究

该文提出了一种适用于无线传感器网络的基于移动代理的信息驱动的多分辨率(MAIDM)算法,以提高目标跟踪过程中数据处理的精度和容错性,并满足无线传感器网络对节能方面的要求。该文在以簇为逻辑结构的无线传感器网络中,移动代理根据各节点信息贡献量的估计,使用多分辨率算法收集、处理节点数据,并根据移动代理迁移路径上节点信息贡献量的最大值,动态决定其携带的数据量,以达到在节省能量的同时,提高跟踪的精度和容错性。仿真验证了MAIDM算法在精度和容错性方面比IDSQ算法有很大的提高,在节省能量方面比MA-CSIP算法更加有效。     

面向自动驾驶的车辆精确实时定位算法

针对车辆自组织网络(VANETs)中的车辆定位问题,以提高定位精度和实时性为目标,该文提出一种面向自动驾驶的车辆精确实时定位算法,包括基于矩阵束(MP)与非线性拟合(NLF)以及基于视觉感知两种技术。基于MP-NLF的技术通过联合TOA/AOA估计进行车辆单站定位,并引入高分辨率估计以提高估计精度;基于视觉感知的技术通过提取定位范围内视觉感知图像的特征信息来完成定位,并结合惯性信息进行无迹卡尔曼滤波进一步提高精度。仿真结果表明,与传统多径指纹算法相比,所提算法即使在低信噪比情况下也具有较好的定位性能。