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

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

移动无线传感器网络采样区域自调整的MCL定位算法

定位技术是无线传感器网络中关键的支撑技术之一。现有的无线传感器网络定位算法大多是针对静态场景的,不能直接应用于移动无线传感器网络。针对移动无线传感器网络的特点,在深入分析现有蒙特卡洛算法的基础上,提出一种改进机制,即采样区域自调整的蒙特卡洛节点定位(SA_MCL)算法。该算法通过对节点历史位置信息插值模拟获得节点的运动速度和方向,目的是为了自动调整采样区域,从而提高定位精度。仿真结果表明,采用SA_MCL算法,节点的定位精度有较大提高。     

结合极大似然距离估计的MDS-MAP节点定位算法

基于多维定标的定位算法通常利用节点间的最短路径长度代替欧式距离构建距离矩阵,当网络拓扑结构不规则时,会导致较大的定位误差。针对这一问题,提出了一种结合极大似然距离估计和多维定标的节点定位算法MDS-MAP（MLE）。算法将待测节点的一跳邻居节点信息作为极大似然方法的输入,利用与邻居节点的距离信息计算待测节点的相对坐标,然后根据已知锚节点的坐标,将所有节点的相对坐标映射为绝对坐标。实验结果表明,针对规则网络和不规则网络,MDS-MAP （MLE）算法均可取得较好的定位精度,且当网络连通度在一定范围内变化时,定位误差可保持在较低的稳定区间内。     

New Distributed Positioning Algorithm Based on Centroid of Circular Belt for Wireless Sensor Networks

This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network.The algorithm is based exclusively on connectivity.First,assuming that the positions of the anchor nodes are already known,a circular belt containing an unknown node is obtained using information about the anchor nodes that are in radio range of the unknown node,based on the geometric relationships and communication constraints among the unknown node and the anchor nodes.Then,the centroid of the circular belt is taken to be the estimated position of the unknown node.Since the algorithm is very simple and since the only communication needed is between the anchor nodes and the unknown node,the communication and computational loads are very small.Furthermore,the algorithm is robust because neither the failure of old unknown nodes nor the addition of new unknown nodes influences the positioning of unknown nodes to be located.A theoretical analysis and simulation results show that the algorithm does not produce any cumulative error and is insensitive to range error,and that a change in the number of sensor nodes does not affect the communication or computational load.These features make this algorithm suitable for all sizes of low-power wireless sensor networks.     

Managing cohort movement of mobile sensors via GPS-free and compass-free node localization

A critical problem in mobile ad hoc wireless sensor networks is each node’s awareness of its position relative to the network. This problem is known as localization. In this paper, we introduce a variant of this problem, directional localization, where each node must be aware of both its position and orientation relative to its neighbors. Directional localization is relevant for applications that require uniform area coverage and coherent movement. Using global positioning systems for localization in large scale sensor networks may be impractical in enclosed spaces, and might not be cost effective. In addition, a set of pre-existing anchors with globally known positions may not always be available. In this context, we propose two distributed algorithms based on directional localization that facilitate the collaborative movement of nodes in a sensor network without the need for global positioning systems, seed nodes or a pre-existing infrastructure such as anchors with known positions. Our first algorithm, GPS-free Directed Localization (GDL) assumes the availability of a simple digital compass on each sensor node. We relax this requirement in our second algorithm termed GPS- and Compass-free Directed Localization (GCDL). Through experimentation, we demonstrate that our algorithms scale well for large numbers of nodes and provide convergent localization over time, despite errors introduced by motion actuators and distance measurements. In addition, we introduce mechanisms to preserve swarm formation during directed sensor network mobility. Our simulations confirm that, in a number of realistic scenarios, our algorithms provide for a mobile sensor network that preserves its formation over time, irrespective of speed and distance traveled. We also present our method to organize the sensor nodes in a polygonal geometric shape of our choice even in noisy environments, and investigate the possible uses of this approach in search-and-rescue type of missions.     

基于事件的移动认知无线传感器网分簇算法

移动认知无线传感网中, 节点的移动特性会导致网络拓扑结构不断变化, 节点的能耗不均衡等问题, 本文提出一种基于事件的移动认知无线传感器网的分簇算法, 来重点解决上述问题. 算法根据通信区域内的预估计停留时间确定了合格节点和备用节点, 通过节点的移动方向、速度、节点在簇中的预估计连接时间等特性, 采用直接分簇的方法来建簇, 提高簇的稳定性, 保证了路由跳数最少. 同mESAC, EACRP和MNB 3个算法进行了仿真实验比较, 验证了本算法有更低的分簇能耗和更好的连通性.     

基于移动信标节点的无线传感器网络定位算法研究

研究了无线传感器网络中的节点定位算法问题,提出了一种新的基于移动信标节点的定位算法。该算法利用一个移动信标节点遍历整个网络,并周期性地广播包含其当前位置信息的分组,当未知节点接收到三个(或以上)与它的距离为通信半径的位置信息分组后,利用三边法计算自身位置。进而,考虑通信半径存在摄动的情况,利用极大似然法替代三边法提高算法的抗干扰能力。最后,通过仿真研究了该算法的特性,并与DV-Hop定位法进行了比较,仿真结果表明该定位方法在定位误差、通信量和网络结构适应性等方面均表现出良好的性能和优越性。     

一种分布式无线传感器网络节点定位新算法

针对无线传感器网络节点自身定位问题，提出一种新的节点定位算法，介绍算法的基本原理和实现方法。算法假设网络中有一定比例的锚节点（位置已知的节点）。通过未知节点和其无线射程范围内的锚节点之阃的通信约束和几何关系，得出该未知节点所处的圆弧区域，将该圆弧区域的质心作为未知节点的估计位置。该算法是一种完全基于网络连通性的无需测距技术的分布式算法，算法设计简单，计算量小。节点间通信开销少。仿真结果显示，该算法适合于各种规模的无线传感器网络的节点定位。     

无线传感器网络中的定位技术研究

传感器网络是综合了传感器、嵌入式计算、网络及无线通信等技术的一种全新信息获取和处理技术。由于许多应用需要精确的定位,因此过去几年无线传感器网络定位技术得到广泛关注。研究了几种典型的定位技术,并根据距离误差、节点密度、anchor节点数量和所需设备等要求对各算法进行了性能分析、比较。最后总结了这些定位技术用于无线传感器网络中存在的问题,并提出了下一步工作的设想,即研究一个公共的三阶段的分布定位算法。     

基于活动区域的移动无线传感器网络路由协议

为了解决移动无线传感器网络中能量效率问题,提出了一种基于活动区域的移动无线传感器网络（WSN）路由协议。本方法使用源和sink节点相对位置来形成路由的活动区域,网络中的移动节点使用睡眠唤醒模式来节约能源。移动向量信息（如当前位置、方向和速度）以及节点的剩余能量,用于选择能够提供最大连接保留时间的邻居,移动向量信息也被用来唤醒活动区域中的移动节点。实验表明,与其他路由协议进行比较,该方法在分组传输过程中具有更高的可靠性。     

一种移动无线视频传感器节点的覆盖算法

在现有的无线传感器网络覆盖算法的研究中,缺乏对移动节点路径规划的研究,而针对具有视频传感器节点的网络仍使用普通传感器圆形覆盖区域的测量方法来计算覆盖面积,并不完全符合实际情况.基于这两方面的原因,本文提出了一种适用于无线视频传感器节点的最大覆盖算法,并提出一种对于视频传感器节点覆盖面积的计量方法.该算法能够使节点在保证网络连通性的前提下,达到最大的有效监测范围.此外,本文建立了相应的仿真实验模型,对该算法的有效性和覆盖面积进行了实验与分析.结果表明,本算法的节点监测面积大约为使用随机运动算法的节点监测面积的1.5倍左右,并可以保证网络的连通性.     

A robust localization algorithm in wireless sensor networks

Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to various kinds of location attacks, whereas secure localization schemes proposed so far are too complex to apply to power constrainedWSNs. This paper provides a distributed robust localization algorithm called Bilateration that employs a unified way to deal with all kinds of location attacks as well as other kinds of information distortion caused by node malfunction or abnormal environmental noise. Bilateration directly calculates two candidate positions for every two heard anchors, and then uses the average of a maximum set of close-by candidate positions as the location estimation. The basic idea behind Bilateration is that candidate positions calculated from reasonable (i.e., error bounded) anchor positions and distance measurements tend to be close to each other, whereas candidate positions calculated from false anchor positions or distance measurements are highly unlikely to be close to each other if false information are not collaborated. By using ilateration instead of classical multilateration to compute location estimation, Bilateration requires much lower computational complexity, yet still retains the same localization accuracy. This paper also evaluates and compares Bilateration with three multilateration-based localization algorithms, and the simulation results show that Bilateration achieves the best comprehensive performance and is more suitable to real wireless sensor networks.     

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.     

基于Steffensen迭代和模糊信息的节点定位算法

为了提高无线传感器网络节点定位精度,提出了一种基于Steffensen迭代和模糊信息的节点定位算法.算法在模糊信息定位方法的基础上,通过引入Steffensen迭代求精提高节点定位精度.算法将锚节点分为静态锚节点和移动锚节点,利用移动锚节点不断的运动来辅助静态锚节点进行定位.首先利用节点间的模糊信息实现未知节点位置的粗略定位,然后利用Steffensen迭代对节点位置进行不断迭代求精,以实现未知节点的精确定位.通过仿真实验证明,相比3D-ADAL算法和改进的TOF测距算法,本文算法不仅降低了定位误差率,减小了网络的通信开销,还提高了节点定位效率.     

一种改进的无线传感器网络非测距定位算法

节点定位是实现传感器网络应用的前提,控制节点定位误差成为保证网络正常运行的关键。采用基于测距的定位算法,可以达到良好的精度,但需要测量装置,不适合能量受限的无线传感器网络。本文分析了常用的非测距定位算法,并在此基础上提出了一种改进的基于序列的非测距定位算法,以提高无线传感器网络定位算法的性能。     

一种基于非度量多维标度的移动定位算法

稀疏无线传感器网络由于缺乏足够的距离和连通性信息,导致大多数定位算法无法有效工作.提出了一种非度量多维标度移动节点辅助定位算法--NMDS-LRA(M).该算法对移动节点运动轨迹抽样,添加拓扑约束关 系,然后利用奇异值分解计算节点相异性矩阵的逼近阵,从而有效解决了移动辅助定位问题,并且避免了以往移动定位算法中虚拟节点间距离误差较大对定位精度的影响.仿真分析表明,与以往算法相比,提出的算法有更好的定位精度,而且在较低网络连通度和不规则网络分布的条件下表现出更好的可靠性.     

基于三维球形分割的无线传感器网络定位算法

为了解决无线传感器网络定位精度问题,根据三维球形分割技术提出了一种新的定位算法。首先,该方法结合锚节点间的平均距离和网络平均连通度来计算未知节点到各个锚节点的距离,并给出了定位误差计算方法。其次,基于三维球形分割对上述指标进行优化,详细阐述了位置节点的三维坐标获取方法,以此建立定位算法。最后,通过数值仿真实验研究影响定位算法的核心因素。实验结果表明,与DV-HOP算法和加权质心算法相比较,该算法在定位误差上得到较大程度改进。     

无线传感器网络连通性研究

为优化无线传感器网络的配置参数,减少网络拓扑结构变化次数,需对其组网算法和连通性问题进行研究。从概率论角度出发研究了网络参数之间的关系,在分析了节点连通度概率分布模型后,推导出了节点通信半径、节点个数、监测区域、连通度之间的关系,并在此基础上给出了一种连通性好且节能的无线传感器网络组网算法。通过仿真实验对算法进行验证,实验结果表明使用该方法组建的无线传感器网络连通性好,有很好的应用前景。     

无线传感器网络若干定位算法的研究

传感器网络是计算机科学技术的一个新的研究领域，具有十分广阔的应用前景，引起了学术界和工业界的高度重视。节点定位技术是传感器网络关键技术之一，具有十分重要的地位。传感器节点采集到的数据必须结合其位置信息才有意义，没有位置信息的数据几乎没有利用价值。综述了近几年国内外的典型定位算法，并将这些定位算法归纳为两大类：基于连通性和基于测量的定位算法。在重点介绍定位算法的同时，系统地分析和比较了DV-Hop、MDS-MAP和SPA等算法的优缺点。     

A robust localization algorithm in wireless sensor networks

Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to various kinds of location attacks, whereas secure localization schemes proposed so far are too complex to apply to power constrained WSNs. This paper provides a distributed robust localization algorithm called Bilateration that employs a unified way to deal with all kinds of location attacks as well as other kinds of information distortion caused by node malfunction or abnormal environmental noise. Bilateration directly calculates two candidate positions for every two heard anchors, and then uses the average of a maximum set of close-by candidate positions as the location estimation. The basic idea behind Bilateration is that candidate positions calculated from reasonable (i.e., error bounded) anchor positions and distance measurements tend to be close to each other, whereas candidate positions calculated from false anchor positions or distance measurements are highly unlikely to be close to each other if false information are not collaborated. By using ilateration instead of classical multilateration to compute location estimation, Bilateration requires much lower computational complexity, yet still retains the same localization accuracy. This paper also evaluates and compares Bilateration with three multilateration-based localization algorithms, and the simulation results show that Bilateration achieves the best comprehensive performance and is more suitable to real wireless sensor networks.