【摘要】：隨著無(wú)線通信技術(shù)、信息技術(shù)和無(wú)線網(wǎng)絡(luò)節(jié)點(diǎn)工藝的快速發(fā)展，以Ad-hoc為代表的無(wú)線網(wǎng)絡(luò)在各領(lǐng)域得到了越來(lái)越多的應(yīng)用，而作為無(wú)線網(wǎng)絡(luò)技術(shù)的重要組成部分，路由協(xié)議無(wú)疑是其中一項(xiàng)非常關(guān)鍵的研究熱點(diǎn)。傳統(tǒng)的基于多跳自組織原理的路由協(xié)議主要是基于網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)，在可擴(kuò)展性和路由開(kāi)銷等方面有很多先天不足之處。另一方面，隨著無(wú)線定位技術(shù)的日益成熟和無(wú)線網(wǎng)絡(luò)節(jié)點(diǎn)功能的不斷增強(qiáng)，很多網(wǎng)絡(luò)節(jié)點(diǎn)本身就具備地理位置信息的感知能力�；诘乩砦恢眯畔⒌牡刂纷饔�，地理路由算法相對(duì)其他路由算法具備先天性的優(yōu)勢(shì)，，因此對(duì)地理路由算法的研究具有重要的現(xiàn)實(shí)意義。 在明確了研究背景和先驗(yàn)條件之后，本文首先介紹了基于平面化的無(wú)線網(wǎng)絡(luò)地理路由算法的相關(guān)理論基礎(chǔ)，包括貪婪算法、面路由算法和平面化算法三個(gè)主要內(nèi)容。貪婪算法是地理路由算法進(jìn)行路由轉(zhuǎn)發(fā)的基本思想，然而由于貪婪算法可能遇到“路由空洞”問(wèn)題，因此需要利用面路由算法進(jìn)行邊界轉(zhuǎn)發(fā)，從而繞過(guò)“路由空洞”，而面路由算法需要網(wǎng)絡(luò)平面圖的支持，因此需要平面化算法將原始的無(wú)線網(wǎng)絡(luò)轉(zhuǎn)化為平面圖。在理論分析的基礎(chǔ)之上，本文對(duì)經(jīng)典的平面化算法進(jìn)行了仿真分析，并分別對(duì)貪婪算法、面路由算法以及二者相結(jié)合的路由算法進(jìn)行了系統(tǒng)的仿真分析，從而展示了各個(gè)算法的性能特點(diǎn)以及結(jié)合思路。 在理論基礎(chǔ)之后，本文介紹了經(jīng)典的地理路由算法GPSR算法的基本原理和設(shè)計(jì)思路，并針對(duì)該算法的邊界轉(zhuǎn)發(fā)路徑迂回問(wèn)題提出了一種改進(jìn)方案，進(jìn)而提出改進(jìn)的地理路由算法Improved-GPSR算法。為了驗(yàn)證提出的路由算法的有效性，本文在不同的網(wǎng)絡(luò)拓?fù)浜瓦\(yùn)動(dòng)場(chǎng)景下進(jìn)行了大量的仿真，對(duì)比了改進(jìn)前后兩種算法在邊界轉(zhuǎn)發(fā)模式下的路由路徑，并測(cè)試了各算法的主要性能指標(biāo)和可拓展性，最后討論了信標(biāo)周期對(duì)兩種算法的性能影響。 最后，為驗(yàn)證本文提出的Improved-GPSR路由算法的實(shí)用性，本文還在Android平臺(tái)實(shí)現(xiàn)了該算法，并通過(guò)一個(gè)簡(jiǎn)單的無(wú)線網(wǎng)絡(luò)通信軟件直觀地展現(xiàn)了該路由算法的實(shí)際工作效果。在簡(jiǎn)單介紹了該軟件的建模和設(shè)計(jì)方案之后，給出了實(shí)測(cè)結(jié)果，并指出了其中的實(shí)際意義和不足之處。
[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.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5

【引證文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 田斯;基于輔助節(jié)點(diǎn)維護(hù)的AODV路由協(xié)議研究[D];哈爾濱工業(yè)大學(xué);2016年

本文編號(hào)：2394463