移动自组网的组密钥链更新算法  

Mobile Ad hoc network group key-chain update algorithm

作　　者：陈蹊[1] 赵跃龙[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广东广州510006

出　　处：《电子设计工程》2010年第5期1-3,7,共4页Electronic Design Engineering

基　　金：国家自然科学基金(60573145);教育部博士点基金项目(200805610019);广州市科技计划项目(2007J1-C0401)

摘　　要：针对移动自组网拓扑结构变化频繁,组密钥更新频率高,计算次数多,通信量巨大的特点,提出了一种新的组密钥管理算法—分布式组密钥链更新算法(DKCGR)。基于密钥链和左/右向性密钥结构设计了DKCGR算法。通过相邻节点生成共享密钥建立一条循环的密钥链和向左或者向右方向生成若干共享密钥,完成组密钥的更新。同时,借鉴LKH的树形密钥方案,将密钥链用4叉树表示。实验结果表明:DKCGR算法随着加入节点的增多其计算次数将是一个常数,有效控制计算量。与传统的LKH相比节约了n/2(n指节点数)次通信量。For mobile ad hoc network topology changes frequently, the group key updates times is frequent,huge calculations and giant traffic.A new group key management algorithm was presented, named Distributed Key-chain Group rekeying （DKCGR）.DKCGR was based on a key chain and the left/right of key structure.It used the shared secret key between the neighbor nodes to setup a cycle of key chain and was based on left/right direction structure to generate several shared keys, and to complete the group key updating. At the same time, in reference to the tree key of LKH algorithm, the key chain used tree structure to represent. Experimental results show that：as the node increasing, the DKCGR algorithm calculation times will be a constant.It effectively controls the calculation amount.Compared to traditional LKH, it saves n/2 （n refer to the number of nodes）times traffic.

关 键 词：组密钥管理 移动自组网 密钥链 分布式组密钥管理 

分 类 号：TP393.2[自动化与计算机技术—计算机应用技术]