本文選題：車載自組織網(wǎng)絡(luò)　切入點(diǎn)：城市場(chǎng)景　出處：《蘭州理工大學(xué)》2017年碩士論文

【摘要】：車載自組織網(wǎng)絡(luò)為解決交通的擁堵問(wèn)題、提高車輛駕駛的安全性、安全預(yù)警等方面提供了新的思路。在車載網(wǎng)絡(luò)中,路由協(xié)議是核心技術(shù)。與傳統(tǒng)的ad hoc網(wǎng)絡(luò)相比,其具有很多的獨(dú)特性。這也使得車載自組網(wǎng)路由協(xié)議的研究具有一定的難度。其中,如何考慮車載自組織網(wǎng)絡(luò)復(fù)雜的場(chǎng)景,是設(shè)計(jì)路由協(xié)議時(shí)亟需解決的一個(gè)問(wèn)題。本文以城市環(huán)境為背景,對(duì)車載自組網(wǎng)路由協(xié)議和場(chǎng)景模型展開研究,完成了三點(diǎn)研究?jī)?nèi)容:1.傳統(tǒng)的隨機(jī)路點(diǎn)模型簡(jiǎn)單易用,但是不能反映較為真實(shí)的交通場(chǎng)景,對(duì)路由協(xié)議的性能評(píng)價(jià)缺乏一定的說(shuō)服力。因此,本文以Vanet Mobisim交通流軟件中的IDM_IM模型為基礎(chǔ),建立了能夠反映真實(shí)車輛運(yùn)動(dòng)規(guī)律的場(chǎng)景模型。通過(guò)仿真,分析了該模型的可靠性,為后續(xù)路由協(xié)議的性能評(píng)價(jià)提供了網(wǎng)絡(luò)載體。2.針對(duì)GPSR協(xié)議采用貪婪算法策略在城市場(chǎng)景中選擇轉(zhuǎn)發(fā)路徑時(shí)易出現(xiàn)局部最優(yōu)化的問(wèn)題,本文提出一種改進(jìn)的GPSR協(xié)議。該協(xié)議提出基于方向和密度輔助轉(zhuǎn)發(fā)的路由轉(zhuǎn)發(fā)策略。在新協(xié)議中,車輛可以獲取路段的實(shí)時(shí)車流密度和其與目的節(jié)點(diǎn)的靠近程度,從而在多個(gè)路段中選擇車流密度大且靠近目的節(jié)點(diǎn)的路段。仿真結(jié)果表明,改進(jìn)后的GPSR協(xié)議在路由開銷、路由延時(shí)、數(shù)據(jù)包轉(zhuǎn)發(fā)成功率方面優(yōu)于GPSR協(xié)議。3.針對(duì)城市場(chǎng)景中鏈路質(zhì)量不穩(wěn)定、路由轉(zhuǎn)發(fā)易受車流密度影響的問(wèn)題,本文提出了面向城市環(huán)境的角度矢量分簇選擇協(xié)議(VAC-BNR,Vector-angle-cluster and bridge nodes-based routing)。該協(xié)議首先將道路劃分十字路口區(qū)域和十字路口間的直線路段區(qū)域。在直線路段區(qū)域,依據(jù)車輛的移動(dòng)方向,將車輛劃分不同的簇群,再計(jì)算每個(gè)簇群內(nèi)節(jié)點(diǎn)的效用值,然后依據(jù)效用值設(shè)置節(jié)點(diǎn)轉(zhuǎn)發(fā)數(shù)據(jù)包的優(yōu)先級(jí);而在十字路口區(qū)域,計(jì)算車輛的穩(wěn)定因子,其包含車輛與周圍車輛的相對(duì)速度、距離信息。并選擇最穩(wěn)定的車輛作為十字路口區(qū)域的轉(zhuǎn)發(fā)節(jié)點(diǎn)。與其他同類協(xié)議相比,該協(xié)議在低車流密度下的分組轉(zhuǎn)發(fā)率明顯提高,同時(shí)路由開銷也得到了較好的控制。
[Abstract]:The vehicle-borne ad hoc network provides a new way to solve the traffic congestion, improve the safety of vehicle driving, and provide a new way of safety warning.In vehicle network, routing protocol is the core technology.Compared with the traditional ad hoc network, it has a lot of uniqueness.This also makes it difficult to study the routing protocol of vehicular ad hoc networks.Among them, how to consider the complex scenario of vehicular ad hoc network is an urgent problem to be solved in the design of routing protocol.In this paper, based on the background of urban environment, the routing protocol and scenario model of vehicular ad hoc network are studied, and three research contents: 1: 1 are completed.The traditional random routing model is simple and easy to use, but it can not reflect the real traffic scene, so it is not persuasive to evaluate the performance of routing protocol.Therefore, based on the IDM_IM model of Vanet Mobisim traffic flow software, a scene model which can reflect the real vehicle motion law is established.Through simulation, the reliability of the model is analyzed, which provides the network carrier. 2. 2 for the performance evaluation of subsequent routing protocols.In order to solve the problem of local optimization when GPSR adopts greedy algorithm strategy to select forwarding paths in urban scenarios, an improved GPSR protocol is proposed in this paper.This protocol proposes a routing forwarding strategy based on directional and density assisted forwarding.In the new protocol, the vehicle can obtain the real-time traffic density and its proximity to the destination node, and then select the section with high traffic density and close to the destination node.Simulation results show that the improved GPSR protocol is better than GPSR protocol in routing overhead, routing delay and packet forwarding success rate.Aiming at the problem of unstable link quality in urban scenarios and traffic density affecting routing and forwarding, this paper proposes an angle vector clustering protocol (VAC-BNRN) for Vector-angle-cluster and bridge nodes-based routing.The agreement first divides the road into the intersection area and the straight section area between the intersections.In the straight section area, according to the moving direction of the vehicle, the vehicle is divided into different clusters, then the utility value of the nodes in each cluster is calculated, and the priority of forwarding packets is set according to the utility value.The stability factor of the vehicle is calculated, which contains the relative velocity and distance information between the vehicle and the surrounding vehicle.The most stable vehicle is chosen as the forwarding node in the intersection area.Compared with other similar protocols, the packet forwarding rate under low traffic density is significantly improved, and the routing overhead is also well controlled.
【學(xué)位授予單位】：蘭州理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN929.5;U495

【參考文獻(xiàn)】

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

1 吳黎兵;聶雷;劉冰藝;吳妮;鄒逸飛;葉璐瑤;;一種VANET環(huán)境下的智能交通信號(hào)控制方法[J];計(jì)算機(jī)學(xué)報(bào);2016年06期

2 李超;韓江洪;魏振春;衛(wèi)星;;VANET場(chǎng)景下的GPSR-R路由算法[J];合肥工業(yè)大學(xué)學(xué)報(bào)(自然科學(xué)版);2015年02期

3 程嘉朗;倪巍;吳維剛;曹建農(nóng);李宏建;;車載自組織網(wǎng)絡(luò)在智能交通中的應(yīng)用研究綜述[J];計(jì)算機(jī)科學(xué);2014年S1期

4 周美麗;余敏;;基于車流密度的VANETs路由協(xié)議[J];傳感器與微系統(tǒng);2014年04期

5 鄭征;李云飛;嚴(yán)建峰;趙永杰;;基于錨節(jié)點(diǎn)的車載網(wǎng)地理路由算法[J];計(jì)算機(jī)應(yīng)用;2013年12期

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

7 孟金濤;苑建蕊;馮圣中;譚連生;;Power Adjusting Algorithm:A New Cross-Layer Power Saving Mechanism for Mobile Ad-Hoc Networks[J];Journal of Computer Science & Technology;2013年01期

8 陳桂香;;國(guó)外智能交通系統(tǒng)的發(fā)展情況[J];中國(guó)安防;2012年06期

9 于海寧;張宏莉;;VANETs路由協(xié)議的研究進(jìn)展[J];電子學(xué)報(bào);2011年12期

10 樊凱;魏茜;陳瑩;龍冬陽(yáng);;網(wǎng)絡(luò)仿真器NS2無(wú)線模型的網(wǎng)絡(luò)編碼擴(kuò)展[J];系統(tǒng)仿真學(xué)報(bào);2011年09期

，

本文編號(hào)：1717563