Vahid Modiri - Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
Hamid Haj Seyyed Javadi - Department of Mathematics and Computer Science, Shahed University, Tehran, Iran
Amir Masoud Rahmani - Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
Mohaddese Anzani - Department of Mathematics and Computer Science, Shahed University, Tehran, Iran

Combinatorial designs are powerful structures for key management in wireless sensor networks to address good connectivity and also security against external attacks in large scale networks. Many researchers have used key pre-distribution schemes using combinatorial structures in which key-rings, are pre-distributed to each sensor node before deployment in a real environment. Regarding the restricted resources, key distribution is a great engagement and challenging issue in providing sufficient security in wireless sensor networks. To provide secure communication, a unique key should be found from their stored key-rings. Most of the key pre-distribution protocols based on public-key mechanisms could not support highly scalable networks due to their key storage overhead and communication cost that linearly increasing. In this paper, we introduce a new key distribution approach for hierarchical clustered wireless sensor networks. Each cluster has a construction that contains new points or that reinforces and builds upon similar ideas of their head clusters. Based on Residual Design as a powerful algebraic combinatorial architecture and hierarchical network model, our approach guarantees good connectivity between sensor nodes and also cluster heads. Compared with similar existing schemes, our approach can provide sufficient security no matter if the cluster head or normal sensor node is compromised.

Wireless sensor networks; Key pre-distribution; Residual Design; Hierarchical network model