本文關(guān)鍵詞： 車聯(lián)網(wǎng) 社交網(wǎng)絡(luò) 路由機(jī)制 社區(qū)劃分　出處：《東北大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：VANET (Vehicular Ad Hoc Networks)是近期興起的一項(xiàng)致力于改善車輛安全、交通暢通、駕駛?cè)伺c乘客的便捷與舒適體驗(yàn),且有著較好應(yīng)用前景的研究領(lǐng)域。其中,路由問題無疑是這一領(lǐng)域的研究熱點(diǎn)。同時,MSN (Moblie Social Network)作為在分布式條件下利用社交關(guān)系保證信息傳遞的網(wǎng)絡(luò),其技術(shù)與理論的不斷成熟與廣泛的應(yīng)用使其成為解決分布式無線路由的主流方法。由于VANET中同樣存在社交關(guān)系,因此,本文將MSN中使用社交關(guān)系進(jìn)行路由的方法應(yīng)用于VANET中,以達(dá)到提高VANET中信息高效傳輸?shù)哪康摹１疚膶ANET路由分為軌跡交通路由和非軌跡交通路由兩種情況,并分別對這兩種情況進(jìn)行社區(qū)劃分,然后依據(jù)社區(qū)劃分的結(jié)果針對不同消息選擇社區(qū)外路由或社區(qū)內(nèi)路由。在軌跡交通路由中,考慮到網(wǎng)絡(luò)節(jié)點(diǎn)移動的規(guī)律性導(dǎo)致其相遇時間的周期性,利用分布式k-clique算法對其進(jìn)行社區(qū)劃分,將感知互動強(qiáng)度和分布式介度集中度分別作為社區(qū)外路由和社區(qū)內(nèi)路由的主要依據(jù),同時結(jié)合節(jié)點(diǎn)間信號強(qiáng)度和貢獻(xiàn)值對消息進(jìn)行路由。在非軌跡交通中,考慮到節(jié)點(diǎn)移動是由其興趣取向所引導(dǎo)的,本文利用節(jié)點(diǎn)間的興趣匹配程度對網(wǎng)絡(luò)內(nèi)節(jié)點(diǎn)進(jìn)行社區(qū)劃分；在社區(qū)外路由機(jī)制中,主要考慮消息的目的節(jié)點(diǎn)與相遇節(jié)點(diǎn)的興趣匹配度對消息的引導(dǎo)作用,并同時考慮節(jié)點(diǎn)間的信號強(qiáng)度與貢獻(xiàn)值；在社區(qū)內(nèi)路由機(jī)制中,根據(jù)節(jié)點(diǎn)在不同興趣上與消息目的節(jié)點(diǎn)的匹配程度,生成無交叉路徑進(jìn)行消息的平行多路發(fā)送,以達(dá)到快速交付的目的。同時,在非軌跡交通中,針對消息的目的節(jié)點(diǎn)是其攜帶節(jié)點(diǎn)的社區(qū)外成員,而當(dāng)前攜帶消息的節(jié)點(diǎn)接觸范圍內(nèi)卻都是其社區(qū)成員的情況,本文采用最佳鄰居機(jī)制配合由蝙蝠算法得到的啟發(fā)機(jī)制予以解決。與此同時,為了有效管理節(jié)點(diǎn)的消息緩存,本文設(shè)計(jì)了基于人類社會關(guān)系的緩存處理機(jī)制：在消息緩存機(jī)制中,同時考慮了人與人之間的親疏關(guān)系以及相互的貢獻(xiàn)程度,將這兩個因素同時作為消息緩存排序的依據(jù),以達(dá)到交付概率大的消息優(yōu)先被處理的目的。本文對上述面向車聯(lián)網(wǎng)的社交型路由機(jī)制進(jìn)行了仿真實(shí)現(xiàn),與基準(zhǔn)機(jī)制在多個指標(biāo)上進(jìn)行了性能對比,并且對機(jī)制的結(jié)果進(jìn)行了客觀的分析。仿真和評價(jià)結(jié)果表明本文提出的路由機(jī)制是可行且有效的。
[Abstract]:VANET vehicle Ad Hoc Networks (Ad Hoc Networks) is a recent development that aims to improve vehicle safety and traffic flow. The convenient and comfortable experience of drivers and passengers, and has a good application prospects in the research field, among which, the routing problem is undoubtedly the research hotspot in this field. At the same time. MSN Social Network acts as a network that uses social relationships to ensure the delivery of information under distributed conditions. With the development of technology and theory and its wide application, it has become the mainstream method to solve distributed wireless routing. Because there are social relations in VANET, so. This article applies the social relationship routing method in MSN to VANET. In order to improve the efficient transmission of information in VANET, this paper divides the VANET routing into two situations: track traffic route and non-track traffic route. Then, according to the results of community division, we choose the out-of-community routing or intra-community routing for different messages. In the path traffic routing, considering the regularity of the network node movement, the periodicity of the encounter time is taken into account. The distributed k-clique algorithm is used to divide the community, and the perceptual interaction intensity and the distributed media concentration are regarded as the main basis of the out-of-community routing and intra-community routing, respectively. At the same time, the message is routed by combining the signal strength and contribution value between nodes. In non-track traffic, it is considered that the node movement is guided by its interest orientation. This paper uses the degree of interest matching between nodes to divide the community of nodes in the network. In the out-of-community routing mechanism, the interest matching between the destination node and the encounter node is considered to guide the message, and the signal strength and contribution between the nodes are also considered. In the intra-community routing mechanism, according to the matching degree between the nodes in different interests and the message destination node, the parallel multipath is generated to send messages without cross paths, so as to achieve the purpose of rapid delivery. At the same time. In the off-track traffic, the destination node of the message is the outside member of its carrying node, but the current nodes carrying the message are all members of the community in the contact range. In this paper, the best neighbor mechanism combined with the heuristic mechanism obtained by bat algorithm is used to solve the problem. At the same time, in order to effectively manage the message cache of nodes. In this paper, we design a cache processing mechanism based on human social relations: in the message caching mechanism, we also consider the relationship between people and the degree of mutual contribution. These two factors are taken as the basis of message cache ranking, so that the message with high delivery probability can be processed first. In this paper, the above social routing mechanism for vehicle networking is simulated and implemented. The results of simulation and evaluation show that the proposed routing mechanism is feasible and effective.
【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：U495;TN929.5;TP391.44

【相似文獻(xiàn)】

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

1 李靜;劉旭東;林學(xué)練;黃子乘;;主動對等計(jì)算系統(tǒng)的路由機(jī)制[J];北京航空航天大學(xué)學(xué)報(bào);2008年03期

2 陶永臻;王興偉;尹飛;黃敏;;一種無連接QoS路由機(jī)制[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年S2期

3 吳海博;徐明偉;;ForCES體系結(jié)構(gòu)下路由器內(nèi)部路由機(jī)制[J];清華大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年01期

4 王興偉;陳默;高楠;黃敏;;NGI中一種QoS重路由機(jī)制[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年03期

5 徐鶴;王汝傳;韓志杰;;一種基于分組的P2P網(wǎng)絡(luò)安全路由算法[J];南京師范大學(xué)學(xué)報(bào)(工程技術(shù)版);2008年04期

6 于忠濤;劉興偉;;Pastry網(wǎng)絡(luò)模型的路由機(jī)制及改進(jìn)[J];西華大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年01期

7 ;[J];;年期

相關(guān)會議論文 前2條

1 黃誠;周明天;葉科;;基于內(nèi)容尋址網(wǎng)絡(luò)的Peer-to-Peer SIP路由機(jī)制研究[A];四川省通信學(xué)會2006年學(xué)術(shù)年會論文集（二）[C];2006年

2 余林琛;廖小飛;;一種新的應(yīng)用層對等路由機(jī)制的研究[A];2008年全國開放式分布與并行計(jì)算機(jī)學(xué)術(shù)會議論文集(上冊)[C];2008年

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

1 孫亮;面向服務(wù)的網(wǎng)絡(luò)體系結(jié)構(gòu)和路由機(jī)制研究[D];北京交通大學(xué);2013年

2 曲磊;有結(jié)構(gòu)P2P網(wǎng)絡(luò)中一跳路由機(jī)制的研究[D];北京郵電大學(xué);2011年

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

1 常宏偉;基于預(yù)期的機(jī)會社會網(wǎng)絡(luò)路由機(jī)制[D];中北大學(xué);2016年

2 石峻嶺;面向車聯(lián)網(wǎng)的社交型路由機(jī)制設(shè)計(jì)與仿真實(shí)現(xiàn)[D];東北大學(xué);2014年

3 滿鑫;信息中心網(wǎng)絡(luò)綠色QoS路由機(jī)制的設(shè)計(jì)與仿真實(shí)現(xiàn)[D];東北大學(xué);2014年

4 王彤;云聯(lián)網(wǎng)環(huán)境中服務(wù)路由機(jī)制的設(shè)計(jì)與仿真實(shí)現(xiàn)[D];東北大學(xué);2014年

5 李宇昂;機(jī)會網(wǎng)絡(luò)中基于計(jì)劃的路由機(jī)制研究與改進(jìn)[D];廣東工業(yè)大學(xué);2014年

6 李程;面向無線Mesh網(wǎng)多終端協(xié)同的業(yè)務(wù)控制與路由機(jī)制研究[D];北京郵電大學(xué);2015年

7 ADJOU MOUMOUNI IBRAHIM JAMES;[D];湖南大學(xué);2012年

8 周青松;基于JXTA協(xié)議的層次性點(diǎn)對點(diǎn)搜索的查詢路由機(jī)制研究[D];大連理工大學(xué);2005年

9 張琳;JXTA路由機(jī)制的研究與監(jiān)測[D];北京郵電大學(xué);2006年

10 陳強(qiáng);基于螞蟻網(wǎng)絡(luò)和蜂群的自組織QoS路由機(jī)制的設(shè)計(jì)與實(shí)現(xiàn)[D];東北大學(xué);2008年

，

本文編號：1461268