检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学计算机学院,江苏南京210003
出 处:《计算机技术与发展》2016年第9期129-133,共5页Computer Technology and Development
基 金:国家242信息安全计划(2012A138);江苏省高校自然科学研究面上资助项目(16KJB510034);南京邮电大学校引进人才科研启动基金项目(NY212012;NY214065)
摘 要:群集(也称子群)方法在应对大范围网络的节点攻击中表现出色,同时在具有可扩展、数据聚合和安全性的大规模分布式传感器网络中,聚类的方法也拥有较好的可用性。在不同部署区域内节点的被攻击概率已知的情况下,利用先验概率能够设计有更好应变能力和保证通信安全的随机密钥预分发算法。同时,在节点被攻击概率上考虑了子群节点的密钥链长度,设计了一种能够有效抵御传感器网络中子群被攻击的高效安全机制。仿真结果表明,与其他方案相比,该方案通过适度牺牲网络中两节点间共享密钥的存在概率,能够达到显著改善网络性能的目的。Subgrouping has an effective performance in compartmentalizing node compromise in large-scale networks. Clustering method has also been known useful for providing scalable data aggregation and security in Distributed Sensor Networks (DNSs). Taking the probability of node compromise in different deployment regions in consideration, the aprion knowledge is used to design a variant of ran- dom key pre-distribution scheme that can improve the whole network resilience and hence the fraction of compromised in contrast with the previous works. Also the size of key ring stored in subgroup node and the probability of node compromise is consid- erd, and a more effective scalable security mechanism is designed that increases the resilience to the attack in the sensor subgroups. Simu- lation shows that the performance of the scheme proposed can be substantially improved in the sensor network,including both the resili- ence and the fraction of compromised communications by only sacrificing a small extent in the probability of a shared key exists between two nodes compared with those previous methods.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.148.147