本文關(guān)鍵詞： 車聯(lián)網(wǎng) 移動(dòng)感知網(wǎng)絡(luò) 數(shù)據(jù)聚集 延遲 精度　出處：《哈爾濱工業(yè)大學(xué)》2015年博士論文　論文類型：學(xué)位論文

【摘要】：隨著無(wú)線通信技術(shù)、信息傳感技術(shù)及自動(dòng)控制技術(shù)的快速發(fā)展,物聯(lián)網(wǎng)被廣泛應(yīng)用于農(nóng)業(yè)、交通、物流、家居等領(lǐng)域。作為物聯(lián)網(wǎng)在交通領(lǐng)域的重要應(yīng)用,車聯(lián)網(wǎng)為智能交通的實(shí)現(xiàn)提供了技術(shù)支持平臺(tái)。智能交通的許多應(yīng)用需要收集和分發(fā)大量實(shí)時(shí)信息,但車輛的移動(dòng)性使車聯(lián)網(wǎng)中收發(fā)信息所需要的通信資源頻繁變化,加之這些通信資源又非常有限,因此車聯(lián)網(wǎng)中的數(shù)據(jù)收集和分發(fā)是一項(xiàng)極具挑戰(zhàn)的工作。為了減少數(shù)據(jù)收發(fā)過(guò)程中傳輸數(shù)據(jù)量,研究者們引入了數(shù)據(jù)聚集技術(shù),該技術(shù)已成為車聯(lián)網(wǎng)領(lǐng)域中倍受學(xué)術(shù)界關(guān)注的研究熱點(diǎn)。雖然數(shù)據(jù)聚集可以節(jié)省數(shù)據(jù)傳輸中信帶資源的消耗,但也會(huì)影響數(shù)據(jù)的時(shí)延和精度。聚集數(shù)據(jù)的時(shí)延和精度直接影響車聯(lián)網(wǎng)上諸多應(yīng)用的正確性和有效性。本文研究車聯(lián)網(wǎng)的數(shù)據(jù)聚集問(wèn)題,主要工作及其成果包括以下幾個(gè)方面。首先,研究了時(shí)延約束的單信道車聯(lián)網(wǎng)數(shù)據(jù)聚集問(wèn)題。車聯(lián)網(wǎng)上許多應(yīng)用對(duì)感知數(shù)據(jù)的時(shí)延有很高要求,但現(xiàn)有研究無(wú)法使得聚集數(shù)滿足時(shí)延要求,且沒(méi)有有效利用連通鏈路信息使得時(shí)限內(nèi)聚集信息量較少。時(shí)延往往是由無(wú)線沖突引起的,如果能合理規(guī)劃傳輸時(shí)刻有效避免沖突,即可實(shí)現(xiàn)時(shí)延約束的聚集優(yōu)化。因此,本文提出了時(shí)延約束的單信道車聯(lián)網(wǎng)數(shù)據(jù)聚集問(wèn)題,即規(guī)劃無(wú)沖突的傳輸時(shí)刻以優(yōu)化聚集信息量。給出了該問(wèn)題的形式化定義,并證明其是NP難的。本文提出了一種時(shí)延約束的優(yōu)化聚集信息量算法。該算法的核心是如何避免數(shù)據(jù)傳輸過(guò)程中的無(wú)線沖突。無(wú)線沖突可分為兩類,一類是多節(jié)點(diǎn)同時(shí)向同一節(jié)點(diǎn)發(fā)送數(shù)據(jù)引起的沖突,被稱為直接沖突;另一類是節(jié)點(diǎn)在接收數(shù)據(jù)時(shí)通信范圍內(nèi)存在其他節(jié)點(diǎn)干擾引起的沖突,被稱為間接沖突。為避免直接沖突,本文利用動(dòng)態(tài)規(guī)劃技術(shù)在候選時(shí)刻集上規(guī)劃節(jié)點(diǎn)的聚集傳輸時(shí)刻。為避免間接沖突,本文提出了基于匹配和獨(dú)立集的候選時(shí)刻集過(guò)濾技術(shù)。利用真實(shí)出租車軌跡數(shù)據(jù)集進(jìn)行了大量的實(shí)驗(yàn)。實(shí)驗(yàn)結(jié)果表明本文所提出的算法在同一時(shí)延界內(nèi)比現(xiàn)有的算法在數(shù)據(jù)收集率上提高了近20%,在平均傳輸數(shù)據(jù)量上減少至1/3,在平均時(shí)延上更加穩(wěn)定。其次,研究了時(shí)延約束的多信道車聯(lián)網(wǎng)數(shù)據(jù)聚集問(wèn)題。為了提高頻譜利用率,車聯(lián)網(wǎng)標(biāo)準(zhǔn)協(xié)議棧中引入多信道機(jī)制。與單信道不同,多信道采用頻分復(fù)用減少了無(wú)線沖突,但需要額外解決信道分配問(wèn)題。因此,本文提出了時(shí)延約束的多信道車聯(lián)網(wǎng)數(shù)據(jù)聚集規(guī)劃算法。該算法的基本思想是利用多信道資源避免間接沖突。其核心是規(guī)劃節(jié)點(diǎn)的路由使得節(jié)點(diǎn)的間接沖突數(shù)小于信道個(gè)數(shù)k進(jìn)而實(shí)現(xiàn)沖突節(jié)點(diǎn)采用不同信道規(guī)避間接沖突。本文首先基于貪心思想構(gòu)建k約束優(yōu)化聚集路由樹規(guī)劃節(jié)點(diǎn)的路由,然后利用動(dòng)態(tài)規(guī)劃技術(shù)規(guī)劃節(jié)點(diǎn)的傳輸時(shí)刻和傳輸信道。該時(shí)刻規(guī)劃可以得到最優(yōu)解。最后在真實(shí)軌跡數(shù)據(jù)集和模擬軌跡數(shù)據(jù)集上對(duì)本文提出的算法進(jìn)行了大量實(shí)驗(yàn)。結(jié)果表明本文的算法在數(shù)據(jù)收集率上比現(xiàn)有算法提高了25%,達(dá)到95%以上;在聚集效率上比現(xiàn)有算法提高了3倍以上。再次,研究了單一精度約束的車聯(lián)網(wǎng)數(shù)據(jù)聚集問(wèn)題。與時(shí)延約束不同,精度約束的數(shù)據(jù)聚集優(yōu)化核心是在滿足精度要求前提下利用數(shù)據(jù)的相關(guān)性降低傳輸數(shù)據(jù)量�，F(xiàn)有研究引入壓縮感知技術(shù)高效地壓縮數(shù)據(jù)量同時(shí)保證恢復(fù)的數(shù)據(jù)滿足精度要求,但壓縮感知技術(shù)的實(shí)現(xiàn)需要滿足有限等距約束條件,這意味著數(shù)據(jù)要依據(jù)特定方式進(jìn)行聚集。由于車聯(lián)網(wǎng)上的數(shù)據(jù)是由移動(dòng)車輛攜帶,數(shù)據(jù)的聚集方式受到車輛移動(dòng)的限制�，F(xiàn)有研究采用人工引入車輛控制移動(dòng)路線解決這一難題,但需要消耗大量資源且沒(méi)有利用車聯(lián)網(wǎng)已有的無(wú)線通信資源。因此,本文提出了車聯(lián)網(wǎng)上基于壓縮感知的精度約束數(shù)據(jù)聚集傳輸協(xié)議。該協(xié)議利用車之間的無(wú)線通信動(dòng)態(tài)調(diào)整移動(dòng)車輛攜帶的數(shù)據(jù)實(shí)現(xiàn)了滿足壓縮感知要求的數(shù)據(jù)聚集,進(jìn)而實(shí)現(xiàn)了精度約束的車聯(lián)網(wǎng)數(shù)據(jù)聚集傳輸。實(shí)驗(yàn)結(jié)果表明本文所提出的方法利用50%的數(shù)據(jù)量即可得到滿足精度要求的聚集數(shù)據(jù)。最后,研究了多精度約束的車聯(lián)網(wǎng)數(shù)據(jù)聚集問(wèn)題。由于車聯(lián)網(wǎng)中動(dòng)態(tài)可用帶寬資源有限,實(shí)時(shí)導(dǎo)航系統(tǒng)在收集實(shí)時(shí)路況信息時(shí)要在滿足多用戶的導(dǎo)航請(qǐng)求前提下降低傳輸數(shù)據(jù)量。導(dǎo)航請(qǐng)求的不均勻分布使得部分路段的數(shù)據(jù)精度影響較多用戶導(dǎo)航響應(yīng)的準(zhǔn)確性。聚集數(shù)據(jù)的精度決定了傳輸數(shù)據(jù)量。各路段基于各自的精度要求進(jìn)行數(shù)據(jù)聚集可以實(shí)現(xiàn)在滿足多用戶的導(dǎo)航請(qǐng)求前提下有效地降低傳輸數(shù)據(jù)量。與單精度不同,多精度的數(shù)據(jù)聚集需要獲取多精度要求,分發(fā)多精度聚集請(qǐng)求,以及多精度約束的數(shù)據(jù)聚集傳輸。因此,本文提出了車聯(lián)網(wǎng)上多精度約束的數(shù)據(jù)聚集傳輸協(xié)議。該協(xié)議首先通過(guò)求解精度抽取的幾何規(guī)劃問(wèn)題得到各路段聚集數(shù)據(jù)的精度要求,然后構(gòu)造各路段的帶有精度要求的數(shù)據(jù)聚集請(qǐng)求,最后根據(jù)各精度請(qǐng)求進(jìn)行數(shù)據(jù)聚集傳輸實(shí)現(xiàn)多精度約束的數(shù)據(jù)聚集。模擬實(shí)驗(yàn)結(jié)果表明該協(xié)議的數(shù)據(jù)收集率達(dá)到80%左右,比樸素方法提高了20%,消耗的帶寬資源為聚集數(shù)據(jù)量的2.5倍,比樸素方法降低了1/3以上。
[Abstract]:With the development of wireless communication technology, information sensing technology and rapid development of automatic control technology, networking is widely used in agriculture, transportation, logistics, and other fields. Home Furnishing things as an important application in the field of transportation, provides the technical support for the realization of intelligent transportation platform vehicle networking. Intelligent transportation and many applications need to collect and the distribution of a large number of real-time information, but the vehicle mobility makes vehicle communication resources necessary to send and receive information of the network changes frequently, and these communication resources are very limited, so the car networking in data collection and distribution is a very challenging work. In order to reduce the amount of data transmission in the process of sending and receiving data, researchers have introduced the data aggregation technology, the technology has become a vehicle networking in the field of research has been the focus of academic attention. Although the data gathered can save the data transmission with citic resources consumption, but Will also affect the delay and accuracy of data. The correctness and validity of the aggregation delay and accuracy directly affects the data car intranet for many applications. This paper studies the data aggregation of car networking, the main work and achievements are as follows. First, the single channel data of car networking delay constraint aggregation problem. Time delay of car combined application of many online sensing data have high requirements, but the existing research cannot satisfy the delay requirements of the aggregation number, and there is no effective use of link connectivity information makes less information gathered within the time limit. The delay is often caused by wireless conflict, if properly planning transmission time to effectively avoid conflict and realize the optimization of aggregation delay constraint. You can. Therefore, this article presents the problems of single channel data aggregation vehicle network delay constraints, namely the conflict free transmission time planning to optimize the gathered information. The formal definition of the problem is given, and prove that it is NP hard. This paper puts forward the optimization of a delay constrained information aggregation algorithm. The core of the algorithm is how to avoid the conflicts in the process of wireless data transmission. The wireless conflict can be divided into two categories, one is the conflict caused by sending data to multiple nodes the same node at the same time, known as direct conflict; the other is the node in the other node interference caused by the conflict of communication exist within the range of receiving data, known as indirect conflict. In order to avoid direct conflict, the transmission time aggregation node in the candidate set planning time using dynamic programming technology. In order to avoid indirect conflict in this paper, the candidate matching and moment independent sets of sets based on filtering technology. Using real taxi trajectory data sets for the experiments. The experimental results show that this proposed algorithm at the same time. Compared with the existing algorithm collection rate increased nearly 20% in the data, the average amount of data transmission to reduce 1/3, more stable in average delay. Secondly, multi channel data of car networking delay constraint aggregation problem. In order to improve the spectrum utilization, car networking into multi-channel mechanism in different standard protocol stack. With a single channel, multi channel using frequency division multiplexing to reduce wireless conflict, but need to solve the channel assignment problem. Therefore, this paper proposes a multi channel vehicle networking data delay constraint aggregation programming algorithm. The basic idea of the algorithm is the use of multi channel resources to avoid indirect conflict. Its core is the number of nodes makes routing planning indirect conflict node is less than the channel number k so as to realize the conflict between nodes by different channels to avoid indirect conflicts. Firstly, based on the greedy idea to construct the optimal aggregation routing tree node K constraint programming The route, then using the dynamic programming technology planning node transmission time and transmission channel. The time planning can get the optimal solution. Finally, in the real trajectory data set and simulated trajectory data sets for the algorithm proposed in this paper. A large number of experimental results show that this algorithm in the data collection rate than the existing algorithm increased by 25%. More than 95%; in the aggregation efficiency than the existing algorithm increases more than 3 times. Once again, the car networking data of single precision constraint aggregation problem. With delay constraint, constraint optimization precision data aggregation is the core in meet the precision request under the premise of using the correlation of data to reduce the amount of data transmission. The existing research into high efficiency to reduce the amount of data at the same time to ensure the recovery of data meet the accuracy requirements of compressed sensing technology, but the realization of compressed sensing technology to meet the needs of the restricted isometry constraints, this means A data according to the specific way of gathering. Because the car Internet data is carried by the mobile vehicle, the data gathered by the mobile vehicle restrictions. The existing research into vehicle control using artificial mobile route to solve this problem, but requires wireless communication resources consume a lot of resources without the help of the car networking. Therefore, this paper presents the accuracy of car networking constraints based on compressed sensing data transmission protocol. The protocol uses aggregation vehicle wireless communications between mobile vehicle dynamic adjustment carry data can meet the requirements of the compressed sensing data aggregation, and then realizes the transmission accuracy of aggregation constraints of car networking data. Experimental results show that the method proposed in this paper are met gather data accuracy using the data quantity to 50%. Finally, car networking data on multiple precision constraint aggregation problem. Because the car network dynamic available bandwidth is limited, real-time navigation system to reduce the amount of data transmission in the premise to meet the user's navigation request in the collection of real-time traffic information. The uneven distribution of the navigation request sections of the data affects the accuracy of user navigation more response accuracy. Aggregate data determines the accuracy of the amount of data transmission. Each section of their precision requirements for data aggregation can effectively reduce the amount of data transmission in the premise to meet the user's navigation request. Based on the different with single precision, multi precision data aggregation needs to get more precision, distributed multi precision aggregation request, and the accuracy of constrained data aggregation transmission. Therefore, this paper puts forward multi precision constrained data aggregation protocol. This protocol has car networking sections first through the geometric programming problem solving precision extraction The aggregation data accuracy requirements, and then construct the sections with the accuracy requirements of the data aggregation request, according to the request of data collection and transmission accuracy for multi precision constrained data aggregation. The simulation results show that the protocol of the data collection rate reached 80%, 20% higher than the naive method, consumption of bandwidth resources for 2.5 times the amount of data aggregation, reduce the 1/3 more than the naive method.

【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2015
【分類號(hào)】：U495;TP391.44;TN929.5

【相似文獻(xiàn)】

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

1 李磊;李鳳榮;黃河清;;無(wú)線傳感器網(wǎng)絡(luò)局部瓶頸節(jié)點(diǎn)的分布式檢測(cè)算法[J];西南交通大學(xué)學(xué)報(bào);2011年03期

2 賈杰;陳劍;常桂然;趙林亮;;無(wú)線傳感器網(wǎng)絡(luò)中最優(yōu)覆蓋節(jié)點(diǎn)集的求解算法[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年11期

3 武勝,武振宇;一桿等寬K型間隙方管節(jié)點(diǎn)靜力工作性能研究[J];哈爾濱工業(yè)大學(xué)學(xué)報(bào);2003年05期

4 張向亮;呂飛鵬;張向軍;鄧豐強(qiáng);肖飛;張新峰;趙美琳;;考慮節(jié)點(diǎn)電氣介數(shù)的多組同基最小斷點(diǎn)集選取方法[J];中國(guó)電力;2012年06期

5 趙海;劉怡文;艾均;賈思媛;;IP級(jí)拓?fù)湫律c消亡節(jié)點(diǎn)的特征[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年09期

6 李曉林;王勁林;尤佳莉;;P2P直播系統(tǒng)中節(jié)點(diǎn)啟動(dòng)過(guò)程優(yōu)化[J];四川大學(xué)學(xué)報(bào)(工程科學(xué)版);2013年04期

7 ;[J];;年期

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

1 許曉榮;章堅(jiān)武;黃愛蘋;;基于多節(jié)點(diǎn)協(xié)作的認(rèn)知WSN能耗優(yōu)化算法[A];浙江省信號(hào)處理學(xué)會(huì)2011學(xué)術(shù)年會(huì)論文集[C];2011年

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

1 關(guān)世杰;Internet宏觀拓?fù)溲葑冞^(guò)程中的進(jìn)化、自復(fù)制和突變特征研究[D];東北大學(xué);2014年

2 馮誠(chéng);車聯(lián)網(wǎng)中的數(shù)據(jù)聚集研究[D];哈爾濱工業(yè)大學(xué);2015年

3 劉克中;無(wú)線傳感器網(wǎng)絡(luò)分布式節(jié)點(diǎn)定位方法研究[D];華中科技大學(xué);2006年

4 廖卓凡;無(wú)線網(wǎng)絡(luò)中保證覆蓋連通的節(jié)點(diǎn)部署問(wèn)題研究[D];中南大學(xué);2012年

5 郭麗芳;MANET的拓?fù)鋭?dòng)態(tài)性研究[D];北京郵電大學(xué);2011年

6 劉佳琦;移動(dòng)P2P覆蓋網(wǎng)拓?fù)浣Y(jié)構(gòu)及節(jié)點(diǎn)合作保障機(jī)制研究[D];中南大學(xué);2012年

7 王s鮯，

本文編號(hào)：1465178