首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 234 毫秒
1.
马淑丽  赵建平 《通信技术》2015,48(10):1147-1151
DV-Hop算法是一种低成本、低定位精度的无需测距定位算法,在粗精度定位中应用广泛。为提高DV-Hop算法定位精度,从减小锚节点的平均每一跳距离误差和减小未知节点平均每一跳校正值误差两方面考虑。首先,用最佳指数值下的公式计算锚节点平均每一跳距离。然后,将未知节点的校正值加权处理,使所有的锚节点根据与未知节点距离的远近影响校正值的大小。MATLAB实验证明,改进的基于最佳指数值下的加权DV-Hop算法比DV-Hop算法、加权DV-Hop、最佳指数值下DV-Hop算法定位精度分别提高2%左右、1.65%左右、1.15%左右,同时不会增加网络硬件成本。  相似文献   

2.
针对无线传感器网络中经典定位算法 DV-Hop 存在定位精度低的缺陷,提出了一种改进算法。在传统 DV-Hop 算法的基础上,首先采用最小均方误差准则校正信标节点的平均每跳距离,然后对各未知节点到参考信标节点的平均每跳距离进行加权处理,最后通过参数分析,对未知节点进行位置修正。仿真实验结果表明,改进算法相比于传统的 DV-Hop 定位算法以及已有的改进算法具有很高的定位精度,并且无需增加额外的硬件设施。因此在工程上具有很好的实用性。  相似文献   

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

4.
针对 DV-Hop 定位算法中在计算未知节点到锚节点距离时产生较大误差的问题,提出了一种改进的 DV-Hop 算法。改进算法对全网平均每跳距离和局部平均每跳距离进行了加权处理,得到了未知节点的平均每跳距离,又提出了一种改进的加权最小二乘法来得到未知节点的坐标,减小了节点的定位误差。仿真结果表明,在不需要增加额外的硬件设施的基础上,改进算法的定位精度相比于原算法明显提高。  相似文献   

5.
提出了一种基于锚节点功率调节的加权质心定位算法,通过锚节点的功率调节确定各个锚节点对于未知节点的影响力因子,并将其作为权重计算未知节点的位置,体现了不同锚节点为未知节点位置计算结果的影响.仿真表明,该算法减小了节点的平均定位误差,是一种适合于无线传感器网络的定位方法.  相似文献   

6.
为了降低整个无线传感器网络的成本和减小测量误差对定位精度的影响,一般传统做法是把已定位的未知节点升级为信标节点,再对其他节点进行定位,但此情况会造成累积误差。为了减少累积误差,提出了一种加权的最小二乘变尺度定位算法,该算法首先利用加权最小二乘法对未知节点进行位置估计,然后把定位的未知节点升级为信标节点,再对剩下的未知节点进行位置估计,最后利用拟牛顿法对估计出来的位置进行优化。仿真结果表明,该算法能有效地减少测距误差和累积误差,降低网络成本,提高网络覆盖率和传感节点的定位精度,并且该算法不增加额外硬件设备,易于实现。  相似文献   

7.
DV-Hop定位算法是无线传感器网络中一种常用的基于非测距定位技术,该算法使用平均跳距表示实际距离,在实际应用中造成很大的误差和节点能耗。为此,分析了加权的DV-Hop定位算法,提出了基于节点密度的定位算法,根据未知节点的邻居节点数,修正了平均跳距。仿真结果证明,加权DV-HOP在定位精度上比DV-HOP算法提高了5.3%,基于节点密度的定位算法在功耗上比DV-HOP算法减少了20.7%。  相似文献   

8.
自身节点定位是无线传感器网络的关键技术之一。本文对距离无关定位算法中的质心定位算法进行了分析,在基于RSSI的质心定位算法的基础上提出了一种新的校正RSSI测距值的加权定位算法。测距阶段将信标节点之间的距离和信号强度信息同时考虑在内进行RSSI值校正,权值选择阶段采用了修正传统权重的计算方法,权值取距离倒数之和。通过仿真证明,本文提出的算法相对于传统的加权质心定位算法有明显改进,获得较好的定位精度。  相似文献   

9.
史清江  何晨 《通信学报》2009,30(10):8-13
提出了一种移动锚节点辅助的分布式定位算法.与以前的基于移动锚节点的定位算法不同,此算法不需要任何测距技术支持.它是利用移动锚节点的功率控制,即以不同的发射功率发射信标信号,接收到信标信号的未知节点将这些信标信息转化为一系列二次不等式约束,然后通过凸优化技术求解这些不等式组来逼近未知节点位置的最佳估计.仿真结果表明,提出的距离无关的定位算法可适合实际定位情况且具有较高的定位精度.  相似文献   

10.
常用的节点定位方法通常要求较多的信标节点,因此容易造成资源浪费.提出一种基于目标跟踪的移动信标辅助节点定位算法,信标节点在移动过程中周期性地发布自身位置信息,未知节点首先获取自身位置的近似估计,然后再利用无迹卡尔曼滤波(UKF)方法对移动信标进行跟踪,并完成进一步位置求精.在该算法中,未知节点之间无需相互通信,降低了能...  相似文献   

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

12.
针对无线传感网络(WSNs)的节点定位问题,提出无人机辅助的基于前馈神经网络的节点定位(UAV-NN)算法。UAV-NN算法利用无人机(UAV)作为锚节点,并由UAV周期地发射beacon信号,利用极端学习机(LEM)训练单隐藏前向反馈的神经网络(SLFN),未知节点接收来自UAV发射的beacon信号,并记录其接收信号强度指示(RSSI),已训练的SLFN再依据RSSI值估计节点位置。仿真结果表明,相比于传统的基于RSSI定位算法,提出的UAV-NN算法无需部署地面锚节点;相比其他传统的机器学习算法,UAV-NN算法通过引用ELM,减少了定位误差。  相似文献   

13.
一种基于网络密度分簇的移动信标辅助定位方法   总被引:1,自引:0,他引:1  
赵方  马严  罗海勇  林权  林琳 《电子与信息学报》2009,31(12):2988-2992
现有移动信标辅助定位算法未充分利用网络节点分布信息,存在移动路径过长及信标利用率较低等问题。该文把网络节点分簇、增量定位与移动信标辅助相结合,提出了一种基于网络密度分簇的移动信标辅助定位算法(MBL(ndc))。该算法选择核心密度较大的节点作簇头,采用基于密度可达性的分簇机制把整个网络划分为多个簇内密度相等的簇,并联合使用基于遗传算法的簇头全局路径规划和基于正六边形的簇内局部路径规划方法,得到信标的优化移动路径。当簇头及附近节点完成定位后,升级为信标,采用增量定位方式参与网络其它节点的定位。仿真结果表明,该算法定位精度与基于HILBERT路径的移动信标辅助定位算法相当,而路径长度不到后者的50%。  相似文献   

14.
Acoustic-based techniques are the standard for localization and communication in underwater environments, but due to the challenges associated with this medium, it is becoming increasingly popular to find alternatives such as using optics. In our prior work we developed an LED-based Simultaneous Localization and Communication (SLAC) approach that used the bearing angles, needed for establishing optical line-of-sight for LED-based communication between two beacon nodes and a mobile robot, to triangulate and thereby localize the position of the robot. Our focus in this paper is on how to optimally fuse measurement data for optical localization in a network with multiple pairs of beacon nodes to obtain the target location. We propose the use of a sensitivity metric, designed to characterize the level of uncertainty in the position estimate with respect to the bearing angle error, to dynamically select a desired pair of beacon nodes. The proposed solution is evaluated with extensive simulation and experimentation, in a setting of three beacons nodes and one mobile node. Comparison with multiple alternative approaches demonstrates the efficacy of the proposed approach.  相似文献   

15.
In order to better solve the contradiction between precision of localization and the number of anchor nodes in wireless sensor network,a mobile anchor node localization technology based on connectivity was proposed.First,the coverage characteristic of the network nodes was analyzed,and a critical value was found between the mobile step and the anchor node communication radius,mobile anchor nodes' coverage characteristic would change when near this critical value.Second,a mobile anchor node followed a planning path to form a positioning area seamless coverage was used.Finally,when there was no need for high-precision technology,node position would been estimated according with the connectivity of the network and the receiving information of the node.The simulation results show that the proposed algorithm can realize coarse-grained localization,and paths perform complete localization.  相似文献   

16.
One of the most important tasks in sensor networks is to determine the physical location of sensory nodes as they may not all be equipped with GPS receivers. In this paper we propose a localization method for wireless sensor networks (WSNs) using a single mobile beacon. The sensor locations are maintained as probability distributions that are sequentially updated using Monte Carlo sampling as the mobile beacon moves over the deployment area. Our method relieves much of the localization tasks from the less powerful sensor nodes themselves and relies on the more powerful beacon to perform the calculation. We discuss the Monte Carlo sampling steps in the context of the localization using a single beacon for various types of observations such as ranging, Angle of Arrival (AoA), connectivity and combinations of those. We also discuss the communication protocol that relays the observation data to the beacon and the localization result back to the sensors. We consider security issues in the localization process and the necessary steps to guard against the scenario in which a small number of sensors are compromised. Our simulation shows that our method is able to achieve less than 50% localization error and over 80% coverage with a very sparse network of degree less than 4 while achieving significantly better results if network connectivity increases.  相似文献   

17.
A new distributed node localization algorithm named mobile beacons-improved particle filter (MB-IPF) was proposed. In the algorithm, the mobile nodes equipped with globe position system (GPS) move around in the wireless sensor network (WSN) field based on the Gauss-Markov mobility model, and periodically broadcast the beacon messages. Each unknown node estimates its location in a fully distributed mode based on the received mobile beacons. The localization algorithm is based on the IPF and several refinements, including the proposed weighted centroid algorithm, the residual resampling algorithm, and the markov chain monte carlo (MCMC) method etc., which were also introduced for performance improvement. The simulation results show that our proposed algorithm is efficient for most applications.  相似文献   

18.
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.  相似文献   

19.
In many applications of wireless sensor network, the position of the sensor node is useful to identify the actuating response of the environment. The main idea of the proposed localization scheme is similar with most of the existing localization schemes, where a mobile beacon with global positioning system broadcast its current location coordinate periodically. The received information of the coordinates help other unknown nodes to localize themselves. In this paper, we proposed a localization scheme using mobile beacon points based on analytical geometry. Sensor node initially choose two distant beacon points, in-order to minimize its residence area. Later using the residence area, sensor node approximate the radius and half length of the chord with reference to one of the distant beacon point. Then the radius and half length of the chord are used to estimate the sagitta of an arc. Later, sensor node estimate its position using radius, half length of the chord, and sagitta of an arc. Simulation result shows the performance evaluation of our proposed scheme on various trajectories of mobile beacon such as CIRCLE, SPIRAL, S-CURVE, and HILBERT.  相似文献   

20.
In this paper, a novel iterative localization algorithm based on improved particle swarm optimization (PSO) is proposed for monitoring environment like lakes, rivers or other water bodies. The first step of this algorithm is to get the position of some unknown nodes by using improved PSO algorithm. The second step is to locate other nodes by using these unknown nodes in first step as new anchor nodes. The localization problem of island node in sparse distributed grid is solved by introducing adaptive mobile node in this paper. The simulation results show that the algorithm has the advantages of small location error and little influence by environmental factors.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号