无线传感器网络位置隐私保护机制的研究与实现
发布时间：2018-10-08 11:51
【摘要】：智能传感器节点在个人手机、私家汽车、家庭安全监控等领域的广泛应用,给人们带来便利的同时也带来位置隐私泄露的问题。用于保护位置隐私的研究日趋活跃。本文以无线传感器网络事件监控为研究背景,以源节点位置隐私的保护为研究课题,针对现有位置隐私保护协议位置隐私保护性不高、网络能量消耗较大的问题,提出了一种保护节点位置隐私安全的方案。重点研究了消息定向发送阶段,消息转发时的路径生成问题、中间节点的消息收集问题和枢轴节点的位置选择问题。主要的研究内容如下:(1)在研究当前位置隐私保护方法和学习位置隐私保护所涉及的相关理论知识的基础上,基于其他文献对布朗运动的数学验证,当两个原子分别以不同的路径进行无规则的运动,这两条路径相交的概率为581 t--。提出了类布朗运动的环路路径方法,该方法利用哈希函数形成多条静态环路,来模拟从汇聚节点延伸出的布朗运动路径。理论分析了该方法的可行性,并证明了该方法的安全性。最后通过实验对该方法进行了验证。(2)针对攻击者依据通信链路反向追溯源节点问题,提出了一种消息定期收集的方案,来隐藏源节点真实发送数据包的时间。通过将及时发送的真实消息设为真,将延迟转发的消息设为假。通过正态分布检测方法,论证了该方法的安全性,并针对节点的消息缓冲队列,以排队论的M/G/1排队模型,对队列长度和逗留时间进行分析计算。从理论上论证了消息的延迟在可控的范围内。(3)枢轴节点利用拦截机制避免消息在网络中长时间随机转发,以降低网络的能耗。但如何部署中间节点位置是一个NP难问题。本文采用分割的方法将网络划分,将该问题转化成寻找局部的最佳位置的问题,利用最短路径方法找到每个区域中节点最短路径,构成解空间树。利用阈值对其进行修剪,保留最优解将其设为枢轴节点。最后证明了该方法的时间复杂度。(4)根据枢轴节点位置坐标,结合Voronoi图的LSH划分方法对网络进行了划分。完成了某区域默认中间转发节点的配置。利用java语言对该方法进行了实现。实验验证了该方案的可行性。综上所述,本文结合无线传感器节点的特点,针对源节点位置隐私问题。提出基于了基于布朗运动的位置隐私保护算法和基于枢轴节点优化配置的隐私保护算法。最后对所提出的方法进行了实验并进行了结果分析,达到了预期的安全效果。
[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.
【学位授予单位】：电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5;TP309
本文编号：2256641
[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.
【学位授予单位】：电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5;TP309
【参考文献】
相关期刊论文 前1条
1 杨静;唐泉;;维纳和布朗运动[J];数学的实践与认识;2008年10期
相关硕士学位论文 前1条
1 詹志勇;无线传感器网络节点的分布式体系结构研究[D];华南理工大学;2011年
，本文编号：2256641
本文链接：https://www.wllwen.com/kejilunwen/wltx/2256641.html
