本文選題：車聯(lián)網(wǎng) + 路側(cè)單元�。� 參考：《大連理工大學(xué)》2014年碩士論文

【摘要】：隨著車輛所攜帶的無線移動(dòng)設(shè)備的大量增加,出現(xiàn)了車聯(lián)網(wǎng)應(yīng)用技術(shù)來更好的組織和管理道路上車輛所形成的無線網(wǎng)絡(luò)。車聯(lián)網(wǎng)以改善交通安全狀況、提高運(yùn)輸效率、方便人們出行為目標(biāo),對未來的交通系統(tǒng)產(chǎn)生深遠(yuǎn)的影響。車聯(lián)網(wǎng)己成為智能交通領(lǐng)域研究的新熱點(diǎn),受到國際工業(yè)界和學(xué)術(shù)界的共同關(guān)注,已有越來越多的研究人員投入到車聯(lián)網(wǎng)研究當(dāng)中。其中車聯(lián)網(wǎng)的信息傳輸機(jī)制對支持各類交通安全及娛樂相關(guān)應(yīng)用具有重要意義。 車聯(lián)網(wǎng)中實(shí)現(xiàn)高效的信息傳輸機(jī)制具有非常大的挑戰(zhàn)性,需要考慮交通環(huán)境中車輛節(jié)點(diǎn)快速移動(dòng)及稠密交通數(shù)據(jù)冗余等實(shí)際特性和約束。在眾多車聯(lián)網(wǎng)信息分發(fā)策略研究中,Waild等人提出一種路側(cè)單元之間協(xié)作的合作式車路通信模型,該模型中設(shè)計(jì)了一種充分發(fā)揮車輛間共享信息能力的路側(cè)單元協(xié)作策略,目的是提高網(wǎng)絡(luò)中傳輸數(shù)據(jù)的多樣性,并利用聯(lián)盟博弈(CGS)方法將骨干網(wǎng)中的路側(cè)單元?jiǎng)澐譃閰f(xié)作聯(lián)盟來協(xié)調(diào)管理,但是該策略需要成員對聯(lián)盟中其他所有成員有所貢獻(xiàn)才能加入聯(lián)盟,這樣帶來的不足是沒有考慮一個(gè)成員對某一聯(lián)盟中部分成員有貢獻(xiàn),而對剩余成員的影響可以忽略的情況。另有基于圖劃分理論的路側(cè)單元聯(lián)盟形成策略,聯(lián)盟內(nèi)部成員依賴路網(wǎng)拓?fù)潢P(guān)系進(jìn)行協(xié)作而不能更加靈活地協(xié)調(diào)各成員的協(xié)作關(guān)系。而且在單行路環(huán)境中因不能發(fā)掘相對行駛車輛共享信息的能力而變得低效。 針對以上問題,本文通過分析路側(cè)單元間協(xié)作通信特點(diǎn)提出基于遺傳算法的路側(cè)單元協(xié)作聯(lián)盟劃分(CFGA)策略,選擇合適的編碼方式充分表達(dá)骨干網(wǎng)路側(cè)單元的聯(lián)盟組成及聯(lián)盟內(nèi)部成員間的協(xié)作關(guān)系,保證種群初始化、選擇操作和交叉操作產(chǎn)生的個(gè)體是符合路網(wǎng)拓?fù)涞暮侠韨�(gè)體,并利用邊界基因變異有效實(shí)現(xiàn)解空間的局部搜索。針對路側(cè)單元間協(xié)作通信在單行路上的局限性提出車輛向后方共享信息的策略,利用集合覆蓋原理選擇共享中繼車輛使共享信息重復(fù)轉(zhuǎn)發(fā)次數(shù)降低。
[Abstract]:With the increasing number of wireless mobile devices carried by vehicles, the wireless network formed by vehicle networking technology has emerged to better organize and manage vehicles on the road. In order to improve traffic safety, improve transportation efficiency, and facilitate people to travel as the goal, it will have a profound impact on the future transportation system. Vehicle networking has become a new research hotspot in the field of intelligent transportation. It has attracted the common attention of the international industry and academia, and more researchers have been involved in the research of vehicle networking. The information transmission mechanism of vehicle network is of great significance to support all kinds of traffic safety and entertainment applications. The realization of efficient information transmission mechanism in vehicle networking is very challenging. It is necessary to consider the practical characteristics and constraints such as the rapid movement of vehicle nodes and the redundancy of dense traffic data in traffic environment. Waild et al put forward a cooperative vehicle-road communication model based on collaboration between road-side units in the study of information distribution strategies for vehicle networking. In this model, a collaborative strategy of road-side units is designed to give full play to the ability of sharing information among vehicles. The purpose of this paper is to improve the diversity of data transmission in the network, and to divide the roadside units in backbone network into cooperative alliances to coordinate the management by using the alliance game (CGS) method. However, the strategy requires members to contribute to all other members of the alliance to join the alliance, which brings the disadvantage that a member has no contribution to some members of a certain alliance, but the influence on the remaining members can be ignored. In addition, there is a strategy of forming road side unit alliance based on graph partition theory, in which the members of the alliance depend on the topological relationship of the road network for cooperation, but can not coordinate the cooperation relationship of each member more flexibly. Moreover, in the single-lane environment, it becomes inefficient because it is unable to explore the ability of sharing information relative to moving vehicles. In order to solve the above problems, this paper proposes a genetic algorithm-based cooperative alliance partition (CFGA) strategy for road-side units by analyzing the characteristics of collaborative communication between road-side units. Choosing the appropriate coding method can fully express the alliance composition of the road side unit of the backbone network and the cooperative relationship among the members of the alliance, so as to ensure the initialization of the population, the individuals generated by the selection operation and the cross operation are reasonable individuals in line with the network topology. And the boundary gene mutation is used to realize the local search of solution space effectively. In view of the limitation of cooperative communication between road side units in single route, a strategy of sharing information towards the rear of vehicles is proposed. The selection of shared relay vehicles based on the set coverage principle can reduce the number of retransmission of shared information.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U495;TN929.5;TP391.44

【參考文獻(xiàn)】

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

1 金弟;楊博;劉杰;劉大有;何東曉;;復(fù)雜網(wǎng)絡(luò)簇結(jié)構(gòu)探測——基于隨機(jī)游走的蟻群算法[J];軟件學(xué)報(bào);2012年03期

，

本文編號(hào)：2053776