Computation of Tree Structure in Wireless Ad Hoc Network When Members Leave off
Qiao Tong-xu · Communications technology · 2009
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.