摘要

Key distribution is one of the most challenging security issues in wireless sensor networks. To achieve a high level of security, each pair of nodes must share a secret key in order to communicate with each other. Recently, many researchers have used combinatorial designs as key pre-distribution scheme in wireless sensor networks. In this paper, we describe a new construction of a design in combinatorial algebraic called residual design and use it for key establishment. This is the first time for application of residual design. Our approach is a highly scalable key management scheme for wireless sensor networks which provides a good secure connectivity. We show that the basic mapping from residual design to key pre-distribution has an extremely high network scalability while this mapping does not have high resilience. Therefore, we present a new approach for key pre-distribution based on residual design that improves the resilience of the network while maintaining connectivity and high scalability. We also explain that the computational cost and storage overhead is low. Performance and security properties of the proposed scheme are studied both analytically and computationally to compare our scheme to main existing schemes. The obtained results show that at equal key-ring size, our scheme provides better scalability with high connectivity and resilience.

  • 出版日期2017-9