Min-Max及其改进无线传感器网络定位算法的研究

常见的基于测距的定位算法有Min-Max定位算法、三边定位算法和最大似然法,本文在研究这三种定位算法的同时,重点分析了Min-Max定位算法,并对其在定位边界区域误差较大问题提出一种有效的解决办法,并通过仿真进行验证。对比Min-Max及其改进方法的仿真结果表明改进方法能有效改善定位边缘区域的盲节点的定位精度。     

无线传感器网络中一种改进的DV-Hop定位算法研究

节点定位算法是无线传感器网络中的关键技术。针对DV-Hop定位算法定位精度不高的问题,提出一种改进的DV-Hop定位算法,通过减小全网平均跳距与真实的平均跳距的差距,重新修订不在网络区域的未知节点的坐标,提高平均跳距取值的准确性。仿真结果表明,在同等网络环境下,改进的DV-Hop定位算法的定位误差减小,能有效提高节点的定位精度。     

一种改进组合加权的TDOA室内二维定位算法

针对现有组合加权算法对定位区域边缘的目标定位时精度较低的问题,在现有组合加权算法的基础上提出了一种改进算法。首先,将基站分组,以到达时差算法得到目标位置的多个估计结果;其次,计算各估计结果之间距离值并排序,以滑动窗口法判断是否存在基站组出现异常定位估计;最后,当任意基站组的定位结果发生异常时,使用目标位置估计结果及其估计克拉美罗下界值设计两个加权步骤的权值,通过二步组合加权算法得到最终定位结果。仿真结果表明,所提算法有效减少了原组合加权算法对定位区域边缘的目标定位时的误差,当测量噪声标准差为0.8 m时,所提算法相较于原算法在正方形边缘区域定位均方根误差减小了0.35 m;在定位狭窄矩形区域时,所提算法平均定位均方根误差减小了0.11 m。     

卡尔曼滤波算法在单站无源定位中的应用

针对传统卡尔曼滤波算法在单站无源定位中的不足,提出了一种基于CV模型的卡尔曼滤波算法,阐述了卡尔曼滤波算法和CV模型,对基于CV模型的卡尔曼滤波算法在单站无源定位中的应用进行了仿真分析。仿真结果表明改进卡尔曼滤波算法能有效提高定位精度。     

复杂环境下车牌定位算法仿真研究

提出了一种能适应环境变化的车牌定位算法。该算法首先利用自适应灰度变化增强图像的对比度,使灰度变化剧烈的边缘区域更加突出;然后采用改进的Sobel算子对图像进行滤波并对非边缘区域进行抑制,使边缘区域以高值形式表现出来而其它区域值基本为零;接下来通过两次基于滑动窗口的统计滤波方法去除无效的边缘和干扰噪声得到车牌的候选区域;最后通过形态学处理的方法并根据有关的先验条件定位出车牌区域。仿真实验结果表明,该算法具有较强的环境适应性,在各种环境下的定位准确率达到96.4%以上。     

一种改进的Eddystone-TLM质心室内三边定位算法

为了解决在室内环境中利用三边定位技术定位精度不高,以及基于质心定位改进三边定位算法后参考点难以确定在待测点外侧的问题,提出一种利用Eddystone-TLM对三边定位算法进行改进。首先利用Eddystone框架的TLM优化质心定位算法;其次通过优化后的质心定位算法解决三边定位算法已知的不足;最终实现定位精度的提高。实验结果表明,该算法改善了室内定位的精准性,可及时准确地获取目标终端的位置数据,有效保证了室内定位与其他领域之间定位数据的互联互通。     

基于改进RSSI测距的LSSVR三维WSN定位算法

针对基于RSSI测距的定位算法定位误差较大的问题,通过加入多组已知节点之间的距离和接收功率作为参考,提出了一种改进的RSSI测距算法,并将改进的RSSI测距作为最小二乘支持向量回归机LSSVR的输入向量,获得基于改进RSSI测距的LSSVR三维定位算法模型。MATLAB仿真结果表明,在节点随机分布的三维环境中,基于改进RSSI测距的LSSVR定位算法的定位误差比传统LSSVR定位算法减小了13.6%~21.2%,另外,可以通过增加已知节点数量等方法,进一步提高目标定位的准确性。     

ZigBee技术定位算法方面的实验研究

先分析了无线传感器网络(WSN,Wireless Sensor Network)ZigBee中几种常见的定位算法的优缺点,选择基于RSSI测距算法作为基本的室内定位算法,然后针对RSSI算法的不足,选用了几种基于RSSI算法的改进算法,并根据这几种改进算法在ZigBee网络平台下的室内定位仿真实验结果,挑选出一种最优算法,以用于物联网智能家具室内物品定位技术。     

基于改进DV-Hop的无线传感器网络节点定位算法

针对DV-Hop距算法定位误差大的难题,提出一种改进离估计误差,并利用DV-Hop的传感器节点定位算法。首先修正知节点与信标节DV-Hop算法对节点进行定位;然后对进V-Hop算法定位误差行校正,最后在Matlab 2012平台上对算法性能进行仿真分析。仿真结果表明,本文算法可以较好地克服DV-Hop算法存在的不足,提高了传感器节点的定位精度。     

无线传感器网络中序列定位新算法的研究

 在无线传感器网络中传统的序列定位算法将空间划分为点、边和面等不同的区域,但以面重心为未知点定位时误差较大. 针对此节点自定位算法的误差问题,提出了一种序列定位与三点垂心法相结合的节点定位改进算法,给出了该算法的基本原理与实现方法. 通过进一步判断排列顺序相关系数的三个最大值,求出离未知节点“最近”的三个区域的重心构成的三角形的垂心,进一步滤掉节点不可能存在的区域,减少定位误差. 该算法增加了计算未知节点精确位置的计算量,但不需要增加节点的硬件条件和计算复杂度. 仿真结果表明,与传统序列定位算法和三点垂心法相比,新算法可以明显的提高定位精度,随着锚节点数的增多,定位误差呈大幅度的减少.     

信标节点漂移情况下的无线传感器网络节点定位机制

针对信标节点漂移情况下的节点定位问题,提出了一种分布式的信标节点漂移检测方法,采用节点自评分和协商机制,自动寻找可能发生了漂移的信标节点,同时针对大量信标节点发生漂移后的定位覆盖率下降问题,构建普通节点的定位可信度模型,并在定位盲区内使用一些较为可靠的普通节点作为临时信标节点进行定位。仿真实验表明,该算法在误检测、定位误差方面性能优于传统算法,具有较低的通信开销、较高的实用性和灵活性。     

WSN中基于稀疏观测和异步传输的分布式实时定位算法

针对无线传感器网络（WSN）中现有集中式多维标度（MDS-MAP）节点定位算法在定位精度和分布式方面的不足,提出一种基于稀疏观测和异步传输的分布式实时定位算法。首先在传统MDS-MAP算法中融入稀疏观测机制,使其能够更好地符合实际观测场景;然后提出一种异步传输序列,使节点能够分布式计算距离观测,并通过分布式计算结果给出位置估计;最后通过提出的位置估计精化操作减小估计误差,最终实现节点的精确定位。实验结果表明,该算法具有较高的定位精度。     

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.     

新型的热点簇中心定位算法及其应用

针对煤矿井下人员定位困难以及现有定位算法存在较大定位误差的问题,提出了一种适合煤矿井下环境的新的热点簇中心定位算法.该算法利用RSSI值对移动节点在定位区域中的位置进行归类,有效地解决了现有文献定位方法中存在的定位盲点问题,同时,提高了定位的实时性能和定位精度.数值仿真和实验结果证明了本方法的有效性.     

Path planning using a mobile anchor node based on trilateration in wireless sensor networks

In wireless sensor networks (WSNs), many applications require sensor nodes to obtain their locations. Now, the main idea in most existing localization algorithms has been that a mobile anchor node (e.g., global positioning system‐equipped nodes) broadcasts its coordinates to help other unknown nodes to localize themselves while moving according to a specified trajectory. This method not only reduces the cost of WSNs but also gets high localization accuracy. In this case, a basic problem is that the path planning of the mobile anchor node should move along the trajectory to minimize the localization error and to localize the unknown nodes. In this paper, we propose a Localization algorithm with a Mobile Anchor node based on Trilateration (LMAT) in WSNs. LMAT algorithm uses a mobile anchor node to move according to trilateration trajectory in deployment area and broadcasts its current position periodically. Simulation results show that the performance of our LMAT algorithm is better than that of other similar algorithms. Copyright © 2011 John Wiley & Sons, Ltd.     

Achieving Max–Min lifetime and fairness with rate allocation for data aggregation in sensor networks

We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: (1) maximizing the minimum (Max–Min) lifetime of an aggregation cluster and (2) achieving fairness among all data sources. The two objectives are generally correlated with each other and usually, they cannot be maximized simultaneously. We adopt a lexicographic method to solve this multi-objective programming problem. First, we recursively induce the Max–Min lifetime for the aggregation cluster. Under the given Max–Min lifetime, we then formulate the problem of maximizing fairness as a convex optimization problem, and derive the optimal rate allocation strategy by iterations. We also present low-complexity algorithms that an aggregation cluster can use to determine the Max–Min network lifetime and the fair rate allocation. Our simulation results validate our analytical results and illustrate the effectiveness of the approach.     

基于DV-Hop的RSSI-Hop算法

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

Localized positioning in ad hoc networks

Position centric approaches, such as Cartesian routing, geographic routing, and the recently proposed trajectory based forwarding, address scalability issues in large ad hoc networks by using Euclidean space as a complementary name space. These approaches require that nodes know their position in a common coordinate system. While a GPS receiver in each node would be ideal, in many cases an approximation algorithm is necessary for networks with only a few GPS enabled nodes. These algorithms however require collaboration of large portions of the network, thus imposing an overhead for nodes which do not need positioning, or are mobile. We propose local positioning system, a method that makes use of local node capabilities––angle of arrival, range estimations, compasses and accelerometers, in order to internally position only the groups of nodes involved in particular conversations. Localized positioning enables position centric uses, like discovery, flooding and routing in networks where global positioning is not available.     

无线传感器网络中分阶段的无需测距定位算法

为了提高无线传感器网络中基于无需测距算法定位精度,改进质心算法和DV-Hop算法,定位过程分为两个阶段:第一阶段在最佳通信半径与最佳阈值下,用基于阈值的优先质心算法定位部分节点;第二阶段在最佳通信半径与最佳指数值下用DV-Hop算法定位剩余节点。将算法应用在一种锚节点人工部署环境下,并与其他算法对比。MTLAB仿真结果表明,改进的算法在不增加泛洪次数、计算量和网络硬件成本下能提高定位精度,同时实现100%定位。