A New Efficient Pairwise Key Establishment Scheme for Wireless Sensor Networks

Key management in sensor networks is the core security protocols for wireless sensor networks (WSNs) in the hostile environment. Due to the resource constraints, pre-distribution secrets keys into sensor nodes before they are deployment are an applicable approach. Several key pre-distribution schemes have been proposed in literature to establish pairwise keys between sensor nodes. However, as the number of compromised nodes increases, the fraction of affected pairwise keys increase quickly. These vulnerabilities are exacerbated when WSNs have to operate unattended in a hostile environment. In such an environment, an adversary may control the network by capturing some sensor nodes.. To address these weaknesses, we present a promising pairwise key establishment scheme in this paper. In the proposed scheme, after pairwise key establishment all attackers can’t get any key information of uncompromised sensor nodes from compromised sensors. The analysis shows that compared with existing approaches, our scheme have better networks resilience against node capture attack.

Sensor networks are often deployed in unattended environment, thus leaving those networks vulnerable to false data injection attacks. Attackers often inject false data into the network in order to deceive the base station or deplete the resource and the energy of the relaying nodes. The existing authentication mechanisms cannot prevent this kind of attack after an amount of sensor nodes have been compromised. Pairwise key establishment is a fundamental security in wireless sensor networks, which makes it possible that sensor nodes can communicate securely one another using cryptographic techniques. However, the limited resource and energy of sensor nodes are not feasible to use such traditional key management techniques as public/private cryptography and key distribution center (KDC). In this paper, we present a novel key management and data authentication technique that pass sensing data securely and filter false data out on its way to base station. The framework of our design is to divide sensing area into a number of location cells and a group of local cells consist of a logical cell, where, pairwise key between two sensor nodes is established according to the grid-based bivariate polynomials. The established pairwise key is included in the message authentication code (MAC) and is forwarded several hops down to the base station for data authentication. Our result shows that this location scheme and data authentication method decreases communication overhead, avoids t-tolerance, and filters bogus report in wireless sensor networks

A major issue in many applications of Wireless Sensor Networks (WSNs) is ensuring security. Particularly, in military applications, sensors are usually deployed in hostile areas where they can be easily captured and operated by an adversary. Most of security attacks in WSNs are due to the lack of security guaranties in terms of authentication, integrity, and confidentiality. These services are often provided using cryptographic primitives where sensor nodes need to agree on a set of secret keys. Current key distribution schemes are not fully adapted to the tiny, low-cost, and fragile nature of sensors that are equipped with limited computation capability, reduced memory size, and battery-based power supply. This paper investigates the design of an efficient key distribution and management scheme for wireless sensor networks. The proposed scheme can ensure the generation and distribution of different encryption keys intended to secure individual and group communications. This is performed based on elliptic curve public key encryption using Diffie-Hellman like key exchange that is applied at different levels of the network topology. In addition, a re-keying procedure is performed using secret sharing techniques. This scheme is more efficient and less complex than existing approaches, due to the reduced number of messages and the less processing overhead required to accomplish key exchange. Furthermore, few number of encryption keys with reduced sizes are managed in sensor nodes, which optimizes memory usage and enhances scalability to large size networks.

A novel key predistribution scheme for wireless sensor networks based on hexagon deployment model

Secure Distributed Wireless Sensor Network (DWSN) is empowered by using an efficient key management technique. Battery powered sensor nodes faces precarious aspects during key distribution in order to reduce the energy consumption for the components of sensor nodes. Thus, implementing a key distribution algorithm should possess minimum power consumption. The proposed work steps towards greater heights by integrating power module with pairwise key establishment using group configuration methodology. We present an investigation of power consumption using STEM (Sparse Topology and Energy Management) protocol on sensor nodes (SNs) during the pairwise key establishment using graphical tools. Further memory utilization is reduced due to less number of keys generated from group configuration methodology. Analytical results of this PEAK (Power Efficiency Analysis for Key Distribution) show that energy efficiency is increased with sensor nodes while establishing pairwise key using group configuration when compared to existing key predistribution techniques.

Pattern transformation-invariant schemes for wireless sensor networks based on an edge detection gradient-based mechanism

Wireless Sensor Networks are installed in hostile areas. The security issues in wireless sensor networks are very important. Getting secure links between nodes is a challenging problem in WSNs. They are more vulnerable to security attacks than wired networks. In order to protect the sensitive data in WSN can be protected using secret keys to encrypt the exchanged messages between communicating nodes. Key management is essential for many security services such as confidentiality and authentication. The symmetric or asymmetric key cryptography or Trusted-server schemes are used to solve this problem. Asymmetric key cryptography increases network security but it increases computational, memory, and energy overhead. Symmetric key cryptography provides less security and it is efficient key management scheme. Trusted server schemes use key management server. Because there is usually no trusted infrastructure it is not very suitable for sensor networks. In this paper, we have proposed Mobile Agent (MA) Based Key Distribution (MAKD). In MAKD, Mobile Agents are used for dissemination of public keys and update of shared keys. Each sensor node constructs different symmetric keys with its neighbors, and communication security is achieved by data encryption and mutual authentication with these keys. Simulation results show that MAKD is scalable and with less communication overhead.

Due to the resource constraints, pre-distributing secret keys into sensor nodes before they are deployed is an applicable approach to achieve information security in wireless sensor networks. Several key pre-distribution schemes have been proposed in literature to establish pairwise keys between sensor nodes; they are either too complicated, or insecure for some common attacks. To address these weaknesses, we propose an improved pairwise key establishment mechanism for wireless sensor networks in this paper. Compared with existing approaches, our scheme has better network resilience against node capture attack. Analysis and simulation results show that our scheme performs better than earlier proposed schemes in terms of network connectivity, key storage overhead, maximum supported network size, computational and communication overheads

A scheme for WSNs (wireless sensor networks) security is given by dividing sensing tetrahedron into clusters and using the symmetric polynomials in this paper.The sensing tetrahedron is divided into a number of small grids.All those sensor nodes, both ordinary sensor nodes and heterogeneous sensor nodes are distributed in the sensing tetrahedron.In a grid, all ordinary sensor nodes and heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.All the heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.At last, all sensor nodes establish their keys directly or indirectly in the whole sensing tetrahedron.Analysis and comparison demonstrate this scheme enhances the WSN security, has good network connectivity, saves node storage, reduces network computing load, and extends the network lifetime.

무선 통신 기술의 발달은 기존 유선 통신 사용자에게 이동성과 접근 편리성을 제공하였다. 무선 센서 네트워크 기술은 대표적인 무선 통신기술의 하나로, 센서 노드간의 통신에 에러가 빈번하고 통신 속도가 느린 저속 환경이며, 노드의 자원 제약 및 컴퓨팅 능력의 한계로 인해 유선 네트워크 환경에서 설계된 보안 메커니즘을 그대로 적용하는 것이 어렵다. 이러한 무선 센서 네트워크의 환경적인 제약사항이 무전 통신 환경과 유사함에 착안하여 무선 센서 네트워크 기술을 참고하여, 무전 통신 환경에 적용 가능한 효율적인 키 관리 기법을 제안하고자 한다. 본 논문에서 제안하는 방식은 일대일 통신에서 사용될 pair-wise key 설정 및 갱신, 일대다 통신에 사용될 그룹키 설정 및 갱신을 제공하며, 그룹 단위의 무전기 추가가 가능하다는 장점을 갖는다. 제안하는 master key 기반의 키 관리 방식은 군(軍)에서의 특수한 작전 수행 및 비밀 통신이 요구되는 무전 통신 환경에 활용될 수 있다. The development of wireless communications provides mobility and accessibility to the wire communication users. Wireless sensor network is one of the leading wireless communication techniques. The security mechanism for wired network communication cannot be applied to wireless sensor network because of the limited resource and computing capability of nodes. Furthermore, communication errors frequently occur and the speed is low. Thus, efficient key management scheme is required in low-speed environment. In this paper, we proposed an efficient and secured master key-based scheme compared to the existing scheme. The advantage of our scheme is that establishing and renewing the pair-wise key is possible. In addition, it provides functions such as establishing group keys and renewing it. Furthermore, adding nodes is enabled through our scheme. The master key-based scheme can be applied to military operations and to radio communications for confidential communications.

Key establishment is a fundamental security issue in wireless sensor networks (WSN). It is the basis to establish the secure communication using cryptographic technologies between sensor nodes. Due to the current resource constraints on sensors, it is infeasible to use traditional key management techniques such as public key cryptography or key distribution center based protocols. So the key predistribution schemes are paid most attention in key management of WSN. To establish pairwise keys securely and meanwhile prevent a number of compromised colluding nodes from breaking the pairwise key shared by any two innocent nodes, we propose an enhanced polynomial-based key establishment scheme (EPKES) for WSN. In EPKMS, we introduce an auxiliary set to improve the security level compared to previous schemes. The results of performance evaluations show that our proposed scheme has a good key connectivity, scalability, direct key establishment, resilience to nodes capture and storage consumption.

Wireless sensor networks (WSNs) consist of small sensor nodes with constrained energy, memory and computation capabilities. They are often deployed in the unattended and hostile environment. Therefore sensor nodes are vulnerable to attacks such as node capture and collusion attack by adversaries. To protect the whole network, cryptographic techniques are necessary that pairwise key establishment is the essential procedure. It enables that sensor nodes can communicate to each other securely. However, it is impractical to use traditional key management techniques such as public key cryptography and key distribution center (KDC) because of the resource constraints of sensor nodes. This paper proposes a key distribution scheme, based on exclusion-based systems (EBSs) and t-degree bivariate polynomials. It is an energy-efficient dynamic key management scheme which performs localized rekeying to minimize overhead.

The use of wireless sensor networks (WSNs) in any real-world application requires a certain level of security. To provide security of operations such as message exchange, key management schemes have to be well adapted to the particularities of WSNs. Unfortunately, the resource limitation of sensor nodes poses a great challenge for designing an efficient and effective key establishment scheme for WSNs. This paper proposes a novel key management scheme. In the proposed scheme, the pre-distributed keys in nodes are classified different security levels and the higher security level of the pre-distributed key in compromised nodes will disclose the fewer pre-distributed keys in the uncompromised nodes than that of the lower security level of the pre-distributed key. The proposed scheme is analysed based on connectivity, resistance against attacks, memory consumption and communication overhead. Simulation results confirm that the proposed scheme has a good resilience against node compromising attacks compared to the existing schemes.

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys are required to be established between them. Considering the storage limitations and the lack of post-deployment configuration information of sensors, random key predistribution schemes have been proposed. Due to limited number of keys, sensors can only share keys with a subset of the neighboring sensors. Sensors then use these neighbors to establish pairwise keys with the remaining neighbors. In order to study the communication overhead incurred due to pairwise key establishment, we derive probability models to design and analyze pairwise key establishment schemes for large-scale sensor networks. Our model applies the binomial distribution and a modified binomial distribution and analyzes the key path length in a hop-by-hop fashion. We also validate our models through a systematic validation procedure. We then show the robustness of our results and illustrate how our models can be used for addressing sensor network design problems.

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensors, it is infeasible to use traditional key management techniques such as public key cryptography and key distribution center (KDC). To facilitate the study of novel pairwise key predistribution techniques, this paper presents a general framework for establishing pairwise keys between sensors on the basis of a polynomial-based key predistribution protocol [2]. This paper then presents two efficient instantiations of the general framework: a random subset assignment key predistribution scheme and a grid-based key predistribution scheme. The analysis in this paper indicates that these two schemes have a number of nice properties, including high probability (or guarantee) to establish pairwise keys, tolerance of node captures, and low communication overhead. Finally, this paper presents a technique to reduce the computation at sensors required by these schemes.