【摘要】：物聯(lián)網(wǎng)是新一代通信技術(shù)的重要組成部分,其應(yīng)用領(lǐng)域涉及軍事、商業(yè)、工業(yè)、交通、醫(yī)學(xué)等方面。物聯(lián)網(wǎng)的感知層通常由感知節(jié)點(diǎn)組成,具有自組織、大規(guī)模、低功耗和低計(jì)算存儲(chǔ)能力等特性。感知層節(jié)點(diǎn)分布密集,大量無線信號(hào)同步傳輸易造成網(wǎng)絡(luò)擁塞,導(dǎo)致網(wǎng)絡(luò)丟包率的提高。同時(shí),感知節(jié)點(diǎn)由于構(gòu)造簡(jiǎn)單,價(jià)格低廉,其能量有限,過多的傳輸開銷會(huì)導(dǎo)致節(jié)點(diǎn)資源的快速消耗。因此,數(shù)據(jù)融合技術(shù)是物聯(lián)網(wǎng)感知層的關(guān)鍵技術(shù)之一,它對(duì)于提高網(wǎng)絡(luò)效率,延長(zhǎng)網(wǎng)絡(luò)生命周期是非常有效的,但無論是通信信道還是感知層節(jié)點(diǎn)本身均易受到惡意攻擊,從而使得數(shù)據(jù)融合技術(shù)在減少網(wǎng)絡(luò)傳輸開銷的同時(shí)也帶來安全隱患,為此,本文在分析和比較多種安全融合算法優(yōu)缺點(diǎn)的基礎(chǔ)上,設(shè)計(jì)了兩種安全融合算法。針對(duì)經(jīng)典算法CMT存在的ID號(hào)傳輸開銷過大的問題,設(shè)計(jì)了一種基于分組壓縮和自動(dòng)糾錯(cuò)的數(shù)據(jù)安全融合算法EDCSDA。在該算法中,融合節(jié)點(diǎn)利用排列組合對(duì)參與融合的子節(jié)點(diǎn)的ID號(hào)進(jìn)行編碼。編碼之后,再將結(jié)果按照多跳的方式向基站傳輸,基站按照一定的規(guī)則進(jìn)行解碼。通過matlab仿真證明該算法傳輸開銷遠(yuǎn)小于CMT算法。針對(duì)現(xiàn)有的安全融合算法密鑰分配和密鑰管理機(jī)制較為復(fù)雜的問題,設(shè)計(jì)一種無需分配密鑰的近似融合算法PADSA。通過對(duì)節(jié)點(diǎn)采集數(shù)據(jù)服從的概率分布模型進(jìn)行分析,在原始采集數(shù)據(jù)的基礎(chǔ)上疊加擾動(dòng)數(shù)據(jù),起到隱藏原始數(shù)據(jù)的效果。同時(shí)通過數(shù)學(xué)證明了基站在擁有大量節(jié)點(diǎn)數(shù)據(jù)情況下可以很好的還原真實(shí)數(shù)據(jù)的統(tǒng)計(jì)結(jié)果,而簇頭在擁有少量節(jié)點(diǎn)數(shù)據(jù)的情況下無法恢復(fù)數(shù)據(jù)。設(shè)計(jì)并實(shí)現(xiàn)了物聯(lián)網(wǎng)感知層測(cè)試床系統(tǒng),并在該系統(tǒng)上進(jìn)行了測(cè)試。測(cè)試結(jié)果證明了兩種算法的可行性,同時(shí)證明了這兩種算法可以在保證安全性的同時(shí)切實(shí)減少網(wǎng)絡(luò)的傳輸開銷。
[Abstract]:The Internet of things (IOT) is an important part of the new generation of communication technology, and its applications include military, commercial, industrial, transportation, medicine and so on. The sensing layer of the Internet of things is usually composed of perceptual nodes, which has the characteristics of self-organization, large-scale, low power consumption and low computing storage capacity. Perception layer nodes are densely distributed, and a large number of wireless signal synchronous transmission can lead to network congestion, resulting in the increase of packet loss rate. At the same time, because of its simple structure, low cost and limited energy, excessive transmission overhead will lead to fast consumption of node resources. Therefore, data fusion is one of the key technologies in the perception layer of the Internet of things. It is very effective for improving the network efficiency and prolonging the network life cycle. However, both the communication channel and the sensing layer nodes are vulnerable to malicious attacks. So data fusion technology can reduce the overhead of network transmission and bring security hidden trouble. Therefore, based on the analysis and comparison of the advantages and disadvantages of many security fusion algorithms, two security fusion algorithms are designed in this paper. Aiming at the problem that the transmission overhead of ID number is too high in the classical algorithm CMT, a data security fusion algorithm EDCSDA. based on packet compression and automatic error correction is designed. In this algorithm, the fusion nodes use permutation and combination to encode the ID number of the sub-nodes involved in the fusion. After coding, the result is transmitted to the base station in multi-hop mode, and the base station decodes according to certain rules. Matlab simulation shows that the transmission overhead of this algorithm is much smaller than that of CMT algorithm. In order to solve the complex problem of key distribution and key management mechanism of existing secure fusion algorithms, an approximate fusion algorithm PADSA. is designed. Based on the analysis of the probability distribution model of the node data acquisition, the effect of hiding the original data can be achieved by superimposing the disturbed data on the basis of the original data collection. At the same time, it is proved by mathematics that the base station has a large number of node data, but the cluster head can not restore the data in the case of a small number of node data. This paper designs and implements the test bed system of the perception layer of the Internet of things, and tests it on the system. The test results prove the feasibility of the two algorithms, and prove that the two algorithms can effectively reduce the transmission overhead while ensuring the security.
【學(xué)位授予單位】：東南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TP391.44;TN929.5;TP202

【相似文獻(xiàn)】

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

1 劉勇;侯榮旭;;淺談物聯(lián)網(wǎng)的感知層[J];電腦學(xué)習(xí);2010年05期

2 陳紅霞;趙俊鈺;;物聯(lián)網(wǎng)感知層標(biāo)準(zhǔn)體系架構(gòu)研究[J];電信科學(xué);2011年09期

3 顧燕;;物聯(lián)網(wǎng)感知層技術(shù)與微米級(jí)壓電陶瓷傳感器的研究[J];時(shí)代教育;2013年22期

4 馬文霞;;物聯(lián)網(wǎng)中感知層的安全問題分析[J];無線互聯(lián)科技;2012年05期

5 馬駿;郭淵博;馬建峰;熊金波;張濤;;物聯(lián)網(wǎng)感知層一種分層訪問控制方案[J];計(jì)算機(jī)研究與發(fā)展;2013年06期

6 馬駿;郭淵博;馬建峰;劉西蒙;李琦;;物聯(lián)網(wǎng)感知層基于資源分層的多用戶訪問控制方案[J];電子學(xué)報(bào);2014年01期

7 戴超;夏駱輝;張炎;;物聯(lián)網(wǎng)感知層及其測(cè)試技術(shù)的研究[J];現(xiàn)代電信科技;2012年09期

8 馬紀(jì)豐;梁浩;;物聯(lián)網(wǎng)感知層信息安全分析與建議[J];現(xiàn)代電子技術(shù);2012年19期

9 黃貴玲;;安全監(jiān)控物聯(lián)網(wǎng)感知層接入設(shè)備的硬件設(shè)計(jì)[J];信息技術(shù)與標(biāo)準(zhǔn)化;2013年09期

10 俞玉蓮;;物聯(lián)網(wǎng)感知層中的關(guān)鍵技術(shù)分析[J];科技信息;2013年12期

相關(guān)重要報(bào)紙文章 前2條

1 張揚(yáng) 何滿懷;陳俊杰:感知層是物聯(lián)網(wǎng)發(fā)展的關(guān)鍵[N];江蘇科技報(bào);2010年

2 本報(bào)記者 李旭陽;斬“手”[N];計(jì)算機(jī)世界;2012年

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

1 許建龍;物聯(lián)網(wǎng)平臺(tái)感知層建模與快速調(diào)度方法研究及應(yīng)用[D];華南理工大學(xué);2013年

2 喬舉義;物聯(lián)網(wǎng)感知層中資源分配與調(diào)度算法研究[D];北京郵電大學(xué);2013年

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

1 孫雄;物聯(lián)網(wǎng)感知層數(shù)據(jù)安全融合技術(shù)的研究和實(shí)現(xiàn)[D];東南大學(xué);2015年

2 金鑫;煤礦井下物聯(lián)網(wǎng)感知層的研究[D];安徽理工大學(xué);2013年

3 黃宇;基于對(duì)稱多項(xiàng)式方法的物聯(lián)網(wǎng)感知層安全技術(shù)研究[D];遼寧大學(xué);2013年

4 戴雷;基于Blom矩陣方法的物聯(lián)網(wǎng)感知層安全協(xié)議研究[D];復(fù)旦大學(xué);2011年

5 汪永鵬;物聯(lián)網(wǎng)感知層智能網(wǎng)關(guān)及開放服務(wù)接口的研究與實(shí)現(xiàn)[D];北京郵電大學(xué);2013年

，

本文編號(hào)：2293551