發(fā)布時間：2018-06-19 12:30

  本文選題：兩層傳感網(wǎng)絡(luò) + 范圍查詢��； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：近年來,無線傳感網(wǎng)絡(luò)技術(shù)已經(jīng)得到了廣泛的應(yīng)用。作為一種特殊的無線傳感網(wǎng)絡(luò),兩層無線傳感網(wǎng)絡(luò)也得到了廣泛的關(guān)注。通過引入存儲節(jié)點作為中間層的兩層無線傳感網(wǎng)絡(luò)相對于傳統(tǒng)的無線傳感網(wǎng)絡(luò),其網(wǎng)絡(luò)拓撲更簡單、也更易于擴展。然而由于存儲節(jié)點在網(wǎng)絡(luò)中位置的特殊性,使得兩層無線傳感網(wǎng)絡(luò)中的數(shù)據(jù)安全性問題較之于傳統(tǒng)無線傳感網(wǎng)絡(luò)顯得更為突出。本文以兩層無線傳感網(wǎng)絡(luò)中的數(shù)據(jù)安全保護問題為研究背景,針對范圍查詢過程中所面臨的數(shù)據(jù)隱私威脅和查詢結(jié)果不一致性問題,從存儲節(jié)點不可信的角度出發(fā),研究了兩種安全范圍查詢處理方法,設(shè)計了仿真系統(tǒng)以驗證查詢處理方法的有效性,并進行通信代價的評估。具體工作如下:(1)提出了基于桶劃分技術(shù)的安全范圍查詢處理方法VP2RQ。該方法利用桶劃分技術(shù),并通過引入校驗碼融合機制實現(xiàn)范圍查詢過程中的數(shù)據(jù)隱私保護和查詢結(jié)果完整性驗證。VP2RQ通過對感知數(shù)據(jù)和查詢范圍進行桶劃分并標記相應(yīng)桶標簽,使存儲節(jié)點可根據(jù)桶標簽完成非明文數(shù)據(jù)的比較,從而保護數(shù)據(jù)的隱私性;在數(shù)據(jù)上傳階段產(chǎn)生校驗碼經(jīng)存儲節(jié)點上傳至基站,使基站可根據(jù)校驗碼判斷查詢結(jié)果的完整性;并通過校驗碼融合機制對校驗碼進行融合,以降低查詢過程中的通信代價。(2)提出了基于加密約束鏈機制的安全范圍查詢處理方法CSRQ。該方法采用0-1編碼和Hash身份驗證機制,對感知數(shù)據(jù)和查詢范圍進行編碼,實現(xiàn)存儲節(jié)點在無需明文數(shù)據(jù)參與下的數(shù)據(jù)比較;并提出一種新的加密約束鏈機制,通過在約束鏈中嵌入數(shù)據(jù)關(guān)系信息,使基站可通過該關(guān)系信息對查詢結(jié)果進行完整性驗證。通過理論和實驗分析表明,CSRQ在通信代價消耗上比現(xiàn)有安全查詢方法具有更良好的性能表現(xiàn)。(3)設(shè)計并實現(xiàn)了傳感器網(wǎng)絡(luò)數(shù)據(jù)查詢仿真系統(tǒng),用戶可通過該仿真系統(tǒng)實現(xiàn)對兩層傳感網(wǎng)絡(luò)數(shù)據(jù)查詢過程中數(shù)據(jù)采集階段的模擬,并可計算數(shù)據(jù)上傳過程中通信代價,同時可以將多個查詢算法進行對比,形成對比折線圖,便于清晰地比較不同查詢算法數(shù)據(jù)采集階段感知節(jié)點的通信代價。
[Abstract]:In recent years, wireless sensor network technology has been widely used. As a special wireless sensor network, two-layer wireless sensor network has also received extensive attention. Compared with the traditional wireless sensor network, the two-layer wireless sensor network with storage nodes as the intermediate layer is simpler in topology and easier to expand. However, due to the special location of storage nodes in the network, the data security problem in two-layer wireless sensor networks is more prominent than the traditional wireless sensor networks. In this paper, based on the research background of data security protection in two-layer wireless sensor networks, aiming at the problem of data privacy threats and inconsistency of query results in the process of range query, this paper starts from the point of view that storage nodes are not trusted. Two secure range query processing methods are studied. A simulation system is designed to verify the effectiveness of the query processing method and to evaluate the communication cost. The main work is as follows: (1) the security range query processing method VP2RQ based on bucket partitioning technology is proposed. This method uses bucket partitioning technology and implements data privacy protection and integrity verification of query results in the process of range query by introducing check code fusion mechanism. VP2RQ classifies the perceptual data and the query range and marks the corresponding bucket labels. The storage node can complete the comparison of the non-plaintext data according to the bucket label, so as to protect the privacy of the data; at the stage of data upload, the check code can be uploaded to the base station through the storage node, so that the base station can judge the integrity of the query result according to the check code. In order to reduce the communication cost in the process of query, a secure range query processing method CSRQ based on encryption constraint chain mechanism is proposed. This method uses 0-1 encoding and Hash authentication mechanism to encode the perceptual data and query range, and realizes the data comparison of storage nodes without the participation of plaintext data, and proposes a new encryption constraint chain mechanism. By embedding the data relational information in the constraint chain, the base station can verify the integrity of the query result by the relational information. The theoretical and experimental results show that CSRQ has better performance than existing secure query methods in communication cost consumption. (3) the sensor network data query simulation system is designed and implemented. Through the simulation system, the user can simulate the data acquisition stage of the two-layer sensor network data query process, and can calculate the communication cost in the process of data uploading. At the same time, many query algorithms can be compared to form a contrast broken line diagram. It is easy to compare the communication cost of different query algorithms in data acquisition stage.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP212.9;TN915.08

【參考文獻】

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

1 彭輝;陳紅;張曉瑩;曾菊儒;吳云乘;王珊;;面向雙層傳感網(wǎng)的隱私保護k-NN查詢處理協(xié)議[J];計算機學(xué)報;2016年05期

2 戴華;何瑞良;楊庚;黃海平;;基于桶劃分的兩層傳感網(wǎng)隱私保護Top-k查詢[J];北京郵電大學(xué)學(xué)報;2015年05期

3 戴華;楊庚;肖甫;周強;何瑞良;;兩層傳感網(wǎng)中能量高效的隱私保護范圍查詢方法[J];計算機研究與發(fā)展;2015年04期

4 劉泓暉;劉樹波;劉夢君;蔡朝暉;;面向兩層WSNs的高效隨機調(diào)制隱私保護最值查詢協(xié)議[J];計算機科學(xué);2014年12期

5 王濤春;秦小麟;劉亮;戴華;;兩層無線傳感器網(wǎng)絡(luò)中隱私保護的范圍查詢[J];北京郵電大學(xué)學(xué)報;2014年02期

6 戴華;楊庚;秦小麟;劉亮;;面向隱私保護的兩層傳感網(wǎng)Top-k查詢處理方法[J];計算機研究與發(fā)展;2013年06期

7 李睿;林亞平;易葉青;胡玉鵬;;兩層傳感器網(wǎng)絡(luò)中隱私與完整性保護的范圍查詢協(xié)議[J];計算機學(xué)報;2013年06期

8 李睿;林亞平;易葉青;熊帥;葉松濤;;兩層傳感器網(wǎng)絡(luò)中安全Top-k查詢協(xié)議[J];計算機研究與發(fā)展;2012年09期

9 范永健;陳紅;;兩層傳感器網(wǎng)絡(luò)中可驗證隱私保護Top-k查詢協(xié)議[J];計算機學(xué)報;2012年03期

10 潘群華;李明祿;張重慶;張文哲;伍民友;;無線傳感器網(wǎng)絡(luò)中的數(shù)據(jù)查詢[J];小型微型計算機系統(tǒng);2007年08期

，

本文編號：2039893