检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学信息科学与工程学院,长沙410083
出 处:《小型微型计算机系统》2014年第2期311-318,共8页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(60870010)资助
摘 要:提出了一种新颖的追踪时间受限的路由策略来有效保护源节点位置隐私保护.其主要核心是:源节点到sink节点的路由路径是动态随机产生与分布,而每次路由维持的时间小于攻击者能够追踪到幻象节点的时间,使得攻击者难以追踪到幻象节点,更难以追踪到真实源节点,从而提高了源节点位置的保护强度.策略的难点是:在传感器节点能量受限的情况下,依据传感器网络"多对一"的数据收集特征,充分利用能量充裕区域的能量形成动态的,路径足够长的路径,而在能量紧张区域只产生必要的路由路径,从而达到了既有效保护了源节点又保证了网络寿命的最大化.我们将此关键问题转化为一个能量受限情况下最大网络寿命问题,分析给出了解决方法.通过理论分析与大量的实验结果表明本文的策略在网络寿命不低于以往研究网络寿命的情况下,大大提高了源节点位置隐私保护的安全性.This paper proposed a novel tracing time-constrained routing algorithm to achieve privacy protection. The core idea is that the routing path from the source node to the sink is generated and distributed dynamically and randomly, and its lasting time is shorter than the time for adversary to trace to the phantom node, then it is more difficult for the adversary to trace to the source, and thus in- crease the protection strength. The difficulty of this algorithm is that under the multi-to-one data collection mode and with limited en- ergy, how to generate dynamic and long enough path in the region of abundant energy and generate only necessary path in the region of tension energy, and thus achieve privacy protection as well as network lifetime maximization. We transferred this problem into life- time maximization with limited energy and then gave the solution. Through theoretical analysis and large number of experiments, re- suits show that the algorithm in this paper can greatly improve the source location privacy with lifetime no less than lifetime in previous research.
关 键 词:无线传感器网络 源节点位置隐私保护 动态路由 追踪时间 网络寿命
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222