检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京科技大学计算机与通信学院,北京100083 [2]安徽财经大学管理科学与工程学院,安徽蚌埠233041
出 处:《计算机应用研究》2013年第3期878-881,共4页Application Research of Computers
基 金:国家自然科学基金资助项目(60773074);国家"863"计划资助项目(2007AA01Z213;2009AA01Z209);安徽省高等学校自然科学研究项目(KJ2010B005);安徽省高校优秀青年人才基金资助项目(2009SQRZ084)
摘 要:针对效率依赖网络规模的群密钥管理方案在大规模Ad hoc网络中非均衡,在更新时延威胁前向安全性这一问题,设计了性能优化的群密钥管理方案,通过跳数对网络分层,层中建立完全子图和星形子图,选择和设计性能相同的常数轮协议协商和管理群密钥,协议复杂度与网络半径相关。理论分析和仿真实验证明该方案更适合大规模Ad hoc网络。Group key management schemes whose efficiency is based on network scale are not adapted to the large scale Ad hoc networks, and threat the forward security during key updating because the efficiency of group key management is not bal- ance among clusters whose scales are not same. To deal with the problem, this paper designed the performance optimization group key management (POGKM) scheme. It divided the larger scale Ad hoc network into multi clusters by two kinds of topol- ogies including complete sub-graph and star sub-graph, and built multilayer with hop count. To get the same efficiency of group key management in complete sub-graph and star sub-graph constant rounds, it designed and selected group key protocols. The efficiency complexity of POGKM was relatied to the network radius. At last, theory analysis and experimental verification prove POGKM is more appropriate to the large scale Ad hoc network than other schemes, especially Ad hoc networks having short radius and high density.
关 键 词:大规模 AD HOC网络 群密钥管理 网络半径 安全
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15