Centralized Key Management Scheme in Wireless Sensor Networks

Abstract

Today, key management is widely recognized as an important aspect of security in wireless sensor networks. In these networks, sensor nodes can be either mobile or static. Therefore, supporting the mobility of the nodes can be regarded as a purpose of key management schemes. In our previous work, we presented a key management scheme that was more efficient with respect to security and connectivity compared to the other ones. In that scheme, it is assumed that the nodes are static. In this paper we are going to present a scheme that supports the mobility of the nodes and makes the initial scheme more flexible. The basic criterion for the evaluation of the scheme is the communication overhead. First, the nodes establish a secure link with the cluster heads and then establish a secure link among themselves with the help of the cluster heads. We have analyzed this scheme with regards to the communication overhead and we will compare it with the other schemes.

A Key Management Scheme for IoTs Based on China Remainder Theorem

“…Network model According to different applications and network style, the Internet of things is divided into different regions [9]. Assuming each regions has Control Center(CC) ,which collect information from other nodes by GPS network architecture, and compute location such as distance and angle which are used to divide regions.…”

New Framework for Enhanced Secure Key Management in Hierarchical Wireless Sensor Network

“…Various work have been proposed so far in the field of key management with many of them focusing on the random key distribution among the nodes in the network [1]Chan et al [2]the q-composite key pre-distribution, Zhu et al [3] give Localized Encryption and Authentication Protocol(LEAP) Other schemes based on the distance were also proposed for the key management [4,5,6,7]. The RKPH [4] scheme is based on Random key distribution and uses different keys in different clusters and takes distance of sensor node from their cluster head into account.…”

“…The RKPH [4] scheme is based on Random key distribution and uses different keys in different clusters and takes distance of sensor node from their cluster head into account. It preloads some base keys into sensor and the new keys are derived by considering the distance of sensor node from their cluster head and to which cluster does the sensor node belongs.…”

“…As compared to the all the previous work [4,5,6,8] done in enhancing the secure key management the advantage of our proposed work is that it provides the enhanced security services for both the inter and intra cluster communication in a hierarchical wireless sensor network and also address the challenging runtime security by using the localization of key material and design of robust key generation mechanism. All the previous work done has failed to address the intra cluster communication at the runtime due to this various loop holes in security can be utilized by the adversary to attack the network.…”

“…All the previous work done has failed to address the intra cluster communication at the runtime due to this various loop holes in security can be utilized by the adversary to attack the network. Moreover our proposed work doesn't requires any special kind of nodes like RKPH [4],LDK [14] which makes it easy to deploy in practical scenario and also doesn't requires GPS devices. The use of hierarchical network for localizing the key material to nodes and easy hop count mechanism adds advantage to our scheme as compared from other proposed work.…”