Location-Based Pairwise Key Establishment and Data Authentication for Wireless Sensor Networks

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.

In-network processing presents a critical challenge for data authentication in wireless sensor networks (WSNs). Current schemes relying on message authentication code (MAC) cannot provide natural support for this operation since even a slight modification to the data invalidates the MAC. In this paper, based on digital watermarking, we propose an end-to-end approach for data authentication in WSNs that provides inherent support for in-network processing. In this scheme, authentication information is modulated as watermark and superposed to the sensory data at the sensor nodes. The watermarked data can be aggregated by the intermediate nodes without incurring any en-route checking. Upon reception of the sensory data, possibly distorted by the operations along the route, the data sink is able to authenticate the data by validating the watermark, detecting whether the data has been altered and where it has occurred. In this way, the aggregation-survivable authentication information is only added at the sources and checked by the data sink, without any involvement of intermediate nodes. Furthermore, the simple operation of watermark embedding and complex operation of watermark detection provide a natural solution of function partitioning between the resource limited sensor nodes and resource abundant data sink. The simulation results show that the proposed scheme can successfully authenticate the sensory data with high confidence.

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.

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

The limited resources, being located in the unattended environment, and the dynamic change of topology, these bring about big challenges for the communication security of wireless sensor networks. The security protocol framework-SPINS adopts multiple-key protocol, which can achieve the confidentiality, authentication, integrity and freshness during the data communication process, and have a relatively low communication cost. However after the sensor nodes being spread and deployed, if the shared master key between node and base station was divulged, the entire network security will be affected. This paper introduces the Schnorr identity authentication to improve SPINS, and give a security protocols for wireless sensor networks based on identity authentication. The analysis shows that the improved protocol can effectively prevent the security problem caused by divulging the shared master key. Meanwhile it is beneficial to find the adversary nodes in the network, and to guarantee the effective communication between nodes in the network.

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.

Authentication in wireless sensor networks is critical, as they are often deployed unattended in hostile environments and must transmit information over unsecured mediums. However, the cost of performing cryptographic operations is an extremely limiting factor because sensor devices and related equipment are constrained by storage and computational ability. The problem is further compounded by the fact that one device (typically a base station) may be required to perform a large number of verifications proportional to the number of sensing devices. This paper investigates the efficiency of message authentication in hierarchical wireless sensor network systems. Scenarios are explored for verifying messages as a batch process, thereby saving overhead and computation. If a device is incapable of performing verification, it can sign the batch and pass it up the hierarchy to another device to undertake the verification procedure. This effectively overcomes many problems with power, storage and computational constraints. We contrast two approaches based on message authentication codes and short digital signatures. A framework is presented for how digital signatures can be used for batch authentication within a hierarchical wireless sensor network.

For wireless sensor networks, pairwise key establishment is a fundamental security service. However, establishing pairwise keys in wireless sensor networks is not a trivial thing, particularly due to the resource constraints on sensor nodes, and the nodes capture attack. In this paper, we propose a new efficient pairwise key management scheme based on the work of Liu et al. (Liu et. al., 2006). In our scheme, after deployment, a few sensor nodes are self-elected to become service nodes, which are responsible for key generation and distribution. The majority of the nodes are worker nodes, which are responsible for sensing and reporting data, and the keys shared by the nodes are distributed by service nodes. Compared with the scheme(LKE) provided by Liu et. al., our scheme does not need to learn the accurate locations of nodes. In addition, our scheme needs no computational overhead and requires less memory; the resilience against nodes capture attack is perfect. Simulation analysis is also provided.

The development of wireless sensor networks can be considered as the beginning of a new generation of applications. Authenticity of communicating entities is essential for the success of wireless sensor networks. Authentication in wireless sensor networks is always a challenging task due to broadcast nature of the transmission medium. Sensor nodes are usually resource constrained with respect to energy, memory, and computation and communication capabilities. It is not possible for each node to authenticate all incoming request messages, whether these request messages are from authorized or unauthorized nodes. Any malicious node can flood the network by sending messages repeatedly for creating denial of service attack, which will eventually bring down the whole network. In this paper, a lightweight authentication scheme named as Biphase Authentication Scheme (BAS) is presented for wireless sensor networks. This scheme provides initial small scale authentication for the request messages entering wireless sensor networks and resistance against denial of service attacks.

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.

Clustering is one among the most important strategies to improve the lifetime of wireless sensor networks (WSNs). The frequent occurrence of clustering and the subsequent interchange of data overload the sensor nodes and result in wasting power. WSNs are susceptible to attacks because of their resource-constrained nature and large applications in critical military areas. The objective of the threats to the security of wireless sensor networks is to compromise the network by seizing information for misuse. Security features have become a major concern in these types of networks as it is important to protect sensitive data from unauthorized users. This paper aims to present an enriched clustering strategy to minimize the overhead caused by clustering, by formulating an effective cluster update schedule. It also focuses on the attacks that occur during an exchange of initialization messages with neighbors. Clustering of the network is carried out on the basis of the energy of sensor nodes. The nodes that are the heads of the cluster nodes are determined according to the characteristics of energy factors; hence, the role is frequently switched among the nodes of the cluster. To formulate the next cluster update schedule, a fuzzy inference system is employed, and this uses the energy factor of the node, the distance the node is placed from the sink, and the number of member nodes of the cluster. A mechanism is included during an exchange of initialization messages that detects any malicious node pretending to be a neighbor node. The proposed algorithm is evaluated using simulation, and it is found to produce an improved lifetime of 1700 time units. It is shown to conserve the energy of sensor nodes and protect them from unauthorized nodes posing as legitimate neighbors.

Wireless sensor networks (WSNs) have wide applications due to these sensor nodes ease of deployment.But the security of WSNs is still an important issue. Some existed approaches mainly rely on cryptography to ensure data authentication and integrity. These approaches only address part of the problem of security in WSNs. However, these approaches are not sufficient for the unique characteristics and novel misbehaviors or abnormal behaviors encountered in WSNs. In this paper we introduce an implicit security authentication scheme technique ,which can authenticate the sensor nodes based on actions they would carry out anyway. From our preliminary findings support that this is a meaningful approach, whether used to increase usability or increase security in WSNs.

Improving tracking quality and extending network lifespan are two main objects for target tracking, which are usually contradictory due to limited energy of sensor nodes in wireless sensor networks. This article incorporates this contradiction into a problem of multi-objective optimization in tracking networks where multiple sensor nodes are scheduled for collaborative target tracking by adopting the unscented Kalman filter algorithm. We propose an effective scheme to extend the lifespan of wireless sensor networks while guaranteeing preset tracking quality. More specifically, with regard to practical circumstances, we perform analysis on the target detection probability, as well as residual energy of sensor nodes, when selecting a suitable set of candidate sensor nodes. Then, we put forward a novel energy-balanced sensor nodes scheduling algorithm, Greedy Balance Replace Heuristic Algorithm, to select a near-optimal task sensor set from the candidate sensor node set to balance tracking quality and network lifetime. In addition, we also design an efficient multi-sensor node collaborative method to track a single target and to timely report its state to the remote end. From simulation results, it is demonstrated that the proposed node scheduling scheme can not only maintain the preset tracking accuracy but also extend network lifespan with a low computation complexity.

Secure routing of information is one of the major concerns of specialist working in the field of wireless sensor networks (WSNs) as sensor nodes gather information from the physical world and transmit to base stations for authorized users to access via the internet. In a WSN, sensor nodes are deployed most of the times in unattended locations where there is the possibility of authorized or unauthorized access. This and others have brought the need to secure transmitted information from intruders. Though there are many ways to provide security to a network, cryptography has been identified as the best way for these main three security requirements which include: data confidentiality, authentication, and integrity (CIA). In this paper, we present an overview of the present challenges in a WSN and outline a number of countermeasures to solve these challenges. To tackle the challenge of security encountered in existing WSN systems, we propose an efficient and robust encryption and decryption algorithms for secure communication. The major key feature of this algorithm is that it combines both substitution and transposition cipher techniques in order to achieve the encrypted text. The algorithm is the outcome of the inspection of various existing algorithms in this field.

In this paper, wireless sensor network (WSN) security issue in the presence of an eavesdropper is analysed. The sensor-sink as well as sensor-eavesdropper channels are assumed to be subjected to generalized-K fading. According to the physical layer security framework, we employ round-robin, optimal sensor and cumulative distribution function-based scheduling scheme to enhance secure connection between sensor nodes and to attain low probability of intercept. Novel analytical results are given in a form of easy-to-compute analytical expressions for the intercept probability. Additionally, asymptotic closed-form expressions are derived and diversity orders of scheduling schemes are determined. Numerical results demonstrate important impacts of fading and shadowing parameters of main and wiretap links, network size and selected scheme on WSN security. Presented results are validated by independent Monte Carlo simulations.