检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用》2008年第5期1158-1160,1163,共4页journal of Computer Applications
摘 要:分析现有密钥元更新方案存在的问题,提出一种基于令牌环的密钥元更新方案,方案基于分簇AdHoc网络体系结构,包括门限更新和更新组扩展两个阶段。门限更新阶段由簇首发起,可以有效防止多个数字证书中心(CA)节点在同一更新期发起密钥元更新的冲突;第二阶段通过更新组完成其他CA节点的密钥元更新,减少网络风暴发生的概率。另外方案提出一种不同更新期密钥元冲突解决办法,借助NS2仿真工具证实了方案的有效性。This paper analyzed the advantages and disadvantages of existing secret share update schemes in Ad Hoc network, presented a token-ring based secret share update scheme. , This scheme was established according to Ad Hoc network architecture. It included threshold update phase and update group spread phase. Threshold update phase, initiated by cluster head, can effectively avoid the conflict of more than one node initiating secret share update at the same update period. The second phase finished the secret share update of other Certification Authorities (CA) nodes by the update group, which reduced the probability of network storm. In addition, the scheme also put forward a method to tackle the conflict arising from different period secret shares; finally, simulations confirmed the effectiveness of our design.
关 键 词:AD Hoe网络 簇 移动对手 密钥元更新 令牌
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222