本文選題：無線傳感網(wǎng) + 安全路由��； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：隨著物聯(lián)網(wǎng)技術(shù)的流行,無線傳感器網(wǎng)絡(luò)(WSN)開始受到越來越多的專家和學(xué)者的關(guān)注。傳感器節(jié)點(diǎn)由于多數(shù)部署在不可達(dá)的區(qū)域,難以人為地更換電池,故其資源(包括存儲、計算、通信)及其有限。然而,在很多場合,例如無人看管的區(qū)域、軍事監(jiān)測、車載系統(tǒng)、醫(yī)療系統(tǒng)中,數(shù)據(jù)的安全和隱私保護(hù)顯得尤為重要。隨著IPv6的出現(xiàn),為了實現(xiàn)更大規(guī)模的物聯(lián)網(wǎng)應(yīng)用,WSN引入了IPv6編址方案,并出現(xiàn)RPL等數(shù)據(jù)轉(zhuǎn)發(fā)路由算法。針對于現(xiàn)階段無線傳感器網(wǎng)絡(luò)與IPv6結(jié)合的數(shù)據(jù)轉(zhuǎn)發(fā)路由算法具有高能耗、高延遲等缺陷以及考慮到安全性越來越重要的地位,本文提出了一套完整的安全數(shù)據(jù)轉(zhuǎn)發(fā)及路由認(rèn)證體系。具體包括如下方面:(1)提出了GSRM策略,節(jié)點(diǎn)將自身劃分成一個個的分組,在分組中部分節(jié)點(diǎn)僅發(fā)送消息,部分節(jié)點(diǎn)僅接收消息,各司其職。節(jié)點(diǎn)通過計算自己所位于網(wǎng)絡(luò)中的GSRM層數(shù)值來確定自己所處的分組。中繼節(jié)點(diǎn)負(fù)責(zé)消息在組與組之間的轉(zhuǎn)發(fā)�；贕SRM分組,設(shè)計了相應(yīng)的密鑰分配算法和密鑰更新算法,確保數(shù)據(jù)包在傳輸?shù)倪^程中可以受到加密算法的保護(hù),且攻擊者在截獲、嗅探數(shù)據(jù)包時無法獲知其內(nèi)容。為了減少網(wǎng)絡(luò)中不必要的通信并提高網(wǎng)絡(luò)的魯棒性,提供了在僅有少量節(jié)點(diǎn)死亡或加入網(wǎng)絡(luò)時的拓?fù)浣鉀Q方案。(2)提出了完整的IPv6編址方案,通過對建立的樹形拓?fù)?節(jié)點(diǎn)很容易找到自己的父/子節(jié)點(diǎn)�；谠揑Pv6編址方案,設(shè)計了相應(yīng)的路由算法,保證節(jié)點(diǎn)與節(jié)點(diǎn)之間的通信都有惟一的路徑可供數(shù)據(jù)包送達(dá)。(3)基于(1)和(2),針對節(jié)點(diǎn)的廣播認(rèn)證問題,本文改進(jìn)了μTESLA協(xié)議,并將其與GSRM策略相結(jié)合。通過定義多Hash樹和GSRM-Hash樹,結(jié)合ECC加密方案,設(shè)計了GSRM可再生Hash鏈,當(dāng)μTESLA協(xié)議中的Hash鏈?zhǔn)褂猛戤吅?可以使得節(jié)點(diǎn)不可否認(rèn)地產(chǎn)生另一條完整的Hash鏈。(4)基于(1)和(2),針對密鑰更新中攻擊者可以采取俘獲攻擊從而高概率預(yù)測密鑰更新值的問題,本文結(jié)合矩陣運(yùn)算提出了同態(tài)加密算法HEBM。其可以保證在leader節(jié)點(diǎn)不知道代理節(jié)點(diǎn)的隱私向量的前提下完成密鑰更新的整個工作,并通過數(shù)學(xué)公式證明了HEBM的正確性。最后,論文完成了對以上方案的性能評估。從存儲、連通性、延遲、安全性、計算開銷、通信開銷等多個角度分析并比較了GSRM和HEBM的性能。比較結(jié)果可以得知本文的方案在這些方面均具有更好的表現(xiàn)。此外也從存儲、計算、通信方面將改進(jìn)后的μTESLA協(xié)議與μTESLA協(xié)議、多級μTESLA協(xié)議進(jìn)行對比。除了存儲開銷略大之外,改進(jìn)的μTESLA協(xié)議優(yōu)于μTESLA協(xié)議和多級μTESLA協(xié)議。
[Abstract]:With the popularity of Internet of things (IoT) technology, WSNs have attracted more and more attention from experts and scholars. Because most sensor nodes are deployed in unreachable areas, it is difficult to replace batteries artificially, so their resources (including storage, computation, communication) are limited. However, in many situations, such as unattended areas, military monitoring, vehicular systems, medical systems, data security and privacy protection is particularly important. With the emergence of IPv6, in order to realize a larger scale of Internet of things applications, IPv6 addressing scheme is introduced, and RPL and other data forwarding routing algorithms are presented. The data forwarding routing algorithm which combines wireless sensor network and IPv6 has many disadvantages such as high energy consumption, high delay, and considering the increasingly important position of security. In this paper, a complete set of secure data forwarding and routing authentication system is proposed. The main contents are as follows: (1) A GSRM strategy is proposed, in which some nodes only send messages and some nodes only receive messages, and each node performs its duties. Nodes determine their grouping by calculating the GSRM layer in their network. The relay node is responsible for forwarding messages between groups. Based on the GSRM packet, the corresponding key distribution algorithm and key update algorithm are designed to ensure that the packet can be protected by the encryption algorithm during the transmission process, and the attacker can not know the content of the packet when sniffing the packet. In order to reduce unnecessary communication in the network and improve the robustness of the network, a topology solution with only a small number of nodes dead or added to the network is provided. A complete IPv6 addressing scheme is proposed. Nodes can easily find their own parent / child node. Based on this IPv6 addressing scheme, a corresponding routing algorithm is designed to ensure that there is a unique path between nodes for data packet delivery. (3) based on No.1) and No.2), this paper improves the 渭 TESLA protocol for the broadcast authentication of nodes. And combine it with GSRM strategy. By defining multiple Hash trees and GSRM-Hash trees and combining with ECC encryption scheme, a GSRM reproducing Hash chain is designed. When the Hash chain in 渭 TESLA protocol is finished, This allows the node to undeniably generate another complete Hash chain. 4) based on 1) and 2), aiming at the problem that an attacker can take a capture attack in a key update so as to predict the value of a key update with a high probability. In this paper, a homomorphic encryption algorithm, HEBM, is proposed based on matrix operation. It can ensure that the leader node can complete the whole work of the key update without knowing the privacy vector of the proxy node, and prove the correctness of the HEBM by mathematical formula. Finally, the performance evaluation of the above scheme is completed. The performance of GSRM and HEBM is analyzed and compared from storage, connectivity, delay, security, computing overhead and communication overhead. The comparison results show that the scheme of this paper has better performance in these aspects. In addition, the improved 渭 TESLA protocol is compared with 渭 TESLA protocol and multilevel 渭 TESLA protocol in storage, computation and communication. The improved 渭 TESLA protocol is superior to the 渭 TESLA protocol and the multilevel 渭 TESLA protocol.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 徐軍委;趙保華;屈玉貴;;WSN中IPv6路由算法的研究[J];中國科學(xué)技術(shù)大學(xué)學(xué)報;2007年12期

2 李建中,李金寶,石勝飛;傳感器網(wǎng)絡(luò)及其數(shù)據(jù)管理的概念、問題與進(jìn)展[J];軟件學(xué)報;2003年10期

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

，

本文編號：1943567