【摘要】：智能傳感器節(jié)點(diǎn)在個(gè)人手機(jī)、私家汽車、家庭安全監(jiān)控等領(lǐng)域的廣泛應(yīng)用,給人們帶來便利的同時(shí)也帶來位置隱私泄露的問題。用于保護(hù)位置隱私的研究日趨活躍。本文以無線傳感器網(wǎng)絡(luò)事件監(jiān)控為研究背景,以源節(jié)點(diǎn)位置隱私的保護(hù)為研究課題,針對現(xiàn)有位置隱私保護(hù)協(xié)議位置隱私保護(hù)性不高、網(wǎng)絡(luò)能量消耗較大的問題,提出了一種保護(hù)節(jié)點(diǎn)位置隱私安全的方案。重點(diǎn)研究了消息定向發(fā)送階段,消息轉(zhuǎn)發(fā)時(shí)的路徑生成問題、中間節(jié)點(diǎn)的消息收集問題和樞軸節(jié)點(diǎn)的位置選擇問題。主要的研究內(nèi)容如下:(1)在研究當(dāng)前位置隱私保護(hù)方法和學(xué)習(xí)位置隱私保護(hù)所涉及的相關(guān)理論知識的基礎(chǔ)上,基于其他文獻(xiàn)對布朗運(yùn)動(dòng)的數(shù)學(xué)驗(yàn)證,當(dāng)兩個(gè)原子分別以不同的路徑進(jìn)行無規(guī)則的運(yùn)動(dòng),這兩條路徑相交的概率為581 t--。提出了類布朗運(yùn)動(dòng)的環(huán)路路徑方法,該方法利用哈希函數(shù)形成多條靜態(tài)環(huán)路,來模擬從匯聚節(jié)點(diǎn)延伸出的布朗運(yùn)動(dòng)路徑。理論分析了該方法的可行性,并證明了該方法的安全性。最后通過實(shí)驗(yàn)對該方法進(jìn)行了驗(yàn)證。(2)針對攻擊者依據(jù)通信鏈路反向追溯源節(jié)點(diǎn)問題,提出了一種消息定期收集的方案,來隱藏源節(jié)點(diǎn)真實(shí)發(fā)送數(shù)據(jù)包的時(shí)間。通過將及時(shí)發(fā)送的真實(shí)消息設(shè)為真,將延遲轉(zhuǎn)發(fā)的消息設(shè)為假。通過正態(tài)分布檢測方法,論證了該方法的安全性,并針對節(jié)點(diǎn)的消息緩沖隊(duì)列,以排隊(duì)論的M/G/1排隊(duì)模型,對隊(duì)列長度和逗留時(shí)間進(jìn)行分析計(jì)算。從理論上論證了消息的延遲在可控的范圍內(nèi)。(3)樞軸節(jié)點(diǎn)利用攔截機(jī)制避免消息在網(wǎng)絡(luò)中長時(shí)間隨機(jī)轉(zhuǎn)發(fā),以降低網(wǎng)絡(luò)的能耗。但如何部署中間節(jié)點(diǎn)位置是一個(gè)NP難問題。本文采用分割的方法將網(wǎng)絡(luò)劃分,將該問題轉(zhuǎn)化成尋找局部的最佳位置的問題,利用最短路徑方法找到每個(gè)區(qū)域中節(jié)點(diǎn)最短路徑,構(gòu)成解空間樹。利用閾值對其進(jìn)行修剪,保留最優(yōu)解將其設(shè)為樞軸節(jié)點(diǎn)。最后證明了該方法的時(shí)間復(fù)雜度。(4)根據(jù)樞軸節(jié)點(diǎn)位置坐標(biāo),結(jié)合Voronoi圖的LSH劃分方法對網(wǎng)絡(luò)進(jìn)行了劃分。完成了某區(qū)域默認(rèn)中間轉(zhuǎn)發(fā)節(jié)點(diǎn)的配置。利用java語言對該方法進(jìn)行了實(shí)現(xiàn)。實(shí)驗(yàn)驗(yàn)證了該方案的可行性。綜上所述,本文結(jié)合無線傳感器節(jié)點(diǎn)的特點(diǎn),針對源節(jié)點(diǎn)位置隱私問題。提出基于了基于布朗運(yùn)動(dòng)的位置隱私保護(hù)算法和基于樞軸節(jié)點(diǎn)優(yōu)化配置的隱私保護(hù)算法。最后對所提出的方法進(jìn)行了實(shí)驗(yàn)并進(jìn)行了結(jié)果分析,達(dá)到了預(yù)期的安全效果。
[Abstract]:The wide application of smart sensor nodes in the fields of personal mobile phone, private car, home security monitoring and so on, not only brings convenience to people, but also brings about the problem of location privacy leakage. Research on the protection of location privacy has become increasingly active. In this paper, the wireless sensor network event monitoring as the research background, the source node location privacy protection as a research topic, the existing location privacy protection protocol location privacy protection is not high, the network energy consumption is large. A scheme to protect node location privacy is proposed. In this paper, we focus on the problem of message orientation, path generation, message collection and location selection of pivot nodes. The main research contents are as follows: (1) on the basis of studying the current location privacy protection methods and learning the relevant theoretical knowledge of location privacy protection, based on other literatures to verify the Brownian motion mathematics, When two atoms move irregularly with different paths, the probability of intersecting the two paths is 581 t -. This paper presents a loop path method for Brownian motion, which uses hash functions to form several static loops to simulate the Brownian motion paths extending from convergent nodes. The feasibility of the method is analyzed theoretically, and the safety of the method is proved. Finally, the method is verified by experiments. (2) aiming at the problem of the attacker tracing the source node in reverse direction according to the communication link, a message collection scheme is proposed to hide the time when the source node actually sends the data packet. By setting the real message sent in time as true, the delayed forwarding message is set to false. The security of this method is demonstrated by the normal distribution detection method, and the queue length and sojourn time are analyzed and calculated based on the M/G/1 queuing model of queuing theory for message buffering queues of nodes. It is theoretically proved that the delay of messages is within a controllable range. (3) the pivot node uses interception mechanism to avoid long time random forwarding of messages in the network to reduce the energy consumption of the network. However, how to deploy the intermediate node location is a difficult problem for NP. In this paper, the partition method is used to divide the network, and the problem is transformed into the problem of finding the best local location. The shortest path method is used to find the shortest path of nodes in each region, and the solution space tree is constructed. The threshold value is used to prune it and the optimal solution is retained to set it as a pivot node. Finally, the time complexity of the method is proved. (4) the network is partitioned according to the position coordinates of the pivot nodes and the LSH partition method of the Voronoi diagram. The configuration of the default intermediate forwarding node is completed. The method is implemented by java language. The feasibility of the scheme is verified by experiments. To sum up, this paper combines the characteristics of wireless sensor nodes, aiming at the source node location privacy problem. The location privacy protection algorithm based on Brownian motion and the privacy protection algorithm based on the optimal configuration of pivot nodes are proposed. Finally, the proposed method is tested and the results are analyzed, and the expected safety effect is achieved.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP212.9;TN929.5;TP309

【參考文獻(xiàn)】

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

1 楊靜;唐泉;;維納和布朗運(yùn)動(dòng)[J];數(shù)學(xué)的實(shí)踐與認(rèn)識;2008年10期

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

1 詹志勇;無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)的分布式體系結(jié)構(gòu)研究[D];華南理工大學(xué);2011年

，

本文編號：2256641