Key Distribution Strategy of Wireless Sensor Network Based on Multi-Hash Chain

Author(s):  
Peng Xiong ◽  
Qinggang Su

Key management is the basis of the security mechanism for wireless sensor networks and services, and random key pre-distribution is the most effective key management mechanism at present. However, there is a potential challenge to most current random key pre-distribution strategies: it is difficult to achieve both ideal network security connectivity and network survivability. In this paper, we present a novel random key pre-distribution scheme based on the hash chain. By adjusting certain system parameters, such as the hash chain length, the number of common auxiliary nodes and the number of hash chains, a sensor node only need to preload a few of keys, making it possible to establish the pairwise key with high probability among its neighboring nodes. The proposed scheme can still maintain strong network survivability even if there are many compromised nodes. The theoretical analysis and simulation experiments show that the proposed scheme is not only effective and secure, but also scalable.

Author(s):  
Sachin D. Babar ◽  
Parikshit N. Mahalle

The growth of wireless sensor networks (WSNs) in the last few years, enhances the use, efficiency, and accuracy of a large number of applications such as defense, habitat monitoring, industrial, and many more. The performance of WSNis largely affected by the security, as large numbers of security attack are happening on the WSN. Therefore, it is necessary to have a security solution to use theWSN proficiently. The objective of this paper is to address the security problem of WSN by proposing the key management mechanism to establish the secure link for communication. The paper proposes the cluster-based key management technique based on hash key mechanism. The mechanism considers the key establishment and verification at two levels, one at onehop distance and the other at multi-hop destination. The proposed work is evaluated by considering the varying number of attackers in the network. The mechanism shows reduced packet lost rate and energy consumption as compared with one-hop key management solutions, by making the tradeoff of delay. The results shows the improvement in packet loss rate i.e., without any solution, if attack happens obviously the attack performance reduces with an increase in pack loss rate and after applying the solution, the packet loss rate is reduced.  


Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.


Sign in / Sign up

Export Citation Format

Share Document