基于平面化的无线网络地理路由算法研究
发布时间：2018-12-28 21:31
【摘要】：随着无线通信技术、信息技术和无线网络节点工艺的快速发展，以Ad-hoc为代表的无线网络在各领域得到了越来越多的应用，而作为无线网络技术的重要组成部分，路由协议无疑是其中一项非常关键的研究热点。传统的基于多跳自组织原理的路由协议主要是基于网络拓扑结构，在可扩展性和路由开销等方面有很多先天不足之处。另一方面，随着无线定位技术的日益成熟和无线网络节点功能的不断增强，很多网络节点本身就具备地理位置信息的感知能力。基于地理位置信息的地址作用，地理路由算法相对其他路由算法具备先天性的优势，，因此对地理路由算法的研究具有重要的现实意义。 在明确了研究背景和先验条件之后，本文首先介绍了基于平面化的无线网络地理路由算法的相关理论基础，包括贪婪算法、面路由算法和平面化算法三个主要内容。贪婪算法是地理路由算法进行路由转发的基本思想，然而由于贪婪算法可能遇到“路由空洞”问题，因此需要利用面路由算法进行边界转发，从而绕过“路由空洞”，而面路由算法需要网络平面图的支持，因此需要平面化算法将原始的无线网络转化为平面图。在理论分析的基础之上，本文对经典的平面化算法进行了仿真分析，并分别对贪婪算法、面路由算法以及二者相结合的路由算法进行了系统的仿真分析，从而展示了各个算法的性能特点以及结合思路。 在理论基础之后，本文介绍了经典的地理路由算法GPSR算法的基本原理和设计思路，并针对该算法的边界转发路径迂回问题提出了一种改进方案，进而提出改进的地理路由算法Improved-GPSR算法。为了验证提出的路由算法的有效性，本文在不同的网络拓扑和运动场景下进行了大量的仿真，对比了改进前后两种算法在边界转发模式下的路由路径，并测试了各算法的主要性能指标和可拓展性，最后讨论了信标周期对两种算法的性能影响。 最后，为验证本文提出的Improved-GPSR路由算法的实用性，本文还在Android平台实现了该算法，并通过一个简单的无线网络通信软件直观地展现了该路由算法的实际工作效果。在简单介绍了该软件的建模和设计方案之后，给出了实测结果，并指出了其中的实际意义和不足之处。
[Abstract]:With the rapid development of wireless communication technology, information technology and wireless network node technology, wireless network represented by Ad-hoc has been applied more and more in various fields, and as an important part of wireless network technology, Routing protocol is undoubtedly one of the key research hotspots. The traditional routing protocol based on the principle of multi-hop self-organization is mainly based on the network topology, which has many inherent shortcomings in scalability and routing overhead. On the other hand, with the increasing maturity of wireless location technology and the continuous enhancement of wireless network node functions, many network nodes themselves have the ability to perceive geographical location information. Based on the address function of geographical location information, geographical routing algorithm has inherent advantages over other routing algorithms, so the study of geographical routing algorithm has important practical significance. After clarifying the research background and prior conditions, this paper first introduces the theoretical basis of the planar wireless network geographic routing algorithm, including greedy algorithm, surface routing algorithm and planarization algorithm. Greedy algorithm is the basic idea of geographic routing algorithm for routing forwarding. However, because greedy algorithm may encounter the problem of "routing hole", it is necessary to use the surface routing algorithm for boundary forwarding, so as to circumvent the "routing hole". The plane routing algorithm needs the support of the network plan, so it needs the planarization algorithm to transform the original wireless network into the plane graph. On the basis of theoretical analysis, the classical planarization algorithm is simulated, and the greedy algorithm, the plane routing algorithm and the combined routing algorithm are analyzed systematically. Thus, the performance of each algorithm and the combination of ideas are shown. After the theoretical foundation, this paper introduces the basic principle and design idea of the classical geographical routing algorithm (GPSR), and proposes an improved scheme for the border-forwarding path roundabout problem of the algorithm. Then an improved geographic routing algorithm, Improved-GPSR algorithm, is proposed. In order to verify the effectiveness of the proposed routing algorithm, a large number of simulations are carried out in different network topologies and motion scenarios, and the routing paths of the two algorithms under the boundary forwarding mode are compared before and after the improvement. The main performance indexes and expansibility of each algorithm are tested. Finally, the effect of beacon period on the performance of the two algorithms is discussed. Finally, in order to verify the practicability of the proposed Improved-GPSR routing algorithm, this paper also implements the algorithm on the Android platform, and through a simple wireless network communication software, the actual performance of the routing algorithm is demonstrated intuitively. After a brief introduction of the modeling and design scheme of the software, the measured results are given, and the practical significance and shortcomings are pointed out.
【学位授予单位】：哈尔滨工业大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5
本文编号：2394463
[Abstract]:With the rapid development of wireless communication technology, information technology and wireless network node technology, wireless network represented by Ad-hoc has been applied more and more in various fields, and as an important part of wireless network technology, Routing protocol is undoubtedly one of the key research hotspots. The traditional routing protocol based on the principle of multi-hop self-organization is mainly based on the network topology, which has many inherent shortcomings in scalability and routing overhead. On the other hand, with the increasing maturity of wireless location technology and the continuous enhancement of wireless network node functions, many network nodes themselves have the ability to perceive geographical location information. Based on the address function of geographical location information, geographical routing algorithm has inherent advantages over other routing algorithms, so the study of geographical routing algorithm has important practical significance. After clarifying the research background and prior conditions, this paper first introduces the theoretical basis of the planar wireless network geographic routing algorithm, including greedy algorithm, surface routing algorithm and planarization algorithm. Greedy algorithm is the basic idea of geographic routing algorithm for routing forwarding. However, because greedy algorithm may encounter the problem of "routing hole", it is necessary to use the surface routing algorithm for boundary forwarding, so as to circumvent the "routing hole". The plane routing algorithm needs the support of the network plan, so it needs the planarization algorithm to transform the original wireless network into the plane graph. On the basis of theoretical analysis, the classical planarization algorithm is simulated, and the greedy algorithm, the plane routing algorithm and the combined routing algorithm are analyzed systematically. Thus, the performance of each algorithm and the combination of ideas are shown. After the theoretical foundation, this paper introduces the basic principle and design idea of the classical geographical routing algorithm (GPSR), and proposes an improved scheme for the border-forwarding path roundabout problem of the algorithm. Then an improved geographic routing algorithm, Improved-GPSR algorithm, is proposed. In order to verify the effectiveness of the proposed routing algorithm, a large number of simulations are carried out in different network topologies and motion scenarios, and the routing paths of the two algorithms under the boundary forwarding mode are compared before and after the improvement. The main performance indexes and expansibility of each algorithm are tested. Finally, the effect of beacon period on the performance of the two algorithms is discussed. Finally, in order to verify the practicability of the proposed Improved-GPSR routing algorithm, this paper also implements the algorithm on the Android platform, and through a simple wireless network communication software, the actual performance of the routing algorithm is demonstrated intuitively. After a brief introduction of the modeling and design scheme of the software, the measured results are given, and the practical significance and shortcomings are pointed out.
【学位授予单位】：哈尔滨工业大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5
【引证文献】
相关硕士学位论文 前1条
1 田斯;基于辅助节点维护的AODV路由协议研究[D];哈尔滨工业大学;2016年
本文编号：2394463
本文链接：https://www.wllwen.com/kejilunwen/wltx/2394463.html
