本文選題：車(chē)載自組織網(wǎng)絡(luò)　切入點(diǎn)：多跳　出處：《南京郵電大學(xué)》2014年碩士論文

【摘要】：近幾年來(lái)，我國(guó)車(chē)輛數(shù)量的快速增長(zhǎng)給城市交通帶來(lái)了很多問(wèn)題，這使得車(chē)載自組織網(wǎng)絡(luò)技術(shù)越來(lái)越受到人們的關(guān)注。通過(guò)車(chē)輛間自由的組網(wǎng)通信，車(chē)載自組織網(wǎng)絡(luò)能夠?qū)崿F(xiàn)交通安全信息、道路狀況信息和娛樂(lè)消息等的實(shí)時(shí)高效傳輸，解決行車(chē)安全、道路擁堵等問(wèn)題。然而，由于車(chē)載自組織網(wǎng)絡(luò)獨(dú)特的網(wǎng)絡(luò)特性以及各種各樣的應(yīng)用所需的性能指標(biāo)不同，使得設(shè)計(jì)出適用于所有場(chǎng)景的消息分發(fā)算法變得十分困難。本文主要研究車(chē)載自組織網(wǎng)絡(luò)中不同應(yīng)用場(chǎng)景下基于多跳的消息分發(fā)算法，主要研究工作包括以下內(nèi)容： 首先，針對(duì)車(chē)載自組織網(wǎng)絡(luò)中與交通安全、交通狀況相關(guān)的應(yīng)用場(chǎng)景，本文對(duì)基于鄰居信息的廣播機(jī)制進(jìn)行改進(jìn)，提出一種多跳廣播抑制算法NIMBS，利用車(chē)輛的鄰居信息同時(shí)結(jié)合車(chē)輛的位置、行駛速度和方向形成鄰居節(jié)點(diǎn)的有序序列，并最終確定接收車(chē)輛的轉(zhuǎn)發(fā)等待時(shí)間。仿真結(jié)果表明該算法相比于類(lèi)似抑制算法具有更低的數(shù)據(jù)包丟失率和時(shí)延，，有效地解決了廣播算法存在的可擴(kuò)展性、數(shù)據(jù)傳輸冗余以及廣播風(fēng)暴等問(wèn)題。 其次，在道路處于自由連通狀態(tài)的前提下，研究了基于車(chē)輛速度的多車(chē)道連通概率分析模型。該模型將實(shí)際的多車(chē)道場(chǎng)景轉(zhuǎn)換成每車(chē)道以相同速度行駛的虛擬多車(chē)道場(chǎng)景，并根據(jù)前人的分析結(jié)果推導(dǎo)出確切的道路連通概率計(jì)算表達(dá)式。經(jīng)過(guò)大量的仿真實(shí)驗(yàn)，結(jié)果表明基于車(chē)輛速度的多車(chē)道連通概率分析模型與實(shí)際情況的趨勢(shì)保持一致。 最后，針對(duì)單播等端到端的消息分發(fā)場(chǎng)景，本文在上述分析模型基礎(chǔ)上提出一種基于連通度概率感知的多跳消息分發(fā)算法CPAM。宏觀層次上，算法關(guān)注網(wǎng)絡(luò)連通度，利用基于車(chē)輛速度的多車(chē)道的分析模型計(jì)算各路段的連通概率，選擇連通度高的路段進(jìn)行消息的分發(fā)過(guò)程。而微觀層次上，算法利用基于鄰居信息的多跳廣播抑制算法進(jìn)行各路段的數(shù)據(jù)包傳輸，快速地將數(shù)據(jù)包從路段入口轉(zhuǎn)發(fā)到路段出口。仿真結(jié)果表明，CPAM在數(shù)據(jù)包交付率以及時(shí)延性能上均優(yōu)于帶緩存的GPSR協(xié)議。
[Abstract]:In recent years, the rapid growth of the number of vehicles in China has brought a lot of problems to the urban traffic, which makes the vehicle-borne ad hoc network technology more and more attention.Through the free network communication between vehicles, the vehicle-borne ad hoc network can realize the real-time and efficient transmission of traffic safety information, road condition information and entertainment information, and solve the problems of traffic safety, road congestion and so on.However, due to the unique network characteristics of vehicle-mounted ad hoc networks and the different performance indicators required by various applications, it is very difficult to design a message distribution algorithm suitable for all scenarios.In this paper, we mainly study the multi-hop message distribution algorithm in different application scenarios in vehicle-borne ad hoc networks. The main research work includes the following contents:First of all, this paper improves the broadcast mechanism based on neighbor information in view of the application scenarios related to traffic safety and traffic conditions in the vehicle-borne ad hoc network.A multi-hop broadcast suppression algorithm (NIMBSs) is proposed, in which the neighbor information of the vehicle is combined with the vehicle location, speed and direction to form an ordered sequence of neighbor nodes, and the forwarding waiting time of the receiving vehicle is finally determined.The simulation results show that the proposed algorithm has lower packet loss rate and delay than the similar suppression algorithm, and effectively solves the scalability, data transmission redundancy and broadcast storm problems of the broadcast algorithm.Secondly, the multi-lane connectivity probability analysis model based on vehicle speed is studied under the condition that the road is in a free connectivity state.The model converts the actual multi-lane scene into a virtual multi-lane scenario with the same speed of each lane, and deduces the exact expression of the road connectivity probability based on the previous analysis results.After a lot of simulation experiments, the results show that the multi-lane connectivity probability analysis model based on vehicle speed is consistent with the actual situation.Finally, for the end-to-end message distribution scenario of unicast, this paper proposes a multi-hop message distribution algorithm CPAM based on connectivity probability perception based on the above analysis model.At the macro level, the algorithm focuses on network connectivity, uses the multi-lane analysis model based on vehicle speed to calculate the connectivity probability of each section, and selects the section with high connectivity to distribute messages.At the micro level, the algorithm uses the multi-hop broadcast suppression algorithm based on neighbor information to transmit the data packets from the entrance to the exit of the section.The simulation results show that the GPSR protocol is superior to the GPSR protocol in packet delivery rate and delay performance.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：U495;U463.67

【參考文獻(xiàn)】

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

1 張利鋒;金蓓弘;禚偉;;車(chē)載自組織網(wǎng)絡(luò)中一種連通度感知的可靠數(shù)據(jù)分發(fā)機(jī)制[J];計(jì)算機(jī)學(xué)報(bào);2013年04期

2 劉業(yè);吳國(guó)新;;基于802.11p/WAVE的車(chē)聯(lián)網(wǎng)連通性模型及其應(yīng)用研究[J];通信學(xué)報(bào);2013年06期

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

1 謝旭;車(chē)載自組網(wǎng)的通信策略與協(xié)議技術(shù)研究[D];華中科技大學(xué);2010年

本文編號(hào)：1722860