Pairwise Key Predistribution Research Articles

On the Minimum Node Degree and k-Connectivity in Inhomogeneous Random K-Out Graphs

Inhomogeneous random K-out graphs were recently introduced to model heterogeneous sensor networks secured by random pairwise key predistribution schemes. First, each of the n nodes is classified as type-1 (respectively, type-2) with probability 0 <; μ <; 1 (respectively, 1-μ) independently from each other. Next, each type-1 (respectively, type-2) node draws 1 arc towards a node (respectively, K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> arcs towards K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> distinct nodes) selected uniformly at random, and then the orientation of the arcs is ignored. It was recently established that the inhomogeneous random K-out graph is 1-connected asymptotically almost surely (a.a.s.) if and only if K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> =ω(1). In this work, we analyze the k-connectivity of inhomogeneous random K-out graphs; i.e., with k=1, 2, <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> ⋯</sub> , the property that the network remains connected despite the removal of any k-1 nodes or links. We first establish a zero-one law for the property that the minimum node degree is at least k. In particular, we present scaling conditions on μ and K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> such that the resulting graph has minimum degree at least k with probability approaching one (respectively, zero) constituting the one-law (respectively, zero-law), as the number of nodes gets large. We show that for k=2, 3, <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">⋯</sub> , we need to set K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> = \frac 11-μ(logn +(k-2)loglogn + ω(1)) for the network to have a minimum node degree of at least k a.a.s. Next, we prove that having K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> = \frac 11-μ(logn +(k-2)loglogn + ω(1)) also ensures that the graph is k-connected a.a.s., meaning that the zero-one laws for minimum node degree and k-connectivity coincide. We present simulation results to demonstrate the usefulness of the results in the finite node regime. The results given here indicate an interesting fact about inhomogeneous random K-out graphs, i.e., that the number of additional edges needed to go from 1-connectivity to k-connectivity with k ≥ 2 is unexpectedly larger as compared to many classical random graph models studied before.

Efficient Resource Allocation in Hybrid Wireless Networks Increase the Capacity

In many wireless sensor network (WSN) the Mobile sinks(MSs) are very essential applications for efficient data gathering, restricted sensor reprogramming, and for distinguishing and revoking compromised sensors. The sensor network that formulate use of the existing 2-tier security structure, elevate a new protection challenge i.e an attacker can easily create a replicated node and can gain control of the data in the network. This project describes a polynomial pool based approach hybrid three-tier general framework that permits the use of any pairwise key predistribution scheme as its basic component. In this technique we implement a special kind of sensor node, which is called as polynomial pool. This sensor node not the part of actual communication. Polynomial pool checks all key of that intruder node and if key matches it allowed that node into network otherwise throwaway from the network. In this project we implemented a new technique with an algorithm named GNDA Good Node Detection Algorithm Based Approach technique with Wireless Sensor Networks. As we all know that, secured files are easily hacked by attacked by they are using several software. In my project the main aim is to avoid this kind of attackers &amp; also increase the capacity by sending by files. Propose a Hybrid Distributed Three-hop Data Routing protocol (HDTR). HDTR protocol improves the Network efficiency and reduces the Overhead. This will also identify the good neighbor node to transfer the data.

Multi-tier Framework for Optimizing Pairwise Key Predistribution in Sensory Applications

Security has been always a prominent concern in Wireless Sensor Network (WSN) irrespective of the evolution of various scientific approaches that mainly mechanizes key management approaches to secure the communication system among the resource constraints sensors. Out of various key management approaches, pairwise key is one effective approach to ensure cost effective key management scheme; however, review of existing approaches shows that they still are characterized by various issues connected to optimized performance. Adopting analytical research methodology, the proposed system implements an optimized multi-tier framework for resisting key-based threats and it targets to introduce a lightweight pair wise predistribution of keys by joint integration of enhanced public key encryption and digital signature. The study outcome shows that proposed system offer a better security performance in contrast to existing pair wise predistribution of keys.

On Resilience and Connectivity of Secure Wireless Sensor Networks Under Node Capture Attacks

Despite much research on probabilistic key predistribution schemes for wireless sensor networks over the past decade, few formal analyses exist that define schemes' resilience to node-capture attacks precisely and under realistic conditions. In this paper, we analyze the resilience of the q-composite key predistribution scheme, which mitigates the node capture vulnerability of the Eschenauer-Gligor scheme in the neighbor discovery phase. We derive scheme parameters to have a desired level of resiliency, and obtain optimal parameters that defend against different adversaries as much as possible. We also show that this scheme can be easily enhanced to achieve the same “perfect resilience" property as in the random pairwise key predistribution for attacks launched after neighbor discovery. Despite considerable attention to this scheme, much prior work explicitly or implicitly uses an incorrect computation for the probability of link compromise under node-capture attacks and ignores the real-world transmission constraints of sensor nodes. Moreover, we derive the critical network parameters to ensure connectivity in both the absence and presence of node-capture attacks. We also investigate node replication attacks by analyzing the adversary's optimal strategy.

$k$ -Connectivity in Random $K$ -Out Graphs Intersecting Erdős-Rényi Graphs

We investigate $k$ -connectivity in secure wireless sensor networks under the random pairwise key predistribution scheme with unreliable links. When wireless communication links are modeled as independent on-off channels, this amounts to analyzing a random graph model formed by intersecting a random $K$ -out graph and an Erdős-Renyi graph. We present conditions on how to scale the parameters of this intersection model so that the resulting graph is $k$ -connected with probability approaching to one (resp. zero) as the number of nodes gets large. The resulting zero-one law is shown to improve and sharpen the previous result on the 1-connectivity of the same model. We also provide numerical results to support our analysis.

Wireless Sensor Networks Under the Random Pairwise Key Predistribution Scheme: Can Resiliency Be Achieved With Small Key Rings?

We investigate the resiliency of wireless sensor networks against sensor capture attacks when the network uses the random pairwise key distribution scheme of Chan et al. We present conditions on the model parameters so that the network is: 1) unassailable and 2) unsplittable, both with high probability, as the number $n$ of sensor nodes becomes large. Both notions are defined against an adversary who has unlimited computing resources and full knowledge of the network topology, but can only capture a negligible fraction $o(n)$ of sensors. We also show that the number of cryptographic keys needed to ensure unassailability and unsplittability under the pairwise key predistribution scheme is an order of magnitude smaller than it is under the key predistribution scheme of Eschenauer and Gligor.

A Polynomial-based Pairwise Key Pre-distribution and Node Authentication Protocol for Wireless Sensor Networks

Continuous advances in the areas of sensor networks have made wireless sensor networks (WSNs) attractive for wide variety of applications, with vastly varying requirements and characteristics. As data sensed by nodes usually contains sensitive information, adherence to data protection requirements is vital in WSNs. This paper introduces a new robust key pre-distribution key management scheme using random polynomial functions and a matrix. The proposed mechanism significantly increases storage efficiency and enhances network resilience against node capture. The effectiveness of the mechanism is demonstrated by security analysis and a comparison to existing schemes.

Toward &lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$k$ &lt;/tex-math&gt;&lt;/inline-formula&gt;-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links

We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent on/off channels. Modeling the network by an intersection of a random $K$-out graph and an Erd\H{o}s-R\'enyi graph, we present scaling conditions (on the number of nodes, the scheme parameter $K$, and the probability of a wireless channel being on) such that the resulting graph contains no nodes with degree less than $k$ with high probability, when the number of nodes gets large. Results are given in the form of zero-one laws and are shown to improve the previous results by Ya\u{g}an and Makowski on the absence of isolated nodes (i.e., absence of nodes with degree zero). Via simulations, the established zero-one laws are shown to hold also for the property of $k$-connectivity; i.e., the property that graph remains connected despite the deletion of any $k-1$ nodes or edges.

A complete hierarchical key management scheme for heterogeneous wireless sensor networks.

Heterogeneous cluster-based wireless sensor networks (WSN) attracted increasing attention recently. Obviously, the clustering makes the entire networks hierarchical; thus, several kinds of keys are required for hierarchical network topology. However, most existing key management schemes for it place more emphasis on pairwise key management schemes or key predistribution schemes and neglect the property of hierarchy. In this paper, we propose a complete hierarchical key management scheme which only utilizes symmetric cryptographic algorithms and low cost operations for heterogeneous cluster-based WSN. Our scheme considers four kinds of keys, which are an individual key, a cluster key, a master key, and pairwise keys, for each sensor node. Finally, the analysis and experiments demonstrate that the proposed scheme is secure and efficient; thus, it is suitable for heterogeneous cluster-based WSN.

An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead.

A Pairwise Key Pre-Distribution Scheme Based on OKS and Grids for Wireless Sensor Networks

A pairwise key pre-distribution scheme based on OKS and grids for wireless sensor networks is proposed. This strategy divides the sensor area into square cells and logical groups and distributes key information by employing the OKS scheme. This scheme effectively reduces storage cost, saves battery energy, has good network connectivity, and provides flexible security grades.

On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution

We investigate the connectivity of wireless sensor networks under the random pairwise key predistribution scheme of Chan Under the assumption of full visibility, this reduces to studying the connectivity in the so-called random K-out graph H (n;K); here, n is the number of nodes and K <; n is an integer parameter affecting the number of keys stored at each node. We show that if K ≥ 2 (respectively, K=1), the probability that H (n;K) is a connected graph approaches 1 (respectively, 0) as n goes to infinity. For the one-law this is done by establishing an explicitly computable lower bound on the probability of connectivity. Using this bound, we see that with high probability, network connectivity can already be guaranteed (with K ≥ 2) by a relatively small number of sensors. This corrects earlier predictions made on the basis of a heuristic transfer of connectivity results available for Erdos-Renyi graphs.

Securing Wireless Sensor Network using Intelligent Techniques

In wireless sensor networks (WSNs), the sensor nodes transmit critical information over the network. Therefore security services such as authentication and pair wise key establishment between sensor nodes and mobile sinks are important. However, the problem of authentication and pair wise key establishment in sensor networks with mobile sinks is still a critical problem in the face of mobile sink replication attacks. In the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes. This makes it possible for an attacker to take control over the entire network. Thereby deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and initiate data communication with any sensor node. To address this issue a general framework needs to be developed that permits the use of any pair wise key pre distribution scheme which requires two separate key pools one for the mobile sink to access the network and other for the pair wise key establishment between the sensors. Moreover, to detect such mobile sinks and replication attacks an intelligent agent is deployed at every level in the network. The agents play a major role and perform with the idea of knowledge base and rule manager.

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.

On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes

The pairwise key distribution scheme of Chan et al. is a randomized key predistribution scheme which enables cryptographic protection in wireless sensor networks (WSNs). Although this pairwise scheme has several advantages over other randomized key predistribution schemes, including the original scheme of Eschenauer and Gligor, it has been deemed non-scalable for the following two reasons: (i) There are implementation difficulties when sensors need to be deployed in multiple stages; and (ii) the possibly large number of keys stored at each sensor node is random and may vary from sensor to sensor. Here, we explore these issues as follows: (i) We propose an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases; (ii) We show how the scheme parameters should scale with the maximum number n of sensor nodes in the network so that a.a.s. secure connectivity is maintained throughout every deployment phase of the network; (iii) We derive scaling conditions on the scheme parameters for all the sensors in the network to have O(logn) many keys with very high probability as n grows large. This dimensioning of the key rings can be made to support a.a.s. secure connectivity at every step of deployment.

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links

We investigate the secure connectivity of wireless sensor networks under the random pairwise key predistribution scheme of Chan, Perrig, and Song. Unlike recent work carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as independent on/off channels. We present conditions on how to scale the model parameters so that the network 1) has no secure node that is isolated and 2) is securely connected, both with high probability, when the number of sensor nodes becomes large. The results are given in the form of zero-one laws, and exhibit significant differences with corresponding results in the full-visibility case. Through simulations, these zero-one laws are shown to also hold under a more realistic communication model, namely the disk model.

The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks

Mobile sinks (MSs) are vital in many wireless sensor network (WSN) applications for efficient data accumulation, localized sensor reprogramming, and for distinguishing and revoking compromised sensors. However, in sensor networks that make use of the existing key predistribution schemes for pairwise key establishment and authentication between sensor nodes and mobile sinks, the employment of mobile sinks for data collection elevates a new security challenge: in the basic probabilistic and q-composite key predistribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of nodes, and hence, can gain control of the network by deploying a replicated mobile sink preloaded with some compromised keys. This article describes a three-tier general framework that permits the use of any pairwise key predistribution scheme as its basic component. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pairwise key establishment between the sensors. To further reduce the damages caused by stationary access node replication attacks, we have strengthened the authentication mechanism between the sensor and the stationary access node in the proposed framework. Through detailed analysis, we show that our security framework has a higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme.

QoS-Guaranteed Secure Multicast Routing Protocol for Satellite IP Networks Using Hierarchical Architecture

Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including Geostationary Earth Orbit (GEO), Highly Elliptical Orbit (HEO), and Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of the hierarchical architecture, we propose a QoS-guaranteed secure multicast routing protocol (QGSMRP) for satellite IP networks using the logical location concept to isolate the mobility of LEO and HEO satellites. In QGSMRP, we employ the asymmetric cryptography to secure the control messages via the pairwise key pre-distribution, and present a least cost tree (LCT) strategy to construct the multicast tree under the condition that the QoS constraints are guaranteed, aiming to minimize the tree cost. Simulation results show that the performance benefits of the proposed QGSMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional shortest path tree (SPT) strategy.

Location-based pairwise key predistribution for wireless sensor networks

A practical pairwise key distribution scheme is necessary for wireless sensor networks since sensor nodes are susceptible to physical capture and constrained in their resources. In this paper, we investigate a simple and practical scheme that achieves higher connectivities and perfect resilience with less resources, even in case of deployment errors.

Key management scheme for wireless sensor network-based on multiple key spaces

This paper proposed a key management scheme based on the pairwise key predistribution scheme for Wireless Sensor Network(WSN).This scheme combined the q-composite random key predistribution scheme and introduced the location information to enhance secure connection probability between nodes.The analysis results show that this scheme doesn't need additional memory space and increases the probability that neighbor nodes have the same key space.Compared with the pairwise key predistribution scheme,this scheme can increase the threshold of captured nodes and improve the security of WSN,and fits the network environment and meets the security requirements of WSN.