无线传感器网络论文：无线传感器网络三维定位网格化表示二次划分迭代计算【中文摘要】无线传感器网络(Wireless Sensor Networks, WSNs)是一种由大量低复杂度传感器节点通过自组织方式形成的无线网络,可广泛应用于环境监测、灾难救助、目标跟踪、医疗监护等领域。
在应用中,节点的位置信息对传感网络监测活动异常重要,没有位置信息的监控数据毫无意义。
因此,节点定位技术是无线传感器网络的重要研究内容之一,对网络的有效性起到关键作用。
首先,本文概述了无线传感器网络的体系结构,重点探讨节点定位问题。
节点定位算法可以分为基于距离(Range-based)和距离无关(Range-free)两类节点定位算法,简要介绍了典型的二维平面节点定位算法,归纳了每种算法的优缺点。
现实应用中,如地震人员搜救、建筑结构监测等,节点分布于三维空间,对节点定位精度要求高。
因此,研究三维空间高精度节点定位算法成为无线传感网络重要课题。
其次,在研究实际应用对定位精度要求的基础上,基于三维空间网格划分,引入迭代计算思想,提出了一种高精度三维无线传感网络节点定位算法。
该算法将定位空间划分为若干的空间立体网格,锚节点对各个网格进行投票,将获票最多的网格作为待定位节点最大可能所在区域,将此网格再次进行网格划分,锚节点再对小的立体网格进行投票,查找出获票最多的小网格,以此网格的质心作为待定位节点的位置。
此算法大幅度提高了定位精确度,同时有效地降低了节点的计算量。
最后,建立系统仿真模型,构建MATLAB仿真平台,验证了该定位算法的基本性能,分析功率射程、空间大小、划分方式、无线电信号传输不规则性等多种环境因索对算法性能的影响。
仿真结果表明,该算法比网格划分定位算法的定位精度提高了67.7%,定位时间减少42.3%,有效的解决了定位精度和节点计算量之间的矛盾。
【英文摘要】Wireless sensor networks(WSNs), which consists of a large number of simple sensor nodes, is a self-organized wireless network. It can be widely applied in environment monitoring, disaster relief, target tracking, medical care, and so on. In these applications, it is important for the sensor nodes to acquire their own locations, because sensed data is always meaningless without relating to its physical position. Therefore, localization has become an important subject in WSNs and is a key for WSNs applications.A brief introduction of WSN is given to describe the structure of WSN. Then the localization algorithm is discussed particularly. Localization algorithms can be divided into two types:range-based schemes andrange-free schemes. The most representative range-based schemes and range-free schemes, such as TOA algorithm, AOA algorithm, DV Hop, APIT, are discussed in this paper. Advantages and disadvantages of these schemes are analyzed. But these schemes are based on two-dimensional (2D) plane. However,sensor networks may often be deployed over complex 3D space inreal applications. As a result, high accuracy localizationschemes become a key subject for 3D WSNs.Iterative calculationof secondary grid division localization scheme (ICSGDLS)divides the located cube in 3D space grid division scheme, and calculated the position of the node. First, ICSGDLS divides the3D space into many cubes, and all anchors vote for every cube.The cube with most votes is the most possible cube, in whichthe node consists. Then the cube is divided again, and anchorsvote for every smaller cube again. The centroid of the smallercube with most votes is assumed the estimated position of thenode. ICSGDLS increases the localization accuracy greatly, and decreases the calculation amount of sensor nodes.Finally, a simulation model is created based on MATLAB, and impact ofdifferent factors is analyzed. Simulation indicates that the accuracy of ICSGDLS increased by 67.7%, and localization time decreased by 42.3% than grid division scheme.【关键词】无线传感器网络三维定位网格化表示二次划分迭代计算【采买全文】1.3.9.9.38.8.4.8 1.3.8.1.13.7.2.1 同时提供论文写作一对一辅导和论文发表服务.保过包发.【说明】本文仅为中国学术文献总库合作提供，无涉版权。
