无线Ad Hoc网络树形结构成员退出时计算量的研究

Computation of Tree Structure in Wireless Ad Hoc Network When Members Leave off

Ad-Hoc网络包括多种网络结构,其中树形结构综合性能最佳,是未来研究的主要方向。树形结构协议包括组密钥协商、成员加入时密钥更新、成员退出时密钥更新、组合并时密钥更新,其中成员退出是树形结构的难点,文章对成员退出协议进行了深入的研究,给出了详细的算法描述和分析描述,并通过复杂的推导得到了最终的有效计算公式,这些工作有助于以后对混合结构的研究。

Ad hoc network comprises multiple net structures, of which the tree structure has the best comprehensive performance, and would be the main direction for future research .The protocol of tree structure includes group-key generation, group-key updating when members join or exit, or groups merge, among which members＇ exit is the difficult point. An in depth research on the member-exit protocol is carried out, the detailed algorithm description and analysis is given, and final formulas are obtained by complicated deduction. And all these would be of much help to the future work on commixed structures.