Dynamic Cluster Key Management Scheme on Wireless Sensor Networks

Wireless sensor networks are open architectures, so any potential threat can easily intercept, wiretap and counterfeit the information. Therefore, the safety of WSN is very important. Since any single key system cannot guarantee the security of the wireless sensor network for communications, this paper introduces a hierarchical key management scheme based on the different abilities of different sensor nodes in the clustered wireless sensor network. In this scheme, the nodes are distributed into several clusters, and a cluster head must be elected for each cluster. Private communication between cluster heads is realized through the encryption system based on the identity of each head while private communication between cluster nodes in a same cluster head is achieved through the random key preliminary distribution system. Considering the characteristics of WSN, we adopt dynamic means called dynamic cluster key management scheme to deal with master key, so master key will be updated according to the changed dynamic network topology. For cluster head node plays a pivotal role in this scheme, a trust manage-ment system should be introduced into the election of the cluster head which will exclude the malicious node from outside the cluster, thus improve the whole network security.

Key-insulated encryption based group key management for wireless sensor network

The key exposure problem is a practical threat for many security applications. In wireless sensor networks (WSNs), keys could be compromised easily due to its limited hardware protections. A secure group key management scheme is responsible for secure distributing group keys among valid nodes of the group. Based on the key-insulated encryption (KIE), we propose a group key management scheme (KIE-GKMS), which integrates the pair-wise key pre-distribution for WSN. The KIE-GKMS scheme updates group keys dynamically when adding or removing nodes. Moreover, the security analysis proves that the KIE-GKMS scheme not only obtains the semantic security, but also provides the forward and backward security. Finally, the theoretical analysis shows that the KIE-GKMS scheme has constant performance on both communication and storage costs in sensor nodes.

Cluster Based Secure Dynamic Keying Technique for Heterogeneous Mobile Wireless Sensor Networks

In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node's average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.

Review of Key Management Mechanisms in Wireless Sensor Networks

Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key pre-distribution, polynomial-based, Blom's matrix-based, and deterministic key pre-distribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.

Application Independent Dynamic Group-Based Key Establishment for Large-scale Wireless Sensor Networks

Key establishment and its management in Wireless Sensor Networks(WSN) is a challenging problem due to its limited resources and disordered structure. Many key management schemes have been developed recently for WSN to provide secure communication between source and destination sensor nodes.A serious threat highlighted in all of these schemes is that of node capture attacks,where an adversary gains full control over a sensor node through direct physical access.Node capture attacks can also be helpful to an adversary in new attacks like Blackhole and Denial of Service.All of these proposed key management solutions still suffer from node capture attacks with resilience.The current sensor networks are assumed to be designed for specific applications,having key management protocols strongly coupled to applications.The future sensor networks are envisioned as comprising heterogeneous devices assisting to a large range of applications.To achieve this goal,a new application independent approach is needed. In this paper we therefore present a novel,extended version of our previously published Dynamic Group-based Key Establishment(DGKE) protocol. We compare the proposed scheme with existing key management schemes,which shows a significant improvement in resilience against node capture attacks,memory overhead and connectivity.

Empirical Study of Tree Parity Machine and Its Applicationon Key Management for Wireless Sensor Networks

In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is comparatively discussed. A full empirical study on the stability and security of the TPM weight synchronization is conducted in detail. Then two improvement methods for the weight synchronization are proposed. Experiment results show that the improved TPM synchronization model can be efficiently against the third party attack. At last,a lightweight TPM-based key management scheme is proposed for TinySec on wireless sensor networks,which is full implemented on the Mica2 node and the performance test result is acceptable.

A Cluster-Based Random Key Revocation Protocol for Wireless Sensor Networks

In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.

Study on key management scheme for heterogeneous wireless sensor networks

Heterogeneous wireless sensor network( HWSN) is composed of different functional nodes and is widely applied. With the deployment in hostile environment,the secure problem of HWSN is of great importance; moreover,it becomes complex due to the mutual characteristics of sensor nodes in HWSN. In order to enhance the network security,an asymmetric key pre-distributed management scheme for HWSN is proposed combining with authentication process to further ensure the network security; meanwhile,an effective authentication method for newly added nodes is presented. Simulation result indicates that the proposed scheme can improve the network security while reducing the storage space requirement efficiently.

Lightweight Key Management Scheme Using Fuzzy Extractor for Wireless Mobile Sensor Network

The mature design of wireless mobile sensor network makes it to be used in vast verities of applications including from home used to the security surveillance.All such types of applications based on wireless mobile sensor network are generally using real time data,most of them are interested in real time communication directly from cluster head of cluster instead of a base station in cluster network.This would be possible if an external user allows to directly access real time data from the cluster head in cluster wireless mobile sensor network instead of accessing data from base station.But this leads to a serious security breach and degrades the performance of any security protocol available in this domain.Most existing schemes for authentication and cluster key management for external users,exchange a number of messages between cluster head and base station to allow external to access real time data from the base station instead of cluster head.This increase communication cost and delay in such real time access information.To handle this critical issue in cluster wireless mobile sensor network,we propose a lightweight authentication and key management scheme using a fuzzy extractor.In this scheme,any external user can access data directly from the cluster head of any cluster without the involvement of the base station.The proposed scheme only uses the one-way hash functions and bitwise XOR operations,apart from the fuzzy extractor method for the user biometric verification at the login phase.The presented scheme supports scalability for an increasing number of nodes using polynomials.The proposed scheme increases the life-time of the network by decreasing the key pool size.

PUF-Based Key Distribution in Wireless Sensor Networks

Physical Unclonable Functions(PUFs)can be seen as kind of hardware one-way functions,who are easily fabricated but difficult to clone,duplicate or predict.Therefore,PUFs with unclonable and unpredictable properties are welcome to be applied in designing lightweight cryptography protocols.In this paper,a Basic Key Distribution Scheme(Basic-KDS)based on PUFs is firstly proposed.Then,by employing different deployment modes,a Random Deployment Key Distribution Scheme(RD-KDS)and a Grouping Deployment Key Distribution Scheme(GD-KDS)are further proposed based on the Basic-KDS for large scale wireless sensor networks.In our proposals,a sensor is not pre-distributed with any keys but will generate one by the embedded PUF when receiving a challenge from the gateway,which provides perfect resilience against sensor capture attacks.Besides,the unclonable and unpredictable properties of PUF guarantee the key uniqueness and two-way authentication.Analysis and experiment results show that our proposals have better performances in improving the resilience,secure-connectivity,and efficiency as compared to other schemes.

EKAES:AN EFFICIENT KEY AGREEMENT AND ENCRYPTION SCHEME FOR WIRELESS SENSOR NETWORKS

Wireless sensor networks are being deployed for some practical applications and their se-curity has received considerable attention.It is an important challenge to find out suitable keyagreement and encryption scheme for wireless sensor networks due to limitations of the power,com-putation capability and storage resources.In this paper,an efficient key agreement and encryptionscheme for wireless sensor networks is presented.Results of analysis and simulations among the pro-posed scheme and other schemes show that the proposed scheme has some advantages in terms ofenergy consumption,computation requirement,storage requirement and security.

RESEARCH ON KEY NODES OF WIRELESS SENSOR NETWORK BASED ON COMPLEX NETWORK THEORY

On the basis of complex network theory, the issues of key nodes in Wireless Sensor Networks (WSN) are discussed. A model expression of sub-network fault in WSN is given at first; subsequently, the concepts of average path length and clustering coefficient are introduced. Based on the two concepts, a novel attribute description of key nodes related to sub-networks is proposed. Moreover, in terms of node deployment density and transmission range, the concept of single-point key nodes and generalized key nodes of WSN are defined, and their decision theorems are investigated.

A FUNCTION NODE-BASED MULTIPLE PAIRWISE KEYS MANAGEMENT PROTOCOL FOR WIRELESS SENSOR NETWORKS AND ENERGY CONSUMPTION ANALYSIS

In this letter, a Function node-based Multiple Pairwise Keys Management (MPKMF) protocol for Wireless Sensor Networks (WSNs) is firstly designed, in which ordinary nodes and cluster head nodes are responsible for data collection and transmission, and function nodes are responsible for key management. There are more than one function nodes in the cluster consulting the key generation and other security decision-making. The function nodes are the second-class security center because of the characteristics of the distributed WSNs. Secondly, It is also described that the formation of function nodes and cluster heads under the control of the former, and five kinds of keys, i.e., individual key, pairwise keys, cluster key, management key, and group key. Finally, performance analysis and experiments show that, the protocol is superior in communication and energy consumption. The delay of establishing the cluster key meets the requirements, and a multiple pairwise key which adopts the coordinated security authentication scheme is provided.

A Hybrid Key Management Scheme Based on Clustered Wireless Sensor Networks

According to the weakness of session key construction based on node’s own location, we propose a hybrid key management scheme which based on clustered wireless sensor networks. The use of hierarchical thinking, reducing the amount of key storage and computing, while supporting network topology, dynamic key management for which aims to prevent leakage. Through analyzing, it shows that the scheme have certain advantages in key connectivity, security, communication and energy consumption.

An Adaptive Key Management Framework for the Wireless Mesh and Sensor Networks

Wireless sensor networks (WSNs) and wireless mesh networks (WMNs) are popular research subjects. The interconnection of both network types enables next-generation applications and creates new optimization opportunities. Currently, plenty of protocols are available on the security of either wireless sensor networks or wireless mesh networks, an investigation in peer work underpins the fact that neither of these protocols is adapt to the interconnection of these network types. The internal cause relies on the fact that they differ in terms of complexity, scalability and network abstraction level. Therefore, in this article, we propose a unified security framework with three key management protocols, MPKM, MGKM, and TKM which are able to provide basic functionalities on the simplest devices and advanced functionalities on high performance nodes. We perform a detailed performance evaluation on our protocols against some important metrics such as scalability, key connectivity and compromise resilience, and we also compare our solution to the current keying protocols for WSNs and WMNs.

A New Kind of Dynamic Key Protocol for Wireless Sensor Network

For the source limitations and vulnerabilities of the sensor nodes of Wireless Sensor Networks, we propose the new kind of dynamic key protocol for wireless sensor network, using the unidirection of hash function and the thinking of Hill to study the dynamic key matrix. Through theoretical analysis of some aspects, our method can promote security, connectivity expansibility;the results show that this protocol reduces storage space and communication energy consumption also.

AUTHENTICATED SYMMETRIC-KEY ESTABLISHMENT FOR MEDICAL BODY SENSOR NETWORKS

This study concerns security issues of the emerging Wireless Body Sensor Network (WBSN) formed by biomedical sensors worn on or implanted in the human body for mobile healthcare appli-cations. A novel authenticated symmetric-key establishment scheme is proposed for WBSN,which fully exploits the physiological features obtained by network entities via the body channel available in WBSN but not other wireless networks. The self-defined Intrinsic Shared Secret (ISS) is used to replace the pre-deployment of secrets among network entities,which thus eliminates centralized services or au-thorities essential in existing protocols,and resolves the key transport problem in the pure symmet-ric-key cryptosystem for WBSN as well. The security properties of the proposed scheme are demon-strated in terms of its attack complexity and the types of attacks it can resist. Besides,the scheme can be implemented under a light-weight way in WBSN systems. Due to the importance of the ISS concept,the analysis on using false acceptance/false rejection method to evaluate the performance of ISS for its usage in the scheme is also demonstrated.

An Authenticated Dynamic Key Management Scheme for Clustered Sensor Networks

Secure sensor networks has received much attention in the last few years.A sensor network always works unattended possibly in a hostile environment such as a battlefield.In such environments,sensor networks are subject to node capture.Constrained energy,memory,and computational capabilities of sensor nodes mandate a clever design of security solutions to minimize overhead while maintaining secure communication over the lifespan of the network.In this paper,an authenticated dynamic key management scheme,ADKM has been proposed.It provides efficient,scalable,and survivable dynamic keying in a clustered sensor network with a large number of sensor nodes.ADKM employs a combinatorial exclusion basis system (EBS) for efficiency and one-way hash chains for authentication.Analysis of security and performance demonstrate that ADKM is efficient in security of sensor networks.

Novel routing protocol for heterogeneous wireless sensor networks

An improved LEACH for heterogeneous wireless sensor networks is proposed. Nodes are distributed in a sensing area that is divided into a number of same equilateral hexagons. Heterogeneous nodes act as the cluster heads and ordinary nodes act as those cluster sensors in all clusters. The structure of WSNs is a two-layer structure. The upper layer consists of all cluster heads and the lower layer consists of all ordinary sensors managed by their corresponding cluster heads. The cluster heads and the ordinary sensors establish their pairwise keys respectively through utilizing different methods. The arithmetic balances energy expense among all kinds of nodes, saves the node energy, and prolongs the life of wireless sensor networks. Additionally, Analysis demonstrates that the security of wireless sensor networks has been improved obviously even with some heterogeneous nodes.

AN IDENTITY-BASED KEY AGREEMENT SCHEME FOR LARGE SCALE SENSOR NETWORKS

To solve the problems of high memory occupation, low connectivity and poor resiliency against node capture, which existing in the random key pre-distribution techniques while applying to the large scale Wireless Sensor Networks （WSNs）, an Identity-Based Key Agreement Scheme （IBKAS） is proposed based on identity-based encryption and Elliptic Curve Diffie-Hellman （ECDH）. IBKAS can resist man-in-the-middle attacks and node-capture attacks through encrypting the key agreement parameters using identity-based encryption. Theoretical analysis indicates that comparing to the random key pre-distribution techniques, IBKAS achieves significant improvement in key connectivity, communication overhead, memory occupation, and security strength, and also enables efficient secure rekcying and network expansion. Furthermore, we implement IBKAS for TinyOS-2.1.2 based on the MICA2 motes, and the experiment results demonstrate that IBKAS is feasible for infrequent key distribution and rekeying for large scale sensor networks.