Key Predistribution Scheme Based On Covering Designs For Sensor Networks

Wireless sensor networks has received much attention recently years. Research onsensor networks is a multidisciplinary science. Security for sensor networks is one ofthe most challenging subject on this area. Key distribution is the core to guarantee thesecurity of networks.Since the limitation of energy and computational power, lower storage, traditionalkey distribution schemes are not suitable for sensor networks. Consequently, many keydistribution schemes in which shared keys or message that can generate keys (such aspolynomial,vectoretc)aredistributedbeforedeploymentareproposed,Twosensornodesin communication range can communicate if they share a common key or message. Howto distribute key plays an important role for the behavior of key distribution scheme. Re-cently, Camtepe and Yener, Stinson,Ruj and Roy,Lee and Stinson proposed using bal-anced incomplete block design, group design, common intersection design and expandergraph to distribute keys for sensor nodes.In this thesis, we proposed a new approach based on covering design to distributekeys for sensor nodes. Our method remedies the weak of previous method for their strictrestriction on the parameters such as the number of nodes, the length of key-chain andresilience. We analysis by theoretically or experimentally the behavior of our methodon the circumstance of random deployment of sensor nodes or the rule of deployment isknown. We find that the resilience and connectivity of our scheme is better than previousschemes. Finally, we look into the future in the study of key predistribution for sensornetworks, some problem for further study are proposed .