基于平面化的無線網絡地理路由算法研究
發(fā)布時間：2018-12-28 21:31
【摘要】：隨著無線通信技術、信息技術和無線網絡節(jié)點工藝的快速發(fā)展，以Ad-hoc為代表的無線網絡在各領域得到了越來越多的應用，而作為無線網絡技術的重要組成部分，路由協(xié)議無疑是其中一項非常關鍵的研究熱點。傳統(tǒng)的基于多跳自組織原理的路由協(xié)議主要是基于網絡拓撲結構，在可擴展性和路由開銷等方面有很多先天不足之處。另一方面，隨著無線定位技術的日益成熟和無線網絡節(jié)點功能的不斷增強，很多網絡節(jié)點本身就具備地理位置信息的感知能力�；诘乩砦恢眯畔⒌牡刂纷饔�，地理路由算法相對其他路由算法具備先天性的優(yōu)勢，，因此對地理路由算法的研究具有重要的現(xiàn)實意義。 在明確了研究背景和先驗條件之后，本文首先介紹了基于平面化的無線網絡地理路由算法的相關理論基礎，包括貪婪算法、面路由算法和平面化算法三個主要內容。貪婪算法是地理路由算法進行路由轉發(fā)的基本思想，然而由于貪婪算法可能遇到“路由空洞”問題，因此需要利用面路由算法進行邊界轉發(fā)，從而繞過“路由空洞”，而面路由算法需要網絡平面圖的支持，因此需要平面化算法將原始的無線網絡轉化為平面圖。在理論分析的基礎之上，本文對經典的平面化算法進行了仿真分析，并分別對貪婪算法、面路由算法以及二者相結合的路由算法進行了系統(tǒng)的仿真分析，從而展示了各個算法的性能特點以及結合思路。 在理論基礎之后，本文介紹了經典的地理路由算法GPSR算法的基本原理和設計思路，并針對該算法的邊界轉發(fā)路徑迂回問題提出了一種改進方案，進而提出改進的地理路由算法Improved-GPSR算法。為了驗證提出的路由算法的有效性，本文在不同的網絡拓撲和運動場景下進行了大量的仿真，對比了改進前后兩種算法在邊界轉發(fā)模式下的路由路徑，并測試了各算法的主要性能指標和可拓展性，最后討論了信標周期對兩種算法的性能影響。 最后，為驗證本文提出的Improved-GPSR路由算法的實用性，本文還在Android平臺實現(xiàn)了該算法，并通過一個簡單的無線網絡通信軟件直觀地展現(xiàn)了該路由算法的實際工作效果。在簡單介紹了該軟件的建模和設計方案之后，給出了實測結果，并指出了其中的實際意義和不足之處。
[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.
【學位授予單位】：哈爾濱工業(yè)大學
【學位級別】：碩士
【學位授予年份】：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.
【學位授予單位】：哈爾濱工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TN929.5
【引證文獻】
相關碩士學位論文 前1條
1 田斯;基于輔助節(jié)點維護的AODV路由協(xié)議研究[D];哈爾濱工業(yè)大學;2016年
本文編號：2394463
本文鏈接：http://sikaile.net/kejilunwen/wltx/2394463.html
最近更新
教材專著
