本文關(guān)鍵詞：城市場(chǎng)景下車(chē)載自組網(wǎng)中基于車(chē)輛分布的分層路由算法研究　出處：《東華大學(xué)》2017年碩士論文　論文類(lèi)型：學(xué)位論文

  更多相關(guān)文章： 車(chē)載自組網(wǎng) 分層 路由協(xié)議 GPSR NS-2

【摘要】：當(dāng)下,車(chē)載自組網(wǎng)作為智能交通系統(tǒng)的重要組成部分,具有重要的研究?jī)r(jià)值和廣闊的發(fā)展前景。車(chē)載自組網(wǎng)的網(wǎng)絡(luò)性能是限制其發(fā)展的主要因素,一個(gè)好的車(chē)載自組網(wǎng)路由協(xié)議能夠改善網(wǎng)絡(luò)性能,使數(shù)據(jù)實(shí)現(xiàn)可靠、穩(wěn)定的傳輸。但是由于車(chē)載自組網(wǎng)中車(chē)輛節(jié)點(diǎn)移動(dòng)速度快、運(yùn)動(dòng)軌跡受道路限制等諸多特點(diǎn),車(chē)載自組網(wǎng)對(duì)網(wǎng)絡(luò)路由協(xié)議的要求更加嚴(yán)格。本文針對(duì)車(chē)輛不同分布的情況對(duì)車(chē)載自組網(wǎng)的路由算法進(jìn)行了深入的研究。首先,針對(duì)城市場(chǎng)景下道路車(chē)輛較密集,車(chē)輛趨近于均勻分布的情況,提出基于位置的分層路由算法。依賴(lài)道路的路邊固定設(shè)備充當(dāng)網(wǎng)關(guān),結(jié)合車(chē)輛的分布密度和車(chē)輛在道路的位置,在道路中選取部分車(chē)輛充當(dāng)接入幫助節(jié)點(diǎn)(Accessing Help Points,AHPs),結(jié)合AHP節(jié)點(diǎn)進(jìn)行GPSR路由改進(jìn),提出車(chē)輛均勻分布下的分層路由算法,從而有效減少數(shù)據(jù)從源節(jié)點(diǎn)到路邊固定設(shè)備的數(shù)據(jù)傳輸時(shí)延。其次,針對(duì)城市場(chǎng)景下道路車(chē)輛較稀疏,車(chē)輛非均勻分布的情況,提出基于相鄰車(chē)間距的分層路由算法。根據(jù)非均勻分布下相鄰車(chē)輛之間的車(chē)間距進(jìn)行分簇,分簇后的簇頭和簇尾節(jié)點(diǎn)進(jìn)行通信半徑的動(dòng)態(tài)變化,從而提高網(wǎng)絡(luò)的穩(wěn)定性。并在此基礎(chǔ)上結(jié)合車(chē)載自組網(wǎng)中的基于位置的GPSR路由協(xié)議進(jìn)行改進(jìn),提出車(chē)輛非均勻分布下的分層路由算法,以改善網(wǎng)絡(luò)性能。通過(guò)VanetMobiSim和NS-2仿真工具對(duì)上述兩種算法進(jìn)行仿真。仿真結(jié)果表明,在車(chē)輛趨近均勻分布時(shí),基于位置的分層路由算法能夠減少數(shù)據(jù)傳輸?shù)臅r(shí)延,降低數(shù)據(jù)的丟包率,適用于車(chē)輛密集擁塞情況下對(duì)時(shí)延要求較高的城市場(chǎng)景。當(dāng)車(chē)輛非均勻分布時(shí),基于相鄰車(chē)間距的分層路由算法能夠較好的適應(yīng)車(chē)輛的位置變化,在網(wǎng)絡(luò)負(fù)載不大時(shí)能夠有效減小數(shù)據(jù)傳輸時(shí)延,提高數(shù)據(jù)傳輸?shù)挠行�。最�?本文指出了一些有待解決和完善的問(wèn)題,為后續(xù)深入研究指出方向。
[Abstract]:Nowadays, as an important part of intelligent transportation system, vehicle-mounted ad hoc network has important research value and broad development prospect. The network performance of vehicle-mounted ad hoc network is the main factor limiting its development. A good on-board ad hoc routing protocol can improve the network performance, make the data reliable and stable transmission, but because of the vehicular ad hoc network, the vehicle nodes move fast. The movement track is restricted by the road and so on. Vehicle ad hoc network has more strict requirements for network routing protocol. This paper studies the routing algorithm of vehicle ad hoc network in accordance with the different distribution of vehicles. First of all. In view of the situation that the road vehicles are dense and the vehicles are close to uniform distribution in the urban environment, a hierarchical routing algorithm based on location is proposed, which relies on the road fixed devices to act as the gateway. Combined with the distribution density of the vehicle and the location of the vehicle on the road, selected part of the vehicle in the road as the access help node processing Help points AHPs. Combining with AHP nodes to improve GPSR routing, a hierarchical routing algorithm based on uniform distribution of vehicles is proposed to effectively reduce the data transmission delay from source nodes to roadside fixed devices. Secondly. A hierarchical routing algorithm based on the distance between adjacent vehicles is proposed to solve the problem of sparse road vehicles and non-uniform distribution of vehicles in the urban environment. Clustering is carried out according to the distance between adjacent vehicles under the non-uniform distribution. The cluster head and the cluster tail node have dynamic change of communication radius, so as to improve the stability of the network. Based on this, the location based GPSR routing protocol in the vehicle ad hoc network is improved. In order to improve the network performance, a hierarchical routing algorithm with non-uniform vehicle distribution is proposed. The simulation results show that these two algorithms are simulated by VanetMobiSim and NS-2 simulation tools. As vehicles approach to uniform distribution, the hierarchical routing algorithm based on location can reduce the delay of data transmission and the rate of data packet loss. When the vehicle is not uniformly distributed, the hierarchical routing algorithm based on the distance between adjacent vehicles can better adapt to the change of vehicle position. When the network load is small, it can effectively reduce the delay of data transmission and improve the efficiency of data transmission. Finally, this paper points out some problems to be solved and improved, and points out the direction for further research.
【學(xué)位授予單位】：東華大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TN929.5;U495

【參考文獻(xiàn)】

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

1 孫友偉;孫小田;王楠;;基于位置和定向泛洪的車(chē)聯(lián)網(wǎng)區(qū)域路由協(xié)議[J];西安郵電大學(xué)學(xué)報(bào);2016年02期

2 周鵬;;基于鏈路穩(wěn)定性加權(quán)的車(chē)載自組網(wǎng)按需路由協(xié)議[J];計(jì)算機(jī)應(yīng)用研究;2015年06期

3 陳振;韓江洪;翟琰;劉征宇;;車(chē)載自組網(wǎng)中基于分簇的無(wú)線(xiàn)功率控制[J];計(jì)算機(jī)應(yīng)用研究;2014年07期

4 張瑞鋒;;車(chē)載自組網(wǎng)通信技術(shù)研究綜述[J];汽車(chē)工程學(xué)報(bào);2014年02期

5 溫厚明;胡東;林孝康;;一種基于ZigBee協(xié)議的DSDV改進(jìn)型路由算法[J];電聲技術(shù);2013年10期

6 魏達(dá);王沿錫;王健;劉衍珩;鄧偉文;;車(chē)載自組網(wǎng)移動(dòng)模型綜述[J];計(jì)算機(jī)學(xué)報(bào);2013年04期

7 宋軍;楊露霞;孫建樂(lè);胡瑾瑜;;城市道路環(huán)境下的車(chē)載自組網(wǎng)分簇路由機(jī)制[J];重慶交通大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年01期

8 王國(guó)鋒;宋鵬飛;張?zhí)N靈;;智能交通系統(tǒng)發(fā)展與展望[J];公路;2012年05期

9 秦華標(biāo);肖志勇;;基于位置信息的穩(wěn)定分簇路由協(xié)議[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年06期

10 何俊婷;劉衍珩;王健;;一種高生存性的車(chē)載自組網(wǎng)可信路由協(xié)議[J];武漢大學(xué)學(xué)報(bào)(理學(xué)版);2010年02期

，

本文編號(hào)：1421856