Re-keying analysis in group key management of wireless sensor networks

The exclusion basis system is a combinatorial formulation of group key management that provides long-term and flexible protection for wireless sensor networks while allowing for reasonable adjustment of the number of keys per node and the number of re-key messages. In this paper, we extend the work of Karst and Wicker to near-resolvable design, symmetric balanced incomplete block designs, and balanced incomplete block designs with the repetition count of a distinct pair of elements equal to one, and it is observed that near-resolvable design provides minimal re-keying compared to symmetric balanced incomplete block designs and balanced incomplete block designs. Also, near-resolvable design and exclusion basis system have the same re-keying size when the number of keys is \(n-1\) $n-1$ .