In this paper, we focus on the problem that in an ad hoc network, how to send a message securely between two users using the certificatedispersal system. In this system, special data called certificate is issued betw...
详细信息
In this paper, we focus on the problem that in an ad hoc network, how to send a message securely between two users using the certificatedispersal system. In this system, special data called certificate is issued between two users and these issued certificates are stored among the network. Our final purpose on this certificatedispersal problem is to construct certificate graphs with lower dispersability cost which indicates the average number of certificates stored in each node in an ad hoc network. As our first step, when a certificate graph is given, we construct two efficient certificate dispersal algorithms for strongly connected graphs and directed graphs in this paper. We can show 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-G + vertical bar E vertical bar/vertical bar V vertical bar) and O(p(G)d(max) + vertical bar E'vertical bar/vertical bar V'vertical bar) respectively, where D-G is the diameter of G, d(max) is the maximum diameter of strongly connected components of H and PG is the number of strongly connected components of H. Furthermore, we give some new lower bounds for the problem and we also show that our algorithms are optimal for several graph classes.
暂无评论