發(fā)布時(shí)間：2018-05-05 07:42

  本文選題：車載傳感器網(wǎng)絡(luò) + 道路擁堵檢測(cè)　； 參考：《北京交通大學(xué)》2014年博士論文

【摘要】：隨著無線傳感器網(wǎng)絡(luò)應(yīng)用在車輛領(lǐng)域中的延伸,車載傳感網(wǎng)作為備受關(guān)注的新一代網(wǎng)絡(luò)技術(shù),在城市路況監(jiān)測(cè)和交通異常檢測(cè)等方面具有廣闊的應(yīng)用前景。鑒于交通異常事件極易引發(fā)二次事故和道路擁堵問題,如何利用車載傳感網(wǎng)及時(shí)準(zhǔn)確地檢測(cè)出交通異常信息,并提供切實(shí)可行的信息發(fā)布和訂閱服務(wù),減輕異常事件對(duì)城市交通的惡劣影響成為推進(jìn)智慧城市建設(shè)的核心。 本文立足于車載傳感網(wǎng)的交通異常信息檢測(cè)與傳輸關(guān)鍵技術(shù)研究,以城市路況數(shù)據(jù)采集為基礎(chǔ),通過擁堵信息檢測(cè)補(bǔ)充和完善異常信息的檢測(cè)內(nèi)容,并結(jié)合異常信息傳輸?shù)牟煌�需�?分別討論面向多目標(biāo)路段的地理廣播技術(shù)和基于車車間通信的跨區(qū)域信息訂閱問題,本文主要工作和貢獻(xiàn)包括： (1)車輛節(jié)點(diǎn)因最小化能耗需求普遍存在自私性,導(dǎo)致現(xiàn)存路況數(shù)據(jù)采集協(xié)議可靠性不高,針對(duì)該問題,本文利用DTN路由框架和激勵(lì)合作思想,在以公共車輛為主體的網(wǎng)絡(luò)架構(gòu)下提出了一種能量感知社交路由協(xié)議。該協(xié)議首先通過感知節(jié)點(diǎn)的剩余能量和速度信息對(duì)有限的復(fù)制令牌進(jìn)行比例分配,不僅避免了拷貝資源的盲目擴(kuò)散,還均衡了節(jié)點(diǎn)的整體能耗水平,間接實(shí)現(xiàn)了鼓勵(lì)自私節(jié)點(diǎn)參與合作的目的；同時(shí),該協(xié)議根據(jù)歷史相遇節(jié)點(diǎn)的差異性來評(píng)估節(jié)點(diǎn)的社會(huì)活躍程度,并設(shè)計(jì)了基于社交關(guān)系能力的聚焦算法。實(shí)驗(yàn)結(jié)果表明,在接近真實(shí)條件的仿真場(chǎng)景下,該協(xié)議將數(shù)據(jù)成功交付給sink節(jié)點(diǎn)的概率要比SF協(xié)議高出約10%；而對(duì)于SW協(xié)議、EBR協(xié)議,該概率值可提升至20%。 (2)針對(duì)目前異常信息檢測(cè)內(nèi)容的不完整性和單級(jí)信息融合方法的局限性,本文從綜合優(yōu)化的角度出發(fā),通過整合特征級(jí)信息融合和決策級(jí)信息融合技術(shù),提出了基于多級(jí)信息融合的道路擁堵信息檢測(cè)機(jī)制。該機(jī)制首先設(shè)計(jì)了基于模糊分簇算法的消息聚合方法來剔除大量錯(cuò)誤或冗余的原子消息；然后利用自定義的事件概率預(yù)測(cè)函數(shù)和消息可信度分配策略來篩選擁堵特征,并基于D-S證據(jù)理論提出了一種抗干擾擁堵判決方法,從而避免由交通信號(hào)燈等待產(chǎn)生的虛假擁堵特征。實(shí)驗(yàn)結(jié)果表明,該機(jī)制的平均消息聚合效率可達(dá)98%,雖然僅比RSMA方法高出2%,但它能夠從相鄰兩車道間準(zhǔn)確地提取出極其細(xì)微的擁堵特征。理論分析也證明,該機(jī)制能確保擁堵信息檢測(cè)的一致性和準(zhǔn)確性。 (3)針對(duì)異常信息分發(fā)目標(biāo)區(qū)域的不唯一性、地理廣播路徑的重復(fù)性以及廣播對(duì)象的流動(dòng)性問題,本文提出了一種智慧地理廣播機(jī)制。該機(jī)制通過在十字路口和目標(biāo)區(qū)域中分別部署”燈塔”和”浮標(biāo)”等虛擬的地理標(biāo)志物,并將其坐標(biāo)信息封裝在廣播的消息包內(nèi),從而引導(dǎo)消息智慧地執(zhí)行廣播行為和選擇信息傳輸方向。為了減少路由成本,消息先利用”燈塔”建立多播共享路徑,并經(jīng)過路徑分裂到達(dá)多個(gè)目標(biāo)區(qū)域的入口處。然后,消息在每個(gè)目標(biāo)區(qū)域中基于”浮標(biāo)”進(jìn)行初始地理廣播,并選擇在距離目標(biāo)路段出口最近的截面單元內(nèi),利用最優(yōu)重廣播時(shí)間預(yù)測(cè)方法來選拔重廣播繼任節(jié)點(diǎn)。實(shí)驗(yàn)結(jié)果表明,該機(jī)制不僅降低了消息重廣播的總次數(shù),還能在容忍的消息丟失率范圍內(nèi)最小化消息重復(fù)接收概率。 (4)由于異常信息訂閱節(jié)點(diǎn)和目標(biāo)節(jié)點(diǎn)所在地理位置之間存在跨區(qū)域和RSU分布數(shù)量少且不均衡的特點(diǎn),導(dǎo)致基于V2V通信的異常信息回復(fù)過程中的訂閱成功率低且成本高。針對(duì)該問題,本文提出了一種基于車輛社區(qū)結(jié)構(gòu)感知的機(jī)會(huì)路由協(xié)議。該協(xié)議首先設(shè)計(jì)了基于鏈路穩(wěn)定性的配額消息復(fù)制策略,以解決消息拷貝資源有限且易丟失的問題：其次,利用車輛移動(dòng)行為的社會(huì)性和規(guī)律性,提出了基于訪問相似度的車輛社區(qū)構(gòu)建方法,并結(jié)合”消息移動(dòng)趨勢(shì)”和”社交關(guān)系能力”兩項(xiàng)參數(shù)定義設(shè)計(jì)了基于社區(qū)結(jié)構(gòu)感知的消息轉(zhuǎn)發(fā)算法。實(shí)驗(yàn)結(jié)果表明,在跨區(qū)域特點(diǎn)顯著的場(chǎng)景下,該協(xié)議能夠以較低的成本獲得與Epidemic協(xié)議一樣高的信息成功訂閱概率,且比采用貪婪式復(fù)制策略的ProPHET協(xié)議要高出約8%。
[Abstract]:With the extension of wireless sensor network application in the vehicle field, vehicle sensor network, as a new generation of network technology which has attracted much attention, has a broad application prospect in urban road condition monitoring and traffic anomaly detection. In view of the traffic anomalies are easily caused by two accidents and road congestion problems, how to use the vehicle sensor network and the vehicle sensor network is very easy. When the traffic anomaly information is detected accurately, the practical information release and subscription services are provided, and the abominable impact of abnormal events on urban traffic has become the core of the construction of the intelligent city.
This paper is based on the research on the key technology of traffic anomaly information detection and transmission in vehicle sensor network. Based on the data acquisition of urban road condition, the detection content of abnormal information is supplemented and perfected through congestion information detection, and the geographic broadcast technology and vehicle based vehicle based on multi target sections are discussed in combination with the different requirements of abnormal information transmission. The main work and contributions of the cross regional information subscription for workshop communication include:
(1) there is selfishness in vehicle nodes because of minimization of energy consumption, which leads to the low reliability of existing road data acquisition protocols. Aiming at this problem, this paper proposes an energy aware social routing protocol under the framework of DTN routing and incentive cooperation in the network architecture with public vehicles as the main body. The protocol first passes the perception section. The residual energy and velocity information of the point is proportional to the limited copy token, which not only avoids the blind diffusion of copy resources, but also balances the overall energy consumption level of the nodes, and indirectly realizes the purpose of encouraging the selfish nodes to participate in the cooperation. At the same time, the protocol evaluates the social activity of the nodes according to the differences of historical nodes. The experimental results show that the probability of the protocol to deliver the data to the sink node is about 10% higher than that of the SF protocol in the simulation scene near the real condition; and for the SW protocol and the EBR protocol, the probability value can be raised to 20%..
(2) in view of the incompleteness of the content of abnormal information detection and the limitation of the single level information fusion method, from the perspective of comprehensive optimization, this paper proposes a multi level information fusion based information detection mechanism for road congestion, based on the integration of feature level information fusion and decision level information fusion technology. A clustering algorithm is used to eliminate a large number of false or redundant atomic messages. Then, a custom event probability prediction function and message reliability allocation strategy are used to screen the congestion characteristics. Based on the D-S evidence theory, an anti-jamming congestion decision method is proposed, which avoids the falsehood generated by the traffic signal waiting. The experimental results show that the efficiency of the average message aggregation of the mechanism can reach 98%. Although it is only 2% higher than the RSMA method, it can accurately extract very subtle congestion features from adjacent two lanes. The theoretical analysis also proves that the mechanism can ensure consistency and accuracy of congestion information detection.
(3) in view of the ununiqueness of the target area for abnormal information distribution, the repeatability of the geographic broadcast path and the liquidity of the broadcast object, this paper presents a kind of intelligent geographic broadcasting mechanism. This mechanism, by deploying the "Lighthouse" and "buoy" in the crossroads and the target area, and the coordinates of its coordinates. The message is encapsulated in the broadcast message packet to guide the message to execute the broadcast behavior and select the information transmission direction. In order to reduce the routing cost, the message first uses the "Lighthouse" to establish the multicast sharing path, and through the path splitting to the entrance of the multiple target areas. The experimental results show that this mechanism not only reduces the total number of message re broadcast, but also minimizes the repetition of message receiving within the range of tolerance message loss rate. Probability.
(4) due to the small and unbalanced distribution of cross region and RSU distribution between the abnormal information subscription node and the location of the target node, the subscription success rate is low and the cost is high during the abnormal information recovery process based on V2V communication. This paper proposes an opportunity routing based on the perception of vehicle community structure. The protocol first designs a quota message replication strategy based on link stability to solve the problem of limited and easy missing message copy resources. Secondly, using the sociality and regularity of vehicle mobility, a method of building a vehicle community based on access similarity is proposed, combined with "message movement trend" and "social customs". The two parameter definition designs a message forwarding algorithm based on community structure perception. The experimental results show that the protocol can obtain a successful subscription probability as high as the Epidemic protocol at a lower cost, and is about 8%. higher than the ProPHET protocol using greedy replication strategy.

【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP274.2;TN929.5

【參考文獻(xiàn)】

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

1 薛小平;張思東;張宏科;王小平;葛樂;尹琴;;基于內(nèi)容的發(fā)布訂閱系統(tǒng)路由算法[J];電子學(xué)報(bào);2008年05期

2 李莉;董樹松;溫向明;;基于博弈理論建立無線自組網(wǎng)中激勵(lì)合作機(jī)制的研究[J];電子與信息學(xué)報(bào);2007年06期

3 張程;劉慧君;陳自郁;朱慶生;;基于信用的重復(fù)博弈模型在節(jié)點(diǎn)轉(zhuǎn)發(fā)中的應(yīng)用[J];解放軍理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年02期

4 任豐原,黃海寧,林闖;無線傳感器網(wǎng)絡(luò)[J];軟件學(xué)報(bào);2003年07期

5 熊永平;孫利民;牛建偉;劉燕;;機(jī)會(huì)網(wǎng)絡(luò)[J];軟件學(xué)報(bào);2009年01期

6 李麗君;劉鴻飛;楊祖元;葛利嘉;黃席樾;;車用自組網(wǎng)信息廣播[J];軟件學(xué)報(bào);2010年07期

7 孫利民;熊永平;馬建;;機(jī)會(huì)移動(dòng)傳感器網(wǎng)絡(luò)中的自適應(yīng)數(shù)據(jù)收集機(jī)制[J];通信學(xué)報(bào);2008年11期

8 鐘婷;秦志光;;基于排序的高效交通信息分發(fā)算法[J];通信學(xué)報(bào);2009年08期

9 宋超;劉明;龔海剛;陳貴海;王曉敏;;基于分布式實(shí)時(shí)信息的車載網(wǎng)絡(luò)路由協(xié)議[J];軟件學(xué)報(bào);2011年03期

10 曲大鵬;王興偉;黃敏;;移動(dòng)對(duì)等網(wǎng)絡(luò)中自私節(jié)點(diǎn)的檢測(cè)和激勵(lì)機(jī)制[J];軟件學(xué)報(bào);2013年04期

，

本文編號(hào)：1846803