本文關(guān)鍵詞： 車(chē)輛自組織網(wǎng)絡(luò) 卡爾曼預(yù)測(cè) 地理位置路由 DTN路由　出處：《天津大學(xué)》2014年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：車(chē)輛自組織網(wǎng)絡(luò)(Vehicular Ad-Hoc Networks, VANETs)實(shí)現(xiàn)了車(chē)輛-車(chē)輛間通信與車(chē)輛-路邊設(shè)施間通信，是智能交通系統(tǒng)(Intelligent Transport System，ITS)的重要組成部分，在車(chē)輛移動(dòng)Internet接入、交通信息預(yù)警、車(chē)輛行駛輔助等方面具有廣闊的應(yīng)用前景，成為近年來(lái)的研究熱點(diǎn)。 作為一種特殊的無(wú)線移動(dòng)自組織網(wǎng)絡(luò)(Mobile Ad-Hoc Networks, MANETs)，車(chē)輛自組織網(wǎng)絡(luò)其獨(dú)有的特點(diǎn)，如車(chē)輛節(jié)點(diǎn)運(yùn)動(dòng)速度較快、車(chē)輛節(jié)點(diǎn)分布不均等，，造成節(jié)點(diǎn)之間通信時(shí)間短、鏈路頻繁斷裂和鏈路容量受限。這些問(wèn)題給設(shè)計(jì)車(chē)輛自組織網(wǎng)絡(luò)路由協(xié)議，實(shí)現(xiàn)高效數(shù)據(jù)傳輸帶來(lái)了極大的挑戰(zhàn)。 本文在分析車(chē)輛自組織網(wǎng)絡(luò)特點(diǎn)的基礎(chǔ)上，對(duì)現(xiàn)有的車(chē)輛自組織網(wǎng)絡(luò)路由協(xié)議進(jìn)行了深入的研究和分析。針對(duì)現(xiàn)有協(xié)議的缺陷，提出了一種基于卡爾曼預(yù)測(cè)的混合路由算法(Kalman Predictor-based Hybrid Routing, KPHR)。該算法以GPSR(Greedy Perimeter Stateless Routing)協(xié)議為基礎(chǔ)，結(jié)合了地理位置路由在連通性較好網(wǎng)絡(luò)中低延遲、時(shí)延容忍網(wǎng)絡(luò)(Delay Tolerant Networks, DTN)路由在連通性較差網(wǎng)絡(luò)中高投遞率的優(yōu)點(diǎn)。同時(shí)分析現(xiàn)有車(chē)輛自組織網(wǎng)絡(luò)路由協(xié)議中所采用的獲取車(chē)輛位置方法的不足，利用卡爾曼預(yù)測(cè)器對(duì)車(chē)輛實(shí)時(shí)位置進(jìn)行高精度的預(yù)測(cè)，使用預(yù)測(cè)位置參與路由計(jì)算，輔助地提高路由決策的效率。 本文通過(guò)分組平均端到端時(shí)延、分組投遞率和網(wǎng)絡(luò)吞吐率三個(gè)方面將KPHR同GPSR和帶有緩存的GPSR進(jìn)行了比較和評(píng)價(jià)。利用真實(shí)地圖數(shù)據(jù)，通過(guò)VanetMobiSim構(gòu)建道路拓?fù)溆糜趨f(xié)議仿真，使仿真場(chǎng)景更加貼近實(shí)際。將得到的仿真場(chǎng)景用于NS-2仿真平臺(tái)，獲得仿真數(shù)據(jù)。仿真結(jié)果表明，在分組平均端到端時(shí)延、分組投遞率和網(wǎng)絡(luò)吞吐率方面，KPHR路由算法具有更好的性能。
[Abstract]:Vehicle Ad Hoc Ad-Hoc Networks (VANETs) implements vehicle-vehicle communication and vehicle-roadside facility communication. It is an important component of Intelligent Transport system (ITS) in the vehicle mobile Internet access. Traffic information early warning and vehicle driving aid have a wide application prospect and become the research hotspot in recent years. As a special wireless mobile ad hoc network, Mobile Ad-Hoc Networks, Manets has its unique characteristics. Such as fast moving speed of vehicle nodes, uneven distribution of vehicle nodes, short communication time between nodes, frequent link breakage and limited link capacity, these problems lead to the design of vehicle ad hoc network routing protocol. The realization of efficient data transmission brings great challenges. Based on the analysis of the characteristics of the vehicle Ad hoc network, this paper makes a deep research and analysis on the existing routing protocols of the vehicle ad hoc network, aiming at the defects of the existing protocols. A hybrid routing algorithm named Kalman Predictor-based Hybrid Routing based on Kalman prediction is proposed. The algorithm is based on the GPSR(Greedy Perimeter Stateless routing protocol. It combines the geographical location routing with delay Tolerant Networks in the well-connected network with low delay and delay tolerance. DTN-based routing has the advantages of high delivery rate in poor connectivity networks. At the same time, it analyzes the shortcomings of the existing routing protocols used in the Ad hoc network to obtain the location of vehicles. The Kalman predictor is used to predict the real-time position of the vehicle with high precision, and the predictive position is used to participate in the routing calculation, which can improve the efficiency of routing decision. In this paper, KPHR is compared with GPSR and GPSR with cache in terms of average end-to-end delay, packet delivery rate and network throughput. Real map data are used. The road topology is constructed by VanetMobiSim for protocol simulation, which makes the simulation scene more close to reality. The simulation scene is used in NS-2 simulation platform. The simulation results show that the KPHR routing algorithm has better performance in terms of packet average end-to-end delay packet delivery rate and network throughput.
【學(xué)位授予單位】：天津大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：U495;U463.67

【參考文獻(xiàn)】

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

1 夏梓峻;劉春鳳;趙增華;舒炎泰;;基于鏈路預(yù)測(cè)的VANET路由算法[J];計(jì)算機(jī)工程;2012年04期

2 朱二華;;一種自適應(yīng)的城市場(chǎng)景車(chē)用自組織網(wǎng)路由協(xié)議[J];計(jì)算機(jī)與現(xiàn)代化;2010年05期

3 周克琴,彭玉旭;AD HOC網(wǎng)絡(luò)在車(chē)輛間通信協(xié)議的應(yīng)用研究[J];數(shù)據(jù)通信;2004年04期

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

1 周連科;基于交通流密度的VANET廣播技術(shù)研究[D];哈爾濱工業(yè)大學(xué);2011年

本文編號(hào)：1466949