Security is very necessary for secure operations in wireless sensor networks (WSNs), especially in hostile environments. To achieve security, key agreement needs to be implemented efficiently among communicating nodes. Nonetheless, acquiring such key agreement in WSNs becomes extremely intricate due to resource constraints. Among approaches so far, key predistribution approach is considered as ...

The security issue in a wireless sensor network (WSN) has been drawing considerable research attention in recent years. Key management, a basic security service, becomes the core design for various security services, such as encryption and authentication. To increase the connectivity of each key in a large-scale WSN and to enlarge its maximum supportable network size, this paper presents a scal...

There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes. Many of these schemes have very similar properties and are analysed in a similar manner. We seek to provide a unified framework to study these kinds of schemes. We derive general formulas for the metrics of the resul...

The hypercube-based key predistribution scheme in sensor networks has some attractive features. However, it has no capability of providing basic authentication service for sensor networks due to using polynomial-based approach. In this article, we introduce a novel tame-based approach, in which a symmetric and two-one bivariate map is generated for key predistribution by exploiting a tame autom...

Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a q-composite random key graph, whose construction on n nodes is as follows: each node independently selects a set of Kn different keys uniformly at random fro...

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, si...

Wireless sensor networks are often deployed in hostile environments and operated on an unattended mode require secure communication among the sensor nodes within the networks. In this paper, we present an energy efficient dynamic mixed key management based on virtual grid for wireless sensor networks.First,we divide the whole area into many clusters and a cluster is composed of many virtual gri...

In this paper, we propose a novel identity-based random key pre-distribution scheme called the identity based key pre-distribution using a pseudo random function (IBPRF), which has better trade-off between communication overhead, network connectivity and resilience against node capture compared to the other existing key predistribution schemes. IBPRF always guarantees that no matter how many se...