發(fā)布時間：2018-04-12 19:47

  本文選題：移動無線傳感器網(wǎng)絡(luò) + 二級分簇��； 參考：《哈爾濱工業(yè)大學(xué)》2014年碩士論文

【摘要】：無線傳感器網(wǎng)絡(luò)是通過在一定區(qū)域內(nèi)部署大量無線傳感器節(jié)點,實現(xiàn)環(huán)境數(shù)據(jù)監(jiān)測任務(wù)的多跳網(wǎng)絡(luò)。由于無線傳感器節(jié)點采用電池供電形式,單個節(jié)點能量有限,同時節(jié)點部署環(huán)境惡劣,節(jié)點隨時有被捕獲危險,所以安全和能耗成為制約無線傳感器網(wǎng)絡(luò)發(fā)展的最大瓶頸。目前在無線傳感器網(wǎng)絡(luò)中,節(jié)點能耗主要用于數(shù)據(jù)接收和轉(zhuǎn)發(fā)上,無線傳感器網(wǎng)絡(luò)中數(shù)據(jù)傳輸總跳數(shù)決定了整個網(wǎng)絡(luò)的能量消耗水平。傳統(tǒng)上通過引入了數(shù)據(jù)壓縮技術(shù)和分簇網(wǎng)絡(luò)結(jié)構(gòu),能在一定程度上降低網(wǎng)絡(luò)節(jié)點能耗。但目前一級分簇網(wǎng)絡(luò)結(jié)構(gòu)在節(jié)省數(shù)據(jù)傳輸跳數(shù)能力有限;傳統(tǒng)上的無線傳感器網(wǎng)絡(luò)密鑰分配協(xié)議不支持節(jié)點位置移動所帶來的密鑰更新功能需求,同時能耗過高,這些都是現(xiàn)在無線傳感器網(wǎng)絡(luò)存在的主要問題。本文針對目前移動傳感器網(wǎng)絡(luò)能耗過高、密鑰分配協(xié)議不能滿足節(jié)點移動所帶來的密鑰動態(tài)管理需求,做了以下主要工作:引入二級簇首節(jié)點提出了二級分簇網(wǎng)絡(luò)結(jié)構(gòu)模型。通過理論分析得出了無線傳感器網(wǎng)絡(luò)中數(shù)據(jù)傳輸總跳數(shù)E與網(wǎng)絡(luò)一、二級分簇層數(shù)k、m和網(wǎng)絡(luò)特征值2S/R之間函數(shù)關(guān)系。求出了在理想傳輸模型網(wǎng)絡(luò)傳輸跳數(shù)最小時最優(yōu)一、二級分簇層數(shù)k*、m*。并結(jié)合集合覆蓋問題,設(shè)計了移動無線傳感器網(wǎng)絡(luò)中的一、二級簇頭選取算法。對比實驗表明,本文提出的二級分簇網(wǎng)絡(luò)結(jié)構(gòu)模型在數(shù)據(jù)傳輸跳數(shù)上和一級分簇網(wǎng)絡(luò)結(jié)構(gòu)模型相比能有大幅減少;在數(shù)據(jù)壓縮率上和一級分簇結(jié)構(gòu)網(wǎng)絡(luò)相比也有較大提高,從而能顯著降低網(wǎng)絡(luò)能耗。為發(fā)揮最優(yōu)二級分簇網(wǎng)絡(luò)模型有效降低網(wǎng)絡(luò)能耗的優(yōu)勢,本文將最優(yōu)二級分簇網(wǎng)絡(luò)結(jié)構(gòu)模型應(yīng)用于密鑰分配協(xié)議中,設(shè)計了最優(yōu)二級分簇網(wǎng)絡(luò)密鑰分配協(xié)議(簡稱T-L密鑰協(xié)議)。與經(jīng)典的LEAP協(xié)議一樣,T-L協(xié)議具有在普通節(jié)點暴露后,不會對網(wǎng)絡(luò)中其它節(jié)點的安全鏈路產(chǎn)生任何影響的優(yōu)點。同時該協(xié)議能夠有效支持網(wǎng)絡(luò)中移動節(jié)點的密鑰管理。通過理論分析和對比實驗,本文提出的T-L密鑰分配協(xié)議在單個節(jié)點平均能耗上小于LEAP協(xié)議平均節(jié)點能耗。
[Abstract]:Wireless sensor network (WSN) is a multi-hop network which implements the task of environmental data monitoring by deploying a large number of wireless sensor nodes in a certain area.Because wireless sensor nodes use battery power, single node energy is limited, at the same time, node deployment environment is bad, nodes are at risk of capture at any time, so security and energy consumption has become the biggest bottleneck restricting the development of wireless sensor networks.At present, the energy consumption of nodes in wireless sensor networks is mainly used for data receiving and forwarding. The total hops of data transmission in wireless sensor networks determine the energy consumption level of the whole network.Traditionally, data compression technology and cluster network structure are introduced to reduce the energy consumption of network nodes to a certain extent.However, the current primary clustering network structure is limited in saving data transmission hops, and the traditional key distribution protocol in wireless sensor networks does not support the requirement of key updating brought by node location movement, and the energy consumption is too high.These are the main problems in wireless sensor networks.In view of the high energy consumption of mobile sensor networks and the fact that the key distribution protocol can not meet the demand of dynamic key management brought by node movement, this paper does the following main work: introducing the two-level cluster head node, a two-level cluster network structure model is proposed.Through theoretical analysis, the functional relationship between the total hops E of data transmission in wireless sensor networks and network I, the number of secondary cluster layers KM and the network eigenvalue 2S/R is obtained.In this paper, the optimal number of second and second order cluster layers is obtained when the number of transmission hops is minimum in the ideal transmission model.Combined with the set coverage problem, a two-level cluster head selection algorithm for mobile wireless sensor networks is designed.The comparative experiments show that the proposed two-level clustering network structure model can greatly reduce the number of data transmission hops compared with the first-order clustering network structure model, and the data compression ratio is also greatly improved compared with the first-order clustering structure network model.Thus, the network energy consumption can be significantly reduced.In order to bring into play the advantage of the optimal two-level clustering network model to reduce the network energy consumption effectively, this paper applies the optimal two-level clustering network structure model to the key distribution protocol, and designs the optimal two-level clustering network key distribution protocol (T-L key protocol for short).Like the classical LEAP protocol, T-L protocol has the advantage of not having any effect on the secure links of other nodes in the network after the ordinary nodes are exposed.At the same time, the protocol can effectively support the key management of mobile nodes in the network.Through theoretical analysis and comparative experiments, the average energy consumption of T-L key distribution protocol proposed in this paper is lower than that of LEAP protocol.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN918.4;TP212.9

【相似文獻】

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

1 宋榮功,胡正名,楊義先;對密鑰分配協(xié)議中抗主動攻擊基本結(jié)構(gòu)的研究[J];北京郵電大學(xué)學(xué)報;1999年03期

2 張雪飛;謝穎;;一種可認證的會議密鑰分配協(xié)議[J];科技信息(科學(xué)教研);2007年18期

3 倪禮君;徐雄;;理論意義上安全的密鑰分配協(xié)議[J];信息技術(shù);2008年02期

4 王靖;李秀瑩;楊成;;基于身份的密封鎖會議密鑰分配協(xié)議[J];計算機工程;2009年14期

5 林國福;;無線網(wǎng)絡(luò)中安全密鑰分配協(xié)議研究[J];長春理工大學(xué)學(xué)報(高教版);2009年12期

6 邢育森,林曉東,李小杰,楊義先;會話密鑰分配協(xié)議的分析與設(shè)計[J];北京郵電大學(xué)學(xué)報;1997年04期

7 林曉東,邢育森,楊義先;Needham-Schroeder密鑰分配協(xié)議的改進[J];北京郵電大學(xué)學(xué)報;1997年04期

8 劉東蘇,韋寶典,王新梅;改進的3G認證與密鑰分配協(xié)議[J];通信學(xué)報;2002年05期

9 馬永進,駱紅波;可修補的互聯(lián)網(wǎng)密鑰分配協(xié)議[J];微機發(fā)展;2002年04期

10 肖攸安;周祖德;李臘元;;船舶通信密鑰分配協(xié)議的研究[J];船海工程;2006年02期

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

1 蘆浩;移動WSNs中最優(yōu)二級分簇方案研究及密鑰分配協(xié)議設(shè)計[D];哈爾濱工業(yè)大學(xué);2014年

2 駱成剛;層次化可修復(fù)密鑰分配協(xié)議及其在電子政務(wù)中的應(yīng)用[D];電子科技大學(xué);2003年

3 徐慶禹;具有彈性的密鑰分配協(xié)議的研究[D];西華大學(xué);2009年

4 田壁鳴;密鑰分配協(xié)議的研究[D];西華大學(xué);2007年

5 吳柳飛;認證和密鑰分配協(xié)議的可證明安全研究[D];西安電子科技大學(xué);2008年

，

本文編號：1741166