一种关于无线传感器质心算法的研究

发布时间：2018-01-07 19:14

本文关键词：一种关于无线传感器质心算法的研究　出处：《辽宁科技大学》2014年硕士论文　论文类型：学位论文

【摘要】：在无线网络传感器节点信息中,其中的定位信息起着弥足珍贵的作用。节点的位置信息的获取与准确与否是对网络进行环境监测,对目标进行跟踪,对数据进行测量等应用的重要支撑前提。节点定位技术作为无线传感器网络的核心技术之一,在无线网络中有着极其重要的研究意义。作为我们生活中不可或缺的一部分,研究功耗更低、计算简单、抗干扰能力更强的传感器节点对于改善我们的生活有着重要的指导意义。本文首先对无线网络传感器的研究背景、基本知识进行介绍,引发出关于网络环境中节点定位技术的重要性。并结合国内外定位算法的研究现状,对其中现有的各种经典定位算法进行简单介绍,对其中引发出来的误差做简要分析。在此基础上,提出一种关于质心算法的改进算法IWCOM算法,并通过MATLAB模拟仿真软件进行仿真,用实验结果证明其有一定方面的提高。论文的主要的工作包含以下两个方面:1、通过详尽的分析质心算法的不足后提出改进算法。算法复杂度极低、算法理论简单易懂是基于非测距的质心定位算法的几个鲜明的特点。在信标节点数量可观的情况下,算法的定位精度较好,但是在实际应用中不乏有些缺点,比如其算法要求信标节点数量充足,在信标节点数量有限的情况下算法定位的精确度降低较为明显。针对这些特点,本文根据质心算法,扬长避短的提出一种改进的质心算法——IWCOM算法。在经典的质心算法中,信标节点与未知节点的距离因素较为明显的影响了最终节点定位的效果,因此将各个信标节点的信息进行加权处理,能够减小原有质心算法的定位误差。大多数情况下,网络中信标节点密度较低,因此本文提出将已经经过定位的未知节点升级为伪信标节点,以解决信标节点密度较低的问题,显然,升级为伪信标节点的未知节点在辅助那些周围信标节点不足的未知节点定位时的权值应低于原始信标节点,从而减小误差累积效应,通过此方法可以迭代逐次定位所有未知节点。2、为了能够测试本文提出的这种算法的定位效果,将这种经过优化的迭代加权质心算法通过仿真软件模拟其在网络中的工作状态,得到客观真实的结果。通过MATLAB仿真软件进行多次模拟实验之后,经过计算得出的结果显示,使用IWCOM算法定位网络环境内的未知节点,相比于质心算法,IWCOM算法在网络连通度、节点通信半径一定、信标节点密度较低的情况下,定位精度有所提高。
[Abstract]:In wireless network sensor node information, the location information plays a valuable role. The acquisition and accuracy of node location information is to monitor the network environment and track the target. Node location technology is one of the core technologies of wireless sensor networks. As an indispensable part of our life, the research power consumption is lower and the calculation is simple. Sensor nodes with stronger anti-jamming ability have important guiding significance for improving our life. Firstly, this paper introduces the research background and basic knowledge of wireless network sensor. This paper introduces the importance of node location technology in network environment. Combined with the current research situation of localization algorithms at home and abroad, this paper briefly introduces the existing classical localization algorithms. On the basis of the analysis of the error caused by it, an improved algorithm IWCOM algorithm about centroid algorithm is proposed and simulated by MATLAB simulation software. The main work of this paper includes the following two aspects: 1. Through the detailed analysis of the shortcomings of the centroid algorithm, the improved algorithm is proposed. The complexity of the algorithm is very low. The theory of the algorithm is simple and easy to understand is based on the centroid localization algorithm based on non-ranging several distinct characteristics. In the sizable number of beacon nodes the algorithm has a good positioning accuracy but in practical applications there are some shortcomings. For example, the algorithm requires sufficient number of beacon nodes, and the accuracy of the algorithm is obviously reduced when the number of beacon nodes is limited. In view of these characteristics, according to the centroid algorithm. In the classical centroid algorithm, the distance between beacon node and unknown node obviously affects the effect of final node location. Therefore, weighted processing of the information of each beacon node can reduce the location error of the original centroid algorithm. In most cases, the density of the CITIC node in the network is low. Therefore, this paper proposes to upgrade the unknown nodes that have been located to pseudo-beacon nodes to solve the problem of low density of beacon nodes, obviously. The weight of unknown nodes upgraded to pseudo-beacon nodes should be lower than that of original beacon nodes while assisting those unknown nodes with insufficient beacons around them so as to reduce the effect of error accumulation. This method can iteratively locate all unknown nodes. 2. In order to test the localization effect of this algorithm proposed in this paper. The optimized iterative weighted centroid algorithm is simulated by the simulation software to get the objective and real results. After many simulation experiments are carried out through the MATLAB simulation software. The calculated results show that the use of IWCOM algorithm to locate unknown nodes in the network environment, compared with the centroid algorithm in the network connectivity, the node communication radius is fixed. When the density of beacon nodes is low, the positioning accuracy is improved.
【学位授予单位】：辽宁科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5

【相似文献】