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

【摘要】：目前隨著車(chē)載自組織網(wǎng)和物聯(lián)網(wǎng)的發(fā)展和標(biāo)準(zhǔn)的不斷完善，人們除了應(yīng)用車(chē)載自組織網(wǎng)解決行車(chē)交通安全外，對(duì)于車(chē)載數(shù)據(jù)信息服務(wù)的商業(yè)開(kāi)發(fā)越來(lái)越感興趣。當(dāng)前的智能交通系統(tǒng)主要基于已經(jīng)廣泛應(yīng)用的2G/3G網(wǎng)絡(luò)或應(yīng)用于車(chē)輛間的車(chē)輛專(zhuān)用短距離通信（DSRC，Dedicated Short Range Communications）為車(chē)輛數(shù)據(jù)信息服務(wù)。而這兩種通信方式都有其局限性：對(duì)于3G網(wǎng)絡(luò)而言，其在高速運(yùn)動(dòng)狀態(tài)下數(shù)據(jù)傳輸速度并不理想且服務(wù)價(jià)格昂貴（下載大型文件數(shù)據(jù)）；而專(zhuān)門(mén)針對(duì)高速移動(dòng)的車(chē)載環(huán)境通信的DSRC與路邊接入點(diǎn)通信下載數(shù)據(jù)信息，數(shù)據(jù)傳輸速度很快，但受限于路邊接入點(diǎn)的覆蓋范圍有限和初始階段接入點(diǎn)布置數(shù)量有限的問(wèn)題，導(dǎo)致網(wǎng)絡(luò)連接總是時(shí)斷時(shí)續(xù)。無(wú)法保證持續(xù)高質(zhì)量的網(wǎng)絡(luò)連接。為了克服以上車(chē)載自組織網(wǎng)中分發(fā)常用內(nèi)容（是指那些大多數(shù)車(chē)輛下載都感興趣的常用的商業(yè)服務(wù)類(lèi)應(yīng)用的大型多媒體文件內(nèi)容）遇到的困難，車(chē)輛間合作下載的方式應(yīng)運(yùn)而生。 首先，本文改進(jìn)了車(chē)輛間合作下載模型，將網(wǎng)絡(luò)編碼方法應(yīng)用到數(shù)據(jù)分發(fā)過(guò)程。道路上位置臨近的車(chē)輛形成車(chē)輛簇，簇內(nèi)車(chē)輛相互合作下載，同時(shí)利用了廣覆蓋的移動(dòng)2G/3G網(wǎng)絡(luò)作為控制信道，簇內(nèi)車(chē)輛通過(guò)路邊接入點(diǎn)進(jìn)行車(chē)與路邊基礎(chǔ)設(shè)施通信（V2I，Vehicle-to-Infrastructure）通信的高數(shù)據(jù)下載率，提高了車(chē)輛的平均下載速率縮短了下載時(shí)間。 其次，本文主要關(guān)注V2I分組數(shù)據(jù)分發(fā)過(guò)程，將網(wǎng)絡(luò)編碼方法應(yīng)用到該數(shù)據(jù)分發(fā)過(guò)程中，與傳統(tǒng)的基于隨機(jī)和基于反饋方法兩種V2I數(shù)據(jù)分發(fā)方法相比減少了數(shù)據(jù)間的重復(fù)冗余，并且不需要上傳分組目錄信息網(wǎng)絡(luò)開(kāi)銷(xiāo)小。 最后，對(duì)這3種方法分別進(jìn)行了數(shù)學(xué)推導(dǎo)，，計(jì)算出了各自完成下載所需的平均時(shí)間。通過(guò)數(shù)學(xué)分析及仿真驗(yàn)證說(shuō)明，相比于基于隨機(jī)和反饋方式，基于網(wǎng)絡(luò)編碼的數(shù)據(jù)分發(fā)方法效率最高且網(wǎng)絡(luò)開(kāi)銷(xiāo)最小。
[Abstract]:At present, with the development of vehicle-borne ad hoc networks and Internet of things and the continuous improvement of standards, in addition to the application of vehicular ad hoc networks to solve traffic safety, There is growing interest in the commercial development of onboard data and information services. The current intelligent transportation system is based mainly on the already widely used 2G/3G network or dedicated short-range communication between vehicles (DSRC / dedicated Short Range communications) as the number of vehicles. According to information services. And both of these communication methods have their limitations: for 3G networks, The data transmission speed is not ideal and the service price is expensive under the condition of high speed motion (download large file data), while DSRC, which is dedicated to the high-speed mobile vehicular environment communication, communicates with the roadside access point to download the data information. The speed of data transmission is fast, but limited by the limited coverage of roadside access points and the limited number of access points in the initial phase. Results in a network connection that is always intermittent. There is no guarantee of continued high quality network connectivity. To overcome the distribution of common content in the above vehicular ad hoc networks (that is, those commonly used business clothes that are of interest to most vehicle downloads). The difficulties encountered by large multimedia file content in service applications, The mode of collaborative downloading between vehicles came into being. Firstly, the cooperative download model between vehicles is improved, and the network coding method is applied to the data distribution process. The vehicles near the road form a vehicle cluster, and the vehicles in the cluster cooperate to download each other. At the same time, using the widely covered mobile 2G/3G network as the control channel, the vehicles in the cluster can communicate with the roadside infrastructure through the roadside access point with high data download rate, which improves the average download rate of the vehicle and shortens the download time. Secondly, this paper mainly focuses on the V2I packet data distribution process, and applies the network coding method to the data distribution process. Compared with the traditional V2I data distribution methods based on random and feedback methods, it reduces the duplication of data. And no need to upload packet directory information network overhead. Finally, the mathematical derivation of the three methods is given, and the average time required to complete each download is calculated. The results of mathematical analysis and simulation show that, compared with the methods based on randomness and feedback, The data distribution method based on network coding has the highest efficiency and minimal network overhead.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：U495;TP391.44;TN929.5

【參考文獻(xiàn)】

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

1 常促宇;向勇;史美林;;車(chē)載自組網(wǎng)的現(xiàn)狀與發(fā)展[J];通信學(xué)報(bào);2007年11期

本文編號(hào)：1684090