三维环境下传感器网络节点定位及边界节点识别方法研究

发布时间：2018-04-05 14:11

本文选题：无线传感器网络　切入点：三维环境　出处：《电子科技大学》2014年硕士论文

【摘要】：无线传感器网络技术作为对未来信息化影响巨大的技术之一,其研究前景广阔,应用空间巨大。在实际应用中,观测者最关心的就是传感器网络中特定事件的发生地点以及传感器网络监测区域的范围。确定特定事件的发生地点需要首先获取所有传感器节点位置,而若要确定传感器网络监测区域的范围则需要进行网络边界识别,因此对传感器网络的节点定位和边界节点识别研究具有非常广泛的应用前景。鉴于当前对于节点定位和边界识别技术的研究大多是围绕二维环境展开,而对于三维环境的相关研究则相当匮乏,且实际的传感器节点通常分布在如丘陵,山区,海底等人迹罕至的三维环境中,因此基于三维环境的传感器网络技术研究非常有必要。基于以上应用需求,本文提出了一种三维起伏地表环境下的节点定位算法BER和一种三维空间传感器网络边界节点识别算法BTPRE,主要工作如下:(1)对于三维起伏地表的节点定位问题,以有效的解决网络中通信开销和信标节点密度之间的矛盾为出发点,研究了一种三维起伏地表环境下的节点定位算法BER,算法使用移动信标节点在三维起伏地表环境下的路径规划来对未知节点进行辅助定位。(2)对于三维起伏地表中的节点由于相对二维环境增加了一维z坐标,导致在使用(1)中方法进行定位后z方向误差偏大的问题,在BER算法中引入电子地图信息?yxfz),(对z方向的定位结果进行修正,大幅增加了定位精度。然后对该定位算法进行仿真并对仿真结果进行总结和分析。(3)针对三维传感器网络的边界识别问题,提出了一种基于初始边界三角形平面递归扩展的分布式边界节点获取算法BTPRE,该算法所得边界冗余点较少。并对算法执行过程中可能遇到的一些问题及影响因素进行分析和研究。最后对边界识别算法进行仿真,并对仿真结果进行总结和分析。在BER算法仿真中,将不同的定位结果进行电子地图修正,证明了BER算法能够显著改善定位效果。在BTPRE算法仿真中,将BTPRE算法与常用三维边界识别算法的仿真结果进行对比,证明了BTPRE算法得到的边界冗余点明显减少。
[Abstract]:Wireless sensor network (WSN) technology, as one of the technologies which has a great impact on the future information technology, has a broad research prospect and huge application space.In practical applications, observers are most concerned about the location of specific events in sensor networks and the range of sensor network monitoring areas.Determining the location of a particular event requires first obtaining the location of all sensor nodes, and to determine the scope of the sensor network monitoring area, network boundary identification is required.Therefore, the research on node location and boundary node identification in sensor networks has a very wide application prospect.In view of the fact that most of the current researches on node location and boundary recognition are focused on two-dimensional environment, the research on three-dimensional environment is rather scarce, and the actual sensor nodes are usually distributed in hilly and mountainous areas.Therefore, it is necessary to study the sensor network technology based on 3D environment.Based on the above application requirements, this paper proposes a node localization algorithm BER and a boundary node recognition algorithm for 3D spatial sensor networks (BER). The main work is as follows: 1) for the problem of node location in 3D undulating surface.In order to solve the contradiction between communication overhead and beacon node density effectively,In this paper, we study a node location algorithm called per, which uses path planning of mobile beacon nodes in 3D undulating surface environment to locate unknown nodes.The node adds one dimensional z coordinate to the two-dimensional environment.As a result of the problem that the error of z direction is too large after the method is used in the BER algorithm, we introduce the electronic map information into the BER algorithm to correct the localization result in z direction, which greatly increases the accuracy of the location.Then the localization algorithm is simulated and the simulation results are summarized and analyzed.A distributed boundary node acquisition algorithm, BTPRE, based on the recursive expansion of the plane of the initial boundary triangle is proposed.Some problems and influencing factors that may be encountered in the implementation of the algorithm are analyzed and studied.Finally, the boundary recognition algorithm is simulated, and the simulation results are summarized and analyzed.In the simulation of BER algorithm, the different location results are corrected by electronic map, which proves that BER algorithm can improve the localization effect significantly.In the simulation of BTPRE algorithm, the simulation results of BTPRE algorithm and three dimensional boundary recognition algorithm are compared, and it is proved that the boundary redundancy of BTPRE algorithm is obviously reduced.
【学位授予单位】：电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5;TP212.9

【共引文献】