共查询到19条相似文献,搜索用时 62 毫秒
2.
3.
4.
5.
6.
针对MSP算法需要借助额外的外部扫描设备,不适合应用于对野外大规模部署的传感器网络进行定位这一缺点,提出了一种HG-MSP算法。该算法通过锚节点发出扫描信息,不需要额外的外部设备进行辅助定位,提高了算法的可用性。仿真实验表明,在去掉辅助设备的情况下,算法的定位精度并无明显下降。 相似文献
7.
微机电系统(Micro-Electro-Mechanism System)、片上系统(System on Ghip)和无线通信技术的进步孕育了无线传感器网络(WSN,Wireless Sensor Network)。WSN作为一个全新的研究领域,向我们提出了大量的挑战性课题,比如网络自身定位问题就是其中之一。本文探讨了自组织无线传感器网络中的节点自身定位问题,重点阐述了近年来具有代表性的算法,并指出了未来的研究方向。 相似文献
8.
文章提出了一种带有容错机制的目标定位算法,算法以传感器节点观测结果0.1值为依据,通过一种似然估计实现定位。文章提出的算法能够获得较好的定位精度,并在一定的节点差错概率下,保持算法性能。 相似文献
9.
提出了一种基于映射扩散的无线传感器网络节点定位算法,适用于规模较大、参考节点较少的无线传感器网络.该算法在传感器网络中首先随机选择一个节点作为"起始节点",然后根据扩散算法选择3个"一级节点",然后以每个一级节点为中心,逐级外推,直至覆盖网络中的所有节点.仿真结果证明,该算法可以快速准确进行定位,可降低和均衡所有节点的能耗,提高定位精度. 相似文献
10.
根据信标节点到达未知节点的跳数信息,将未知节点接收到的信标节点划分为3个级别,即到达未知节点跳数为1的节点为第一级节点、跳数为n的节点为第二级节点,剩余的为第三级节点。为此,在未知节点的信息表中定义了两个计数器,即counter1和counter2。计数器的值不同,意味着所选择的定位方法也有所区别。此外,跳数为1的情况下,引入了接收信号强度指示(RSSI)模型进行定位。同时,文章也详细阐述了对传统的DV-Hop算法的改进。 相似文献
11.
12.
由于多径、干扰、遮挡等多种因素的存在,使用RSS 方法测距的精度较低,因此必须采用合理的算法来减小测距误差对定位精度的影响,通过多次实验和改变参数可以获得较好的仿真结果。 相似文献
13.
基于几何学的无线传感器网络定位算法 总被引:1,自引:0,他引:1
提出一种基于几何学的无线传感器网络(WSN)定位算法。把网络区域中的节点分为锚节点和未知节点,假设在定位空间中有n个锚节点,由于受到几何学的限制,实际可行的锚节点序列是有限的,因此利用一种几何方法判断锚节点间的位置关系,从而选取最优的锚节点序列,能够更精确地确定未知节点的位置,并且分析了待定位节点的邻居锚节点数量对定位精度的影响。仿真结果表明,与已有的APS(Ad-Hoc positioning system)定位算法相比,该算法可有效地降低平均定位误差和提高定位覆盖度。 相似文献
14.
在对视觉传感网络中身份特征进行识别时,容易受到人脸表情、光照条件及遮挡等干扰,降低了身份特征识别精度.提出了一种基于改进最小灰度差树的身份特征自适应识别算法.对待识别图像进行灰度处理后,利用最小灰度差数增强待识别图像的质量;定义基于灰度的代价函数,获取待识别人脸图像和指定人脸图像对应的各灰度对的匹配代价,建立最小灰度差树模型,计算两幅图像相似度后,直接采用最近邻匹配算法获取和视觉传感网络注册图库中最小匹配代价对应的图像身份,将其看作待识别身份,实现视觉传感网络中身份特征自适应识别.仿真实验结果表明,所提算法具有很高的身份识别精度. 相似文献
15.
The RSS-based multi-target localization has the natural property of the sparsity in wireless sensor networks.A multi-target localization algorithm based on adaptive grid in wireless sensor networks was proposed,which divided the multi-target localization problem into two phases:large-scale grid-based localization and adaptive grid-based localization.In the large-scale grid-based localization phase,the optimal number of measurements was determined due to the sequential compressed sensing theory,and then the locations of the initial candidate grids were reconstructed by applying lp (0< p<1) optimization.In the adaptive grid-based localization phase,the initial candidate grids were adaptively partitioned according to the compressed sensing theory,and then the locations of the targets were precisely estimated by applying lpoptimization once again.Compared with the traditional multi-target localization algorithm based on compressed sensing,the simulation results show that the proposed algorithm has higher localization accuracy and lower localization delay without foreknowing the number of targets.Therefore,it is more appropriate for the multi-target localization problem in the large-scale wireless sensor networks. 相似文献
16.
In hostile environments, localization often suffers from malicious attacks that may distort transmit power and degrade positioning accuracy significantly for wireless sensor network. A robust semidefinite relaxation secure localiza-tion algorithm RSRSL was proposed to improve the location accuracy against malicious attacks. On the assumption of unknown transmit power, which is undoubtedly approximate to the fact of WSN, a novel secure location probability model was introduced for single-target and multi-target sensor networks, respectively. Taking the computational complexity of RSRSL into account, the nonlinear and non-convex optimization problem was simplified into a semidefinite programming problem. According to the results from both simulations and field experiments, it is clearly demonstrated that the proposed RSRSL has better performance on location accuracy, in contrast to the conventional localization algorithms. 相似文献
17.
18.
19.
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. 相似文献