An optimal certificate dispersal algorithm for mobile ad hoc networks
An optimal certificate dispersal algorithm for mobile ad hoc networks
复制标题
移动自组织网络的最优证书分发算法
DOI：
10.1093/ietfec/e88-a.5.1258
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
K. Wada
中科院分区：
文献类型：
--
作者：
Hua Zheng;Shingo Omura;Jiro Uchida;K. Wada
本文主要研究在自组织网络中，如何利用证书分发系统在两个用户之间安全地发送消息。在本文中，我们构造了两个有效的证书分发算法。我们证明了对于强连通图G =（V，E）和有向图H=（V '，E'），一个节点上存储的证书平均数目的可分散性代价的新上界是O（D/subG/+| E|/|V|）和O（pd/sub max/+| E'|/|V'|其中D/sub G/是G的直径，d/sub max/是H的强连通分支的最大直径，p是H的强连通分支的个数.此外，我们可以证明我们的算法是最佳的几个图类。
We focus on the problem that in an ad hoc network, how to send a message securely between two users using the certificate dispersal system. In this paper, we construct two efficient certificate dispersal algorithms. We can prove that for a strongly connected graph G = (V, E) and a directed graph H= (V', E'), new upper bounds on dispersability cost on the average number of certificates stored in one node are O(D/sub G/+|E|/|V|) and O(pd/sub max/+|E'|/|V'|) respectively, where D/sub G/ is the diameter of G, d/sub max/ is the maximum diameter of strongly connected components of H and p is the number of strongly connected components of H. Furthermore, we can prove our algorithms are optimal for several graph classes.