Design And Research On Key Management Schemes In Wireless Sensor Network

Wireless sensor network is constituted by a large number of sensor nodes.In recent years, it has been widely used in military surveillance, environmental monitoring, traffic management and other fields because it has many advantages such as strong anti-interference, arranged fast, low correlation between the nodes and strong ability to adapt the environments. Since the sensor nodes are often deployed in unattended or even hostile environment, so the security of the network is also important. Wireless sensor network security technologies include secure routing technology, authentication technology and key management technology, this thesis mainly studies the key management schemes. Since the node energy, computing power, storage space, and communication capacity is limited, key management scheme of WSN who is different from traditional wireless networks, not only ensures network security but also need to consider the storage overhead, communication overhead and other issues.Based on the analysis and study on the knowledge of wireless sensor networks, focusing in clustered wireless sensor networks,this thesis researches on its key management schemes.To resolve the question that the connectivity and survivability in typical key pre-distribution schemes of clustered sensor network is poor, the node overhead is large and other issues,combining the Chinese remainder theorem and random matrix key pre-distribution method, this thesis proposes a key management scheme. In this scheme the cluster head nodes use the Chinese Remainder Theorem to build the communication keys with their cluster member nodes, and use the random matrices to pre-distribute key between the other cluster head nodes. The scheme not only overcomes the disadvantage of unity when it using Chinese remainder theorem to establish communication keys in cluster, but also overcome the defficiency of large overhead when it generating a matrix to establish communication keys among cluster heads. This thesis uses the Matlab to simulate the proposed scheme.By analyzing this scheme and comparing it with other schemes it shows that this scheme achieves a higher network connectivity and resistance at the expense of smaller storage overhead.