Key Management Scheme Of Wireless Sensor Networks Based On Combinatorial Design

Wireless sensor network has important applications such as remote of environmental monitoring and target tracking. Wireless sensor networks has received much attention recently years. Security for sensor networks is one of the most challenging subject on this area. Key distribution is the core to guarantee the security of networks.Many key distribution schemes in which shared keys or message that can generate keys(such as polynomial,vectoretc)are distributed before deployment are proposed,Two sensor nodes in communication range can communicate if they share a common keyHow to distribute key plays an important role for the behavior of key distribution scheme. Recently, Camtepe and Yener, Stinson、Ruj and Roy、Lee and Stinson proposed using balanced incomplete block design, symmetrical design, tranversal design to distribute keys for sensor nodes. In this thesis, we proposed a new approach based on covering design to distribute keys for sensor nodes. Our method remedies the weak of previous method for their strict restriction on the parameters such as the number of nodes, the length of key-chain and resilience.We analysis by theoretically or experimentally the behavior of our method on the circumstance of random deployment of sensor nodes or the rule of deployment is known. We find that the resilience and connectivity of our scheme is better than previous schemes. Finally, we look into the future in the study of key predistribution for sensor networks, some problem for further study are proposed.