基于组播通信代价的分簇密钥管理方案  

CLUSTERING KEY MANAGEMENT SCHEME BASED ON MULTICAST COMMUNICATION COST

作　　者：刘志宇[1] 马宝英[2] 姚念民[3] 范书平[1] 邢军[1] 

机构地区：[1]牡丹江师范学院工学院,黑龙江牡丹江157011 [2]牡丹江医学院卫生管理学院,黑龙江牡丹江157011 [3]大连理工大学计算机学院,辽宁大连116024

出　　处：《计算机应用与软件》2015年第9期269-273,共5页Computer Applications and Software

基　　金：国家自然科学基金项目(61073047);黑龙江省智能教育与信息工程重点实验室开放基金项目(IEF2012-01);中央高校基本科研业务费专项基金项目(HEUCFT1202;HEUCF100609);黑龙江省教育厅人文社会科学项目(12532393);黑龙江省教育厅科学技术研究项目(12513094);牡丹江市科学技术计划项目(Z2013s042)

摘　　要：针对组播网络安全问题,提出一种基于组播成员通信代价的密钥管理方案。新方案首先根据节点间的通信距离、能量采用Kruskal算法来构造簇头间路由树,簇内普通节点与本簇簇头间为星型拓扑。之后考虑树中兄弟节点关系将路由树映射成逻辑密钥树,密钥树中叶子节点与簇头成员一一对应。最后实现组播成员的动态加入与删除。理论分析与Matlab仿真实验表明,所提出方案适用于大规模的组播通信,在减少组成员存储量的同时,降低了组成员的通信开销。For multicast network security problem, we propose a key management scheme which is based on the communication cost of multicast members. The new scheme first uses Kruskal algorithm to construct inter-cluster head routing tree according to the communication distance and energy between nodes, and the star topology is generated among ordinary nodes and the cluster head within one cluster. Then the routing tree is mapped into logical key tree considering the relationship between sibling nodes, and the leaf nodes in key tree correspond with their own cluster head members. Finally, the dynamic join and deletion for multicast members is achieved. Theoretical analysis and Matlab simulation experiment show that the proposed scheme is applicable to large-scale multicast communication, and lowers the communication overhead of members while reducing the storage of members.

关 键 词：组播通信 KRUSKAL算法 分簇 密钥管理方案 开销 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置]