基于移动锚节点的WSN定位算法共线问题的研究

发布时间：2018-04-21 01:25

本文选题：无线传感器网络 + 节点定位　；参考：《哈尔滨工程大学》2014年硕士论文

【摘要】：当今信息技术发展迅速,为无线传感器网络(WSN,wireless sensor network)的发展创造了良好的环境。传感器网络有着广泛的应用,并存在大量的研究,WSN已慢慢融入到人类生活的各个方面,在其众多的研究中,节点定位是基础。在用静态锚节点定位时需要的锚节点密度较大,而锚节点的成本较一般传感器节点高,在其完成节点定位后,通常处于闲置状态,不能被充分利用,因此,现在国内外很多学者开始研究基于移动锚节点的WSN定位算法。锚节点的移动方式有两种:基于静态路径的移动和基于动态路径的移动。在学习、研究和总结已有的定位算法的基础上,基于现有算法的缺点和不足,提出两种新的基于移动锚节点WSN定位算法:基于正六边形的递增式的定位算法(Incremental Localization Algorithm based on hexagon,ILAH)和基于分簇的移动锚节点定位算法(Mobile anchor node Localization Algorithm based on Clustering,CMLA), 这两个算法主要用来解决现有基于静态路径和基于动态路径的定位算法中存在的共线问题,并克服现有算法通过引入辅助设备来解决共线问题的缺点,二者定位时需要的基本技术相同,但是二者的适用范围有所不同。本文主要研究工作有:首先对现有的WSN节点定位技术学习、研究和分析;对节点定位方法进行详细的介绍,并对其进行分类、分析和对比,总结各种方法的适用范围和不足。然后介绍了与基于移动锚节点定位相关的技术,总结现有的基于移动锚节点的路径规划方法,为后续的研究奠定了理论基础。最后重点研究了 ILAH算法和CMLA算法,本文的算法的实现都是通过matlab仿真实现的,ILAH定位算法是锚节点基于静态路径的规划方法,锚节点沿着规划好的路径移动,通过仿真实验可知该方法的定位精度及区域覆盖率都比较高,该方法解决了传统方法引入的锚节点共线问题,该方法的移动路径较传统的移动模型小;CMLA定位算法是基于锚节点动态路径规划的定位算法,可以根据网络的实时需求改变锚节点的移动路径,所以其实用性强,通过仿真实验可知该方法的定位误差较小,定位覆盖率高,且有效的解决了锚节点共线问题。
[Abstract]:Nowadays, the rapid development of information technology has created a good environment for the development of wireless sensor network. Sensor networks (WSN) have been widely used, and a large number of research has been gradually integrated into all aspects of human life. In many of its research, node location is the basis. The density of anchor nodes is higher when static anchor nodes are located, and the cost of anchor nodes is higher than that of normal sensor nodes. After the node positioning is completed, it is usually idle and can not be fully utilized. Now many scholars at home and abroad have begun to study the WSN localization algorithm based on mobile anchor nodes. There are two ways of moving anchor nodes: static path based movement and dynamic path based movement. On the basis of learning, researching and summarizing the existing localization algorithms, based on the shortcomings and shortcomings of the existing algorithms, Two new WSN localization algorithms based on mobile anchor nodes are proposed: incremental Localization Algorithm based on hexagonizing ILAH based on hexagonal algorithm and mobile anchor node Localization Algorithm based on clustering algorithm based on clustering. To solve the collinear problem existing in the existing static path and dynamic path based localization algorithms, It also overcomes the shortcomings of the existing algorithms to solve the collinear problem by introducing auxiliary equipment. The basic technology required by them is the same, but their scope of application is different. The main research work of this paper is as follows: firstly, the existing WSN node location technology is studied, studied and analyzed; the node location methods are introduced in detail, classified, analyzed and compared, and the applicable scope and shortcomings of various methods are summarized. Then the technologies related to the location of mobile anchor nodes are introduced, and the existing path planning methods based on mobile anchor nodes are summarized, which lays a theoretical foundation for further research. In the end, ILAH algorithm and CMLA algorithm are studied. In this paper, the implementation of the algorithm is realized by matlab simulation. The algorithm is based on the static path planning method of anchor node, and the anchor node moves along the planned path. The simulation results show that the location accuracy and area coverage of this method are high. The method solves the collinear problem of anchor nodes introduced by traditional methods. The moving path of this method is smaller than that of the traditional mobile model. It is based on the dynamic path planning of anchor node. It can change the moving path of anchor node according to the real time demand of network, so its practicability is strong. The simulation results show that the location error of this method is small, the location coverage is high, and the collinear problem of anchor node is solved effectively.
【学位授予单位】：哈尔滨工程大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5

【参考文献】