Key predistribution for homogeneous wireless sensor networks with group deployment of nodes

Martin, Keith M.; Paterson, Maura B.; Stinson, Douglas R.

doi:10.1145/1824766.1824767

Cited by 23 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If two nodes are neighbors, it is called local connectivity; otherwise, it shows global connectivity. Because the global connectivity is strongly dependent on physical topology of nodes, it can be difficult to assess on the basis of the properties of KPS . So, only the local connectivity is discussed here.Resiliency: When sensor nodes are distributed in a hostile environment, some of them may be compromised by an adversary.…”

Section: Discussionmentioning

confidence: 99%

Key Predistribution Scheme for Clustered Hierarchical Wireless Sensor Networks based on Combinatorial Designs

Javanbakht

Erfani

Javadi

et al. 2014

Security Comm Networks

View full text Add to dashboard Cite

Combinatorial designs are powerful mathematical tools with comprehensive and simple algebraic structures. Recently, many researchers have used combinatorial designs as key predistribution schemes in wireless sensor networks (WSNs). Previous studies on security of WSNs are mainly concentrated on those networks containing nodes with the same capabilities. Further, investigations reveal that high reliability and lifetime on networks can be achieved through hierarchical heterogeneous wireless sensor networks, where a small number of sensor nodes have more energy, memory, and transmission capability. Inspired by scheme due to Lee and Stinson, we propose a key predistribution scheme for a clustered heterogeneous WSN using transversal designs. This proposed scheme assigns key chains to sensor nodes before deployment and separates key pool of each cluster by adding a pseudo-random generated number after deployment. The performance evaluation and security analysis show that our proposed scheme can provide better security with significant reductions on communication overhead and storage space than other key management schemes without compromising connectivity.Wireless sensor network security M. Javanbakht et al.problem of key establishment in sensor networks where each sensor node is preloaded with a finite set of keys prior to deployment. A key predistribution scheme (KPS) is a means of specifying which nodes store which keys.Key predistribution schemes can be random, deterministic, and hybrid. In random schemes, keys are randomly drawn from a key pool and are stored in each sensor node. This approach does not make sure whether every two nodes can communicate directly. If direct communication is not possible then a path needs to be established between two nodes. This path establishment decreasing the speed of communications increases power consumption. In deterministic schemes, deterministic methods are used to design key pool and key chains aiming at providing better key connectivity. In hybrid schemes, both deterministic and random approaches are combined to improve scalability and resiliency.Eschenauer and Gligor proposed a random KPS for distributed WSNs in [4]. In this scheme, at first, a large key pool is generated, and each sensor node is loaded with the fixed number of keys chosen randomly from this key pool along with their key identifiers. Then in key discovery phase, to find a common key, two nodes in their wireless communication range exchange the list of key identifiers from their own key chains. In case of sharing a common key, they can establish a direct secure communication. Otherwise, two nodes try to communicate with each other through a multi hop path. The proposed scheme in [4] provides good connectivity and resiliency but in shared key discovery phase, because two nodes have to exchange the list of their key identifiers to find the common key, the number of broadcast messages increases. This, in turn, enhances the communication complexity of protocol and decreases the battery's life.Combinatorial desi...

show abstract

Section: Discussionmentioning

confidence: 99%

Key Predistribution Scheme for Clustered Hierarchical Wireless Sensor Networks based on Combinatorial Designs

Javanbakht

Erfani

Javadi

et al. 2014

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…This is a well-studied problem in the literature on resolvable designs [Desmedt et al 2009;Martin et al 2010]. Briefly, a design is said to be resolvable if the blocks can be partitioned into µ sets or parallel classes, each of which forms a partition of the set of points.…”

Section: Bekps For Revocationmentioning

confidence: 99%

Broadcast-Enhanced Key Predistribution Schemes

Kendall

Martin

et al. 2014

ACM Trans. Sen. Netw.

Self Cite

View full text Add to dashboard Cite

We present a formalisation of a category of schemes which we call Broadcast-enhanced Key Predistribution Schemes (BEKPSs). These schemes are suitable for networks with access to a trusted base station and an authenticated broadcast channel. We demonstrate that the access to these extra resources allows for the creation of BEKPSs with advantages over key predistribution schemes such as flexibility and more efficient revocation. There are many possible ways to implement BEKPSs, and we propose a framework for describing and analysing them.In their paper 'From key predistribution to key redistribution', Cichoń, Go lȩbiewski and Kuty lowski propose a scheme for 'redistributing' keys to a wireless sensor network using a broadcast channel after an initial key predistribution. We classify this as a BEKPS and analyse it in that context. We provide simpler proofs of some results from their paper, give a precise analysis of the resilience of their scheme, and discuss possible modifications. We then study two scenarios where BEKPSs may be particularly desirable and propose a suitable family of BEKPSs for each case. We demonstrate that they are practical and efficient to implement, and our analysis shows their effectiveness in achieving suitable trade-offs between the conflicting priorities in resource-constrained networks.

show abstract

“…Specifically, we will make use of resolvable transversal designs to accomplish this objective. Resolvable transversal designs have previously been exploited for constructing KPSs suited for networks where there is group deployment of nodes; see [8]. The transversal design KPSs proposed by Lee and Stinson do not require the resolvability property; however, the transversal designs TD(2, k, n) used in [5] are in fact resolvable.…”

Section: Scheme 1 (Random Scheme) Suppose a Kps Is Desired For A Netmentioning

confidence: 99%

Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes

Henry

Paterson

Stinson

2014

Selected Areas in Cryptography -- SAC 2013

Self Cite

View full text Add to dashboard Cite

Abstract. Combinatorial key predistribution schemes can provide a practical solution to the problem of distributing symmetric keys to the nodes of a wireless sensor network. Such schemes often inherently suit networks in which the number of nodes belongs to some restricted set of values (such as powers of primes). In a recent paper, Bose, Dey and Mukerjee have suggested that this might pose a problem, since discarding keyrings to suit a smaller network might adversely affect the properties of the scheme.In this paper we explore this issue, with specific reference to classes of key predistribution schemes based on transversal designs. We demonstrate through experiments that, for a wide range of parameters, randomly removing keyrings in fact has a negligible and largely predictable effect on the parameters of the scheme. In order to facilitate these computations, we provide a new, efficient, generally applicable approach to computing important properties of combinatorial key predistribution schemes.We also show that the structure of a resolvable transversal design can be exploited to give a deterministic method of removing keyrings to adjust the network size, in such a way that the properties of the resulting scheme are easy to analyse. We show that these schemes have the same asymptotic properties as the transversal design schemes on which they are based, and that for most parameter choices their behaviour is very similar.

show abstract

Key predistribution for homogeneous wireless sensor networks with group deployment of nodes

Cited by 23 publications

References 27 publications

Key Predistribution Scheme for Clustered Hierarchical Wireless Sensor Networks based on Combinatorial Designs

Key Predistribution Scheme for Clustered Hierarchical Wireless Sensor Networks based on Combinatorial Designs

Broadcast-Enhanced Key Predistribution Schemes

Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes

Contact Info

Product

Resources

About