本文選題：數(shù)據(jù)融合 + 分簇��； 參考：《西南大學(xué)》2017年碩士論文

【摘要】：無線傳感器網(wǎng)絡(luò)作為物聯(lián)網(wǎng)的重要組成部分,是由隨機(jī)分布在感知區(qū)域內(nèi)的成百上千的廉價(jià)的微型傳感器節(jié)點(diǎn)構(gòu)成的,通過無線通信的形式構(gòu)成的一個(gè)多跳的、自組織的網(wǎng)絡(luò)系統(tǒng)。它以感知、收集和處理無線傳感器網(wǎng)絡(luò)覆蓋區(qū)域的數(shù)據(jù)信息,并將最后的結(jié)果發(fā)送給用戶為主要目的。部署在感知區(qū)域的傳感器節(jié)點(diǎn)的能量十分有限,且不能增補(bǔ)。因此,如何降低節(jié)點(diǎn)能量的消耗以盡可能延長網(wǎng)絡(luò)的生命周期是目前無線傳感器網(wǎng)絡(luò)研究的重點(diǎn)。為了全面地覆蓋感知區(qū)域,傳感器節(jié)點(diǎn)通常部署十分地密集,這會(huì)使得相鄰傳感器節(jié)點(diǎn)感知的數(shù)據(jù)存在時(shí)間和空間的相關(guān)性,從而導(dǎo)致明顯的冗余。為了消除冗余,數(shù)據(jù)融合成為了一種非常有效的能消除冗余、最小化傳輸中的數(shù)據(jù)量、節(jié)約能量的方法。在先前的工作中,很多學(xué)者提出了很多有效的消除數(shù)據(jù)冗余的方法。但是,這些方法有的能量效率較低,有的復(fù)雜度較高。在基于簇的網(wǎng)絡(luò)結(jié)構(gòu)中,能量主要被消耗在從簇頭節(jié)點(diǎn)到匯聚節(jié)點(diǎn)的傳輸過程中。因此,本文主要考慮通過在簇頭節(jié)點(diǎn)進(jìn)行數(shù)據(jù)融合來降低傳輸?shù)臄?shù)據(jù)量,從而達(dá)到節(jié)約能量的目的�；谶@些考慮,本文提出了一種在網(wǎng)絡(luò)總延時(shí)約束下的無線傳感器網(wǎng)絡(luò)中的基于典型相關(guān)性分析的數(shù)據(jù)融合方法。首先,為了平衡簇與簇之間的能量消耗,我們在總延時(shí)約束下將整個(gè)網(wǎng)絡(luò)中的總能量消耗作為最小化目標(biāo),并通過拉格朗日對偶的方法獲得網(wǎng)絡(luò)中的最優(yōu)簇的數(shù)量。其次,為了避免傳輸過程中的擁塞,我們采用“分時(shí)隙”的分簇算法來構(gòu)造網(wǎng)絡(luò)中的最優(yōu)融合樹,并保證在傳輸過程中一次傳輸只占用一個(gè)時(shí)隙。再者,在簇頭節(jié)點(diǎn)處,我們提出了一種基于典型相關(guān)性分析的數(shù)據(jù)融合方法,它可以低復(fù)雜度的處理不同類型的多維數(shù)據(jù),消除簇頭節(jié)點(diǎn)處的數(shù)據(jù)冗余,從而最大限度的減少傳輸?shù)臄?shù)據(jù)量,節(jié)約網(wǎng)絡(luò)中的能量。最后的仿真結(jié)果表明,與現(xiàn)有的方法相比較,我們的方法不僅可以減少傳輸?shù)臄?shù)據(jù)量,節(jié)約網(wǎng)絡(luò)中消耗的能量,還可以減少網(wǎng)絡(luò)的延時(shí),延長無線傳感器網(wǎng)絡(luò)的生命周期。
[Abstract]:As an important part of the Internet of things, wireless sensor networks are made up of hundreds of cheap sensor nodes randomly distributed in the perceptual region, and a multi-hop in the form of wireless communication. Self-organizing network system. Its main purpose is to perceive, collect and process the data information of the wireless sensor network coverage area, and send the final results to the user. The energy of sensor nodes deployed in the sensing area is very limited and cannot be supplemented. Therefore, how to reduce the energy consumption of nodes in order to prolong the lifetime of wireless sensor networks as much as possible is the focus of research on wireless sensor networks. In order to completely cover the perceptual region sensor nodes are usually deployed in a very dense manner which results in temporal and spatial correlation between sensing data of adjacent sensor nodes and resulting in obvious redundancy. In order to eliminate redundancy, data fusion has become a very effective method to eliminate redundancy, minimize the amount of data in transmission, and save energy. In previous work, many scholars have proposed many effective methods to eliminate data redundancy. However, some of these methods have lower energy efficiency and higher complexity. In cluster-based network architecture, energy is mainly consumed in the transmission process from cluster head node to sink node. Therefore, in this paper, the data fusion in cluster head node is mainly considered to reduce the amount of data transmitted, so as to save energy. Based on these considerations, this paper proposes a data fusion method based on canonical correlation analysis in wireless sensor networks with total delay constraints. First, in order to balance the energy consumption between clusters, we take the total energy consumption in the whole network as the minimization objective under the total delay constraint, and obtain the optimal number of clusters in the network by Lagrange duality method. Secondly, in order to avoid the congestion in the transmission process, we use the "time slot" clustering algorithm to construct the optimal fusion tree in the network, and ensure that only one time slot is used at a time during the transmission process. Furthermore, at the cluster head node, we propose a data fusion method based on the canonical correlation analysis, which can deal with different types of multidimensional data with low complexity and eliminate the data redundancy at the cluster head node. In order to minimize the amount of data transmission, save energy in the network. The simulation results show that compared with the existing methods, our method can not only reduce the amount of data transferred, save the energy consumed in the network, but also reduce the delay of the network and prolong the life cycle of the wireless sensor network.
【學(xué)位授予單位】：西南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 陳正宇;楊庚;陳蕾;許建;;無線傳感器網(wǎng)絡(luò)數(shù)據(jù)融合研究綜述[J];計(jì)算機(jī)應(yīng)用研究;2011年05期

2 洪鋒;褚紅偉;金宗科;單體江;郭忠文;;無線傳感器網(wǎng)絡(luò)應(yīng)用系統(tǒng)最新進(jìn)展綜述[J];計(jì)算機(jī)研究與發(fā)展;2010年S2期

3 韓軍峰;;無線傳感器網(wǎng)絡(luò)家居應(yīng)用研究[J];信息與電腦(理論版);2010年01期

4 趙仕俊;張朝暉;丁為;;基于ZigBee技術(shù)的石油鉆井現(xiàn)場無線傳感器網(wǎng)絡(luò)研究[J];石油礦場機(jī)械;2009年07期

5 周一南;周運(yùn)森;;無線傳感器網(wǎng)絡(luò)WSN在工業(yè)生產(chǎn)實(shí)時(shí)監(jiān)控中的應(yīng)用[J];工業(yè)控制計(jì)算機(jī);2008年08期

6 陳川濤;周小佳;劉慧君;王蕾;;無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位算法在智能公交系統(tǒng)的應(yīng)用與比較[J];工業(yè)控制計(jì)算機(jī);2007年06期

7 韓維濤;張亞新;;ANSYS優(yōu)化技術(shù)在零件結(jié)構(gòu)設(shè)計(jì)中的應(yīng)用[J];機(jī)械研究與應(yīng)用;2005年06期

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

1 孔玉靜;基于神經(jīng)網(wǎng)絡(luò)的無線傳感器網(wǎng)絡(luò)數(shù)據(jù)融合算法研究[D];浙江工商大學(xué);2013年

2 張文超;無線傳感器網(wǎng)絡(luò)數(shù)據(jù)融合技術(shù)的相關(guān)研究[D];南京郵電大學(xué);2012年

，

本文編號(hào)：1796199