【摘要】：車輛自組織網(wǎng)絡(luò)(Vehiclular Ad Hoc Networks,VANETs)是移動(dòng)自組織網(wǎng)絡(luò)的一個(gè)極具應(yīng)用價(jià)值的研究方向,也是智能交通系統(tǒng)領(lǐng)域的關(guān)鍵組成部分。VANETs以行駛的車輛和路邊基礎(chǔ)設(shè)施為節(jié)點(diǎn),節(jié)點(diǎn)之間可以進(jìn)行單跳或者多跳的通信,相互交換各自的節(jié)點(diǎn)信息,如節(jié)點(diǎn)速度和地理位置等,從而自發(fā)地形成一個(gè)Ad Hoc網(wǎng)絡(luò)。借助GPS、車載的傳感器等設(shè)備,車輛自組織網(wǎng)絡(luò)可以很方便的獲取節(jié)點(diǎn)的和道路的各種信息,給駕駛員提供導(dǎo)向、道路預(yù)警和網(wǎng)絡(luò)接入等服務(wù),不僅提高了駕駛員行駛的安全性,而且增加了駕駛舒適性。在城市道路環(huán)境中,網(wǎng)絡(luò)拓?fù)渥兓l繁、節(jié)點(diǎn)移動(dòng)受道路布局限制以及無(wú)線信號(hào)的傳輸受障礙物阻擋等問(wèn)題,使得VANETs中需要設(shè)計(jì)出更加復(fù)雜的路由協(xié)議。因此,設(shè)計(jì)出符合城市道路環(huán)境下VANETs特點(diǎn)的路由協(xié)議是個(gè)難點(diǎn)。本文針對(duì)VANETs的特點(diǎn),提出了一種基于路段長(zhǎng)度的交叉路口路由協(xié)議。在該協(xié)議中根據(jù)節(jié)點(diǎn)的位置,節(jié)點(diǎn)被分為普通節(jié)點(diǎn)和交叉路口節(jié)點(diǎn)兩種。該協(xié)議的大體思路是:當(dāng)前節(jié)點(diǎn)的交叉路口鄰居節(jié)點(diǎn)獲取相鄰路段的連通信息,如果存在連通的相鄰路段,在這些交叉路口鄰居節(jié)點(diǎn)中選擇距離目的節(jié)點(diǎn)最近的作為下一跳;否則,下一跳節(jié)點(diǎn)就為當(dāng)前節(jié)點(diǎn)鄰居表中距離目的節(jié)點(diǎn)最近的節(jié)點(diǎn),如此重復(fù)直到到達(dá)目的節(jié)點(diǎn)或者遇到局部最優(yōu)問(wèn)題。該協(xié)議中針對(duì)路段長(zhǎng)度小于無(wú)線信號(hào)通信半徑和路段長(zhǎng)度大于無(wú)線信號(hào)通信半徑兩種情況,分別采用不同的方法判斷路段的連通性。在路段長(zhǎng)度小于無(wú)線信號(hào)通信半徑時(shí),通過(guò)相鄰路段或者其延伸路段是否存在交叉路口鄰居節(jié)點(diǎn)的鄰居節(jié)點(diǎn)判斷路段的連通性;在路段長(zhǎng)度大于無(wú)線信號(hào)通信半徑時(shí),利用實(shí)時(shí)的分布式方法獲取路段的連通性。針對(duì)城市環(huán)境中由于建筑物的阻擋造成的頻繁網(wǎng)絡(luò)中斷問(wèn)題,本文提出了一種基于人工蛛網(wǎng)的地理位置路由協(xié)議。該協(xié)議中源節(jié)點(diǎn)利用GPS等導(dǎo)航設(shè)備獲得當(dāng)前節(jié)點(diǎn)和目的節(jié)點(diǎn)的地理位置、速度等信息,利用蜘蛛搜索電子地圖獲取搜索區(qū)域內(nèi)路段的拓?fù)湫畔⒑透鹘徊媛房诘牡乩砦恢眯畔ⅰ８鶕?jù)這些信息,源節(jié)點(diǎn)計(jì)算出到達(dá)目的節(jié)點(diǎn)的可行路徑;然后,源節(jié)點(diǎn)根據(jù)收到的廣播的各路段的連通、延遲和跳數(shù)等信息,計(jì)算各可行路徑的權(quán)重值之和,從中選擇最佳路徑;最后,源節(jié)點(diǎn)沿著最佳路徑發(fā)送數(shù)據(jù)包。如果遇到局部最優(yōu)問(wèn)題或者轉(zhuǎn)發(fā)失敗,當(dāng)前節(jié)點(diǎn)重新進(jìn)行計(jì)算,確定新的最佳路徑。
[Abstract]:Vehicle ad hoc network (Vehiclular Ad Hoc Networks,VANETs) is a valuable research direction of mobile ad hoc network, and it is also a key component in the field of intelligent transportation system. VANETs takes the driving vehicle and roadside infrastructure as the node. Single-hop or multi-hop communication can be carried out between nodes, and their respective node information, such as node speed and geographical location, can be exchanged with each other, so that a Ad Hoc network can be formed spontaneously. With the help of GPS, on-board sensors and other equipment, the vehicle self-organizing network can easily obtain all kinds of information about nodes and roads, and provide drivers with services such as guidance, road early warning and network access. It not only improves the safety of the driver, but also increases the driving comfort. In the urban road environment, the network topology changes frequently, the node movement is limited by the road layout and the wireless signal transmission is blocked by obstacles, which makes it necessary to design a more complex routing protocol in VANETs. Therefore, it is difficult to design a routing protocol which accords with the characteristics of VANETs in urban road environment. According to the characteristics of VANETs, a intersection routing protocol based on section length is proposed in this paper. In this protocol, according to the position of the node, the node is divided into two kinds: the ordinary node and the intersection node. The general idea of the protocol is as follows: the neighbor node of the current node obtains the connectivity information of the adjacent sections, and if there are connected adjacent sections, the nearest neighbor node to the destination node is selected as the next hop. Otherwise, the next hop node is the nearest node to the destination node in the current node neighbor table, so repeated until the destination node is reached or the local optimal problem is encountered. In this protocol, the connectivity of the section is judged by different methods when the length of the section is less than the radius of the wireless signal communication and the length of the section is larger than the radius of the communication of the wireless signal. When the length of the section is less than the radius of wireless signal communication, the connectivity of the road section is judged by whether there are neighbor nodes at the intersection or whether there are neighbor nodes in the adjacent section or its extended section. When the length of the road section is larger than the communication radius of the wireless signal, the real-time distributed method is used to obtain the connectivity of the road section. In order to solve the problem of frequent network outages caused by the blocking of buildings in urban environment, a geographical location routing protocol based on artificial spider web is proposed in this paper. In this protocol, the source node uses GPS and other navigation devices to obtain the geographical location and speed of the current node and destination node, and the spider search electronic map is used to obtain the topological information of the road section in the search area and the geographical location information of each intersection. According to these information, the source node calculates the feasible path to the destination node. Then, according to the information such as connectivity, delay and hop number of each section of the broadcast, the source node calculates the sum of the weight values of each feasible path and selects the best path. Finally, the source node sends packets along the best path. If you encounter a local optimal problem or a forwarding failure, the current node recalculates to determine the new optimal path.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U495

【相似文獻(xiàn)】

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

1 楊水根;張宏科;蘇偉;;基于掌形積分的路由協(xié)議仿真與性能分析[J];北京交通大學(xué)學(xué)報(bào);2006年02期

2 劉勇;林亞平;胡玉鵬;;無(wú)線傳感器網(wǎng)絡(luò)路由協(xié)議開(kāi)發(fā)及改進(jìn)[J];科學(xué)技術(shù)與工程;2007年19期

3 於時(shí)才;張冠陽(yáng);;基于綜合準(zhǔn)則的無(wú)線Mesh網(wǎng)絡(luò)跨層路由協(xié)議[J];蘭州理工大學(xué)學(xué)報(bào);2011年04期

4 蘇靜,郭偉;無(wú)線移動(dòng)自組織網(wǎng)路由協(xié)議綜述[J];中國(guó)測(cè)試技術(shù);2005年02期

5 沈強(qiáng);方旭明;;基于幀投遞率的無(wú)線Mesh網(wǎng)絡(luò)DSR路由協(xié)議[J];西南交通大學(xué)學(xué)報(bào);2007年02期

6 周賢善;;一種改進(jìn)的移動(dòng)Ad Hoc網(wǎng)絡(luò)分時(shí)路由協(xié)議研究[J];長(zhǎng)江大學(xué)學(xué)報(bào)(自科版)理工卷;2007年02期

7 胡曦;;Ad Hoc網(wǎng)絡(luò)中一種基于穩(wěn)定度的QoS路由協(xié)議[J];遼寧工業(yè)大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年04期

8 楊屹;孫耀文;杜海;;Ad hoc網(wǎng)絡(luò)中基于定期巡查機(jī)制的能量度量路由協(xié)議[J];硅谷;2012年04期

9 郝敬濤,黃建,楊莘元;解析區(qū)域內(nèi)路由協(xié)議IARP[J];應(yīng)用科技;2005年04期

10 楊鵬;李臘元;;一種基于移動(dòng)Ad hoc網(wǎng)絡(luò)的QoS路由協(xié)議[J];武漢理工大學(xué)學(xué)報(bào)(交通科學(xué)與工程版);2006年05期

相關(guān)會(huì)議論文 前10條

1 董陽(yáng)澤;劉平香;;水聲網(wǎng)絡(luò)自重組中兩種路由協(xié)議比較[A];2012'中國(guó)西部聲學(xué)學(xué)術(shù)交流會(huì)論文集(Ⅰ)[C];2012年

2 向征;方旭明;;無(wú)線Mesh網(wǎng)絡(luò)中路由協(xié)議的性能比較[A];'2006系統(tǒng)仿真技術(shù)及其應(yīng)用學(xué)術(shù)交流會(huì)論文集[C];2006年

3 孫墉懋;傅仲逑;;DSR路由協(xié)議優(yōu)化策略[A];2006北京地區(qū)高校研究生學(xué)術(shù)交流會(huì)——通信與信息技術(shù)會(huì)議論文集（上）[C];2006年

4 程曉峰;盧澤新;張曉哲;莫敦運(yùn);;基于路由協(xié)議支持的網(wǎng)絡(luò)感知的設(shè)計(jì)與實(shí)現(xiàn)[A];中國(guó)電子學(xué)會(huì)第十六屆信息論學(xué)術(shù)年會(huì)論文集[C];2009年

5 劉紅;徐光俠;范時(shí)平;;一種安全的無(wú)線自組織路由協(xié)議[A];2008年計(jì)算機(jī)應(yīng)用技術(shù)交流會(huì)論文集[C];2008年

6 宋玉林;樊祥寧;張?jiān)阼?;無(wú)線傳感器網(wǎng)絡(luò)能量路由協(xié)議的研究[A];2006北京地區(qū)高校研究生學(xué)術(shù)交流會(huì)——通信與信息技術(shù)會(huì)議論文集（上）[C];2006年

7 應(yīng)俊;吳哲夫;樂(lè)孜純;;基于OPNET的DSR路由協(xié)議的性能分析[A];浙江省電子學(xué)會(huì)2006年學(xué)術(shù)年會(huì)論文集[C];2006年

8 顏國(guó)風(fēng);王建新;;基于Hop的Anycast路由協(xié)議的設(shè)計(jì)與實(shí)現(xiàn)[A];2005通信理論與技術(shù)新進(jìn)展——第十屆全國(guó)青年通信學(xué)術(shù)會(huì)議論文集[C];2005年

9 武崢;張淑芳;;無(wú)線傳感器網(wǎng)絡(luò)路由協(xié)議在交通監(jiān)控系統(tǒng)中的應(yīng)用[A];中國(guó)航海學(xué)會(huì)通信導(dǎo)航專業(yè)委員會(huì)2005年學(xué)術(shù)年會(huì)論文集[C];2005年

10 侍蕾;趙洪利;;空間信息網(wǎng)路由協(xié)議關(guān)鍵技術(shù)分析[A];2008通信理論與技術(shù)新發(fā)展——第十三屆全國(guó)青年通信學(xué)術(shù)會(huì)議論文集（下）[C];2008年

相關(guān)重要報(bào)紙文章 前7條

1 華為供稿;構(gòu)建遼寧移動(dòng)骨干網(wǎng)[N];計(jì)算機(jī)世界;2001年

2 中科院計(jì)算所信息網(wǎng)絡(luò)室 龐迪;移動(dòng)自組織網(wǎng)絡(luò)的關(guān)鍵技術(shù)—路由協(xié)議[N];計(jì)算機(jī)世界;2005年

3 金樺;路由協(xié)議一樣影響速度[N];中國(guó)計(jì)算機(jī)報(bào);2003年

4 朗訊貝爾實(shí)驗(yàn)室基礎(chǔ)科學(xué)研究院;融合網(wǎng)絡(luò)將主導(dǎo)一切[N];通信產(chǎn)業(yè)報(bào);2004年

5 ;寬帶網(wǎng)絡(luò)測(cè)試平臺(tái) ——Adtech AX/4000[N];網(wǎng)絡(luò)世界;2003年

6 ;三星secuiWALL 防火墻讓網(wǎng)絡(luò)永不停息[N];中國(guó)計(jì)算機(jī)報(bào);2002年

7 甄巖邋武穆清;無(wú)處不在的無(wú)線Mesh網(wǎng)絡(luò)[N];中國(guó)計(jì)算機(jī)報(bào);2007年

，

本文編號(hào)：2492423