本文選題：車載自組織網(wǎng)絡(luò)　切入點(diǎn)：路由協(xié)議　出處：《吉林大學(xué)》2017年碩士論文

【摘要】：車載自組織網(wǎng)絡(luò)是智能交通系統(tǒng)的重要組成部分,而路由協(xié)議作為車載自組織網(wǎng)絡(luò)的關(guān)鍵技術(shù),很大程度上決定了車載網(wǎng)絡(luò)的通信性能。在車載自組織網(wǎng)絡(luò)中,車輛節(jié)點(diǎn)快速的移動(dòng),使得車載網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)頻繁變化,車輛節(jié)點(diǎn)之間的鄰居關(guān)系很不穩(wěn)定,因此車載自組織網(wǎng)絡(luò)在進(jìn)行通信時(shí)對(duì)路由協(xié)議提出更高的要求。在此基礎(chǔ)上,本文對(duì)車載自組織網(wǎng)絡(luò)中的GPSR路由算法進(jìn)行了改進(jìn)。首先,本文對(duì)車載自組織網(wǎng)絡(luò)和幾類具有代表性的AODV、DREAM、GPS R路由協(xié)議進(jìn)行介紹,研究了隨機(jī)移動(dòng)模型、平滑移動(dòng)模型、城市場景移動(dòng)模型、曼哈頓移動(dòng)模型,詳細(xì)地介紹了能夠比較真實(shí)反映實(shí)際交通場景的Vanet Mobi Si m交通仿真器,并生成了可以直接應(yīng)用在NS2中的交通場景文件。對(duì)比較適合車載自組織網(wǎng)絡(luò)的GPSR路由協(xié)議的貪婪轉(zhuǎn)發(fā)算法和周邊轉(zhuǎn)發(fā)算法進(jìn)行了詳細(xì)的分析,并利用NS2將GPSR路由協(xié)議和AODV協(xié)議進(jìn)行了仿真對(duì)比研究。之后,本文分析了車載自組織網(wǎng)絡(luò)中GPSR路由算法存在的缺陷,針對(duì)路由算法在進(jìn)行數(shù)據(jù)轉(zhuǎn)發(fā)時(shí)存在的鄰居關(guān)系不穩(wěn)定和通信路徑冗余現(xiàn)象,提出了改進(jìn)措施。在路由算法進(jìn)行貪婪轉(zhuǎn)發(fā)時(shí),加入了鄰居節(jié)點(diǎn)的累計(jì)通信時(shí)長參數(shù),算法在選擇下一跳轉(zhuǎn)發(fā)節(jié)點(diǎn)時(shí),在給定的距離范圍內(nèi),挑選累計(jì)通信時(shí)長最大的鄰居節(jié)點(diǎn),這樣可以使選擇的下一跳節(jié)點(diǎn)即有距離優(yōu)勢又有穩(wěn)定性;進(jìn)行周邊轉(zhuǎn)發(fā)時(shí),考慮鄰居節(jié)點(diǎn)之間的位置關(guān)系,通過計(jì)算鄰居節(jié)點(diǎn)與目的節(jié)點(diǎn)之間的角度大小,選擇與目的節(jié)點(diǎn)位置關(guān)系最合適的鄰居節(jié)點(diǎn)作為下一跳轉(zhuǎn)發(fā)節(jié)點(diǎn),這樣規(guī)劃出的路由路徑更加合理。通過TCL語言和C++程序語言實(shí)現(xiàn)了改進(jìn)的GPSR路由算法,將改進(jìn)的GPSR路由協(xié)議嵌入到NS2中,結(jié)合Vanet Mobi Sim交通仿真器對(duì)改進(jìn)算法進(jìn)行了仿真實(shí)驗(yàn)。通過實(shí)驗(yàn)結(jié)果分析,改進(jìn)的GPSR路由算法相對(duì)于原算法在丟包率、端到端平均時(shí)延和吞吐量性能指標(biāo)上均有所提高,更加適合車載自組織網(wǎng)絡(luò)。最后,指出了本文改進(jìn)的GPSR路由算法存在的不足和下一步的工作計(jì)劃,并展望了未來的車載自組織網(wǎng)絡(luò)路由協(xié)議的發(fā)展方向。
[Abstract]:The vehicular ad hoc network is an important part of the intelligent transportation system. As the key technology of the vehicle ad hoc network, the routing protocol determines the communication performance of the vehicle network to a great extent. The rapid movement of vehicle nodes causes frequent changes in the topology of vehicular networks, and the neighbor relationship between vehicle nodes is unstable. Therefore, the vehicle-borne ad hoc networks require higher routing protocols when communicating. In this paper, the GPSR routing algorithm in vehicular ad hoc networks is improved. Firstly, this paper introduces the vehicle Ad hoc networks and several representative AODV ad hoc GPSR R routing protocols, and studies the random moving model and smooth moving model. The Vanet Mobi Si m traffic simulator, which can truly reflect the actual traffic scene, is introduced in detail in the urban scene movement model and the Manhattan mobile model. The traffic scene file which can be directly applied in NS2 is generated. The greedy forwarding algorithm and peripheral forwarding algorithm which are more suitable for GPSR routing protocol in vehicle-borne ad hoc networks are analyzed in detail. The GPSR routing protocol and the AODV protocol are compared with each other by NS2. After that, the defects of the GPSR routing algorithm in the vehicle Ad Hoc Network are analyzed in this paper. In view of the instability of neighbor relationship and the redundancy of communication path in routing algorithm, an improved method is put forward, in which the cumulative communication time parameter of neighbor node is added to the greedy forwarding algorithm. When the next hop forwarding node is selected, the neighbor node with the largest cumulative communication time can be selected within a given range of distance, which can make the next hop node have the advantage of distance and stability. Considering the location relationship between neighbor nodes, by calculating the angle between neighbor node and destination node, the neighbor node which is the most suitable location relationship with destination node is selected as the next hop forwarding node. By using TCL language and C program language, the improved GPSR routing algorithm is implemented, and the improved GPSR routing protocol is embedded in NS2. Vanet Mobi Sim traffic simulator is used to simulate the improved algorithm. The experimental results show that the improved GPSR routing algorithm improves packet loss rate, end-to-end average delay and throughput performance compared with the original algorithm. Finally, the shortcomings of the improved GPSR routing algorithm and the next work plan are pointed out, and the future development direction of the routing protocol for the vehicular ad hoc network is prospected.
【學(xué)位授予單位】：吉林大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN929.5;U495

【相似文獻(xiàn)】

相關(guān)期刊論文 前3條

1 王麗娟;梁海濤;秦建敏;任新華;;貪婪周邊無狀態(tài)路由轉(zhuǎn)發(fā)算法GPSR的分析及改進(jìn)[J];太原理工大學(xué)學(xué)報(bào);2012年05期

2 黃yN;曾孝平;;面向車載網(wǎng)絡(luò)改進(jìn)的GPSR路由算法[J];科學(xué)技術(shù)與工程;2013年36期

3 孫燾;韓寧;馮林;;基于極大轉(zhuǎn)發(fā)角的地理位置路由GPSR算法改進(jìn)[J];計(jì)算機(jī)工程與科學(xué);2011年07期

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

1 沈丹丹;基于漁船超短波自組織網(wǎng)絡(luò)的GPSR路由協(xié)議設(shè)計(jì)與仿真[D];上海海洋大學(xué);2016年

2 狄特;車載自組織網(wǎng)絡(luò)GPSR路由算法的研究[D];吉林大學(xué);2017年

3 彭好佑;車載自組織網(wǎng)絡(luò)GPSR路由協(xié)議研究及算法改進(jìn)[D];海南大學(xué);2013年

4 張宗正;車載自組織網(wǎng)絡(luò)GPSR路由算法的研究及改進(jìn)[D];廣東工業(yè)大學(xué);2015年

，

本文編號(hào)：1660228