A new key predistribution scheme for general and grid-group deployment of wireless sensor networks

Abstract

Key predistribution for wireless sensor networks has been a challenging field of research because stringent resource constraints make the key predistribution schemes difficult to implement. Despite this, key predistribution scheme is regarded as the best option for key management in wireless sensor networks. Here, the authors have proposed a new key predistribution scheme. This scheme exhibits better performance than existing schemes of its kind. Moreover, our scheme ensures constant time of key establishment between two nodes. We provide some bounds on the resiliency of this scheme. Next, we use this new key predistribution scheme in a grid-group deployment of sensor nodes. The entire deployment zone is broken into square regions. The sensor nodes falling within a single square region can communicate directly. Sensor nodes belonging to different square regions can communicate by means of special nodes deployed in each of the square region. We measure the resiliency in terms of fraction of links disconnected as well as fraction of nodes and regions disconnected. We show that our key predistribution scheme when applied to grid-group deployment performs better than standard models in existence.

Secure combinatorial key predistribution scheme for sensor networks by regulating frequencies: magneto optic sensors

“…The work devises a protocol in the lines of an earlier works that perform efficiently with only one CH per cluster thereby establishes that 3 “agents” per cluster is a luxurious requirement of . More recent works imitate similar tricks as the literature (without due reference to these earlier works) while proposing their respective schemes. These schemes perform equally efficiently with only 1 “supernode” per cluster.…”

“…For instance, a desired property of a randomized scheme may occur only with a certain probability whereas they can be proven to hold in a deterministic scheme (refer to the literature). This led to proposals of numerous deterministic KPS etc using various combinatorial tricks. Certain KPS exploit special structures like unique factorization domain (UFD).…”

“…Whereas any BS is a powerful unit that connects the network to an end user. A standard method to incorporate hierarchy in these networks is to introduce special nodes called cluster heads (CH) (or gateway nodes or super nodes or agents). For instance, the works implements hierarchy to classic key predistribution schemes (KPS) .…”

A Survey on Security Techniques in Group Communication for Wireless Sensor Networks

“…Hybrid approaches have also been proposed for WSN. In hybrid approaches, both symmetric and asymmetric keys are used [15]. Public key cryptography is not viable to use in those sensor networks, which have large number of nodes.…”

“…The attained results demonstrate that their approach improves significantly the network scalability even as providing high secure connectivity expositing and good generally presentations. Bag and Roy [15] have presented a key predistribution method in a grid-group exploitation of sensor nodes. The method makes sure that there will be high probability of survival of an ordinary unexposed link between two nodes belonging to two dissimilar groups yet if a substantial number of nodes are cooperation's by the opponent.…”