Abstract:Designing an efficient key establishment scheme is of great importance to the data security in Wireless Sensor Networks. The traditional cryptographic techniques are impractical in Wireless Sensor Networks because of associated high energy and computational overheads. This algorithm supports the establishment of three types of keys for each sensor node, an individual key shared with the base station, a pair wise key shared with neighbor sensor node, and a group key that is shared by all the nodes in the network. The algorithm used for establishing and updating these keys are energy efficient and minimizes the involvement of the base station. Polynomial function is used in the study to calculate the keys during initialization, membership change and key compromise. Periodically the key will be updated. To overcome the problem of energy insufficiency and memory storage and to provide adequate security, the energy efficient scheme is proposed. It works well in undefined deployment environment. Unauthorized nodes should not be allowed to establish communication with network nodes. This scheme when compared with other existing schemes has a very low overhead in computation, communication and storage.

No abstract

No abstract

No abstract

Problem statement: Key management is an important cryptographic technique for providing security in a dynamic environment of sensor networks. To provide a secure communication among a group of sensor nodes keys should established in an efficient manner. We introduced an efficient and dynamic key management system for dynamic sensor networks. Approach: We pre deployed some of the keying materials in all the nodes and keys are calculated using keying materials and some random matrix which is distributed by Group Controller node. If there is any change in the member ship then re-keying process will be performed to change the old group key. Results: Our key management system eliminates the storage of long keys and it will improve the network resilience. It provides the forward and backward secrecy among the group of nodes. It reduces the computation overhead of group controller and also the communication overhead. Conclusion: Experimental results show that the proposed method perform very well for improving the success ratio of key establishment and enhance security while reducing the communication overhead and resource consumption.