Networking environments with connectivity, bandwidth and computational constraints such as critical infrastructure networks or MANETs benefit from non-interactive key predistribution capabilities. In these networks, nodes can compute shared keys using public identities without the need for interactions once basic key materials are distributed to them. Motivated by the electric power grid, in th...

In cloning attacks, an adversary captures a sensor node, reprograms it, makes multiple copies, and inserts these copies, into the network. Cloned nodes subvert sensor network processing from within. In a companion paper [2], we show how to detect and remove clones from sensor networks using random key predistribution security measures. Keys that are present on the cloned nodes are detected by u...

In this paper, we propose a new deterministic key predistribution scheme for secure communication in wireless sensor networks. Our scheme provides better trade-off among scalability, computation overhead, connectivity and resilience against node captures than existing key predistribution schemes, particularly in situations where the nodes in the network are highly mobile.

Title of dissertation: RANDOM GRAPH MODELING OF KEY DISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKS Osman Yağan, Doctor of Philosophy, 2011 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering Wireless sensor networks (WSNs) are distributed collections of sensors with limited capabilities for computations and wireless communications. It is en...

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) ...

Security is an indispensable concern in Wireless Sensor Network (WSN) due to the presence of potential adversaries. For secure communication in infrastructureless sensor nodes various key predistribution have been proposed. In this paper we have evaluated various existing deterministic, probabilistic and hybrid type of key pre-distribution and dynamic key generation algorithms for distributing ...

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

Wireless Sensor Networks consist of small nodes with sensing, computation and communication capabilities, often deployed in remote inaccessible areas to interact with the environment and forward the measured event to the base station, thus posing several possibilities of physical attacks. Hence security becomes an important issue in wireless sensor networks. For resource constrained environment...