基于最小连通支配集的CRL分发系统研究  

Study on CRL Distribution System Based on Minimum Connected Dominating Set

作　　者：高申勇[1] 张颖[1] 戴国骏[2] 

机构地区：[1]浙江水利水电专科学校计算机与信息工程系,杭州310018 [2]杭州电子科技大学计算机学院,杭州310018

出　　处：《电信科学》2012年第4期79-83,共5页Telecommunications Science

基　　金：浙江省重点科技创新团队基金资助项目(No.2011R09046-02)

摘　　要：CRL(certification revocation list,证书撤销列表)分发效率是制约PKI在无线网络中应用的重要因素之一。针对无线网络节点能量有限的不足和CRL分发的实时性要求,提出了基于最小连通支配集的"推"方式分发方法,并设计了CRL广播分发协议,协议的设计包括数据结构和报文格式、广播树构造描述,并在协议基础上设计CRL分发系统,最后利用NS-2仿真平台进行模拟仿真。仿真结果表明,当合理设置定时器等待时间时,该系统不仅能适应节点较多的网络,并可以保证较好的传输率、较低的传输开销及较短的传输时间,具有一定应用价值。efficiency of CRL distribution was one of the most important factors, which related to PKI used in wireless network. Because of limited energy in wireless network and distribution of CRL in time, this paper proposed CRL distribution based on minimum connected dominating set and designed the protocol which included the description of date structure, packet format and the construction of broadcast tree. Based on this protocol, we designed the CRL distribution system.Finally, we simulated with NS-2, and the result showed that this system could adapt the network with more nodes and ensure better delivery ratio, lower delivery cost and shorter time cost, it had certain application value.

关 键 词：最小连通支配集 CRL分发系统 无线网络 

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