Revisiting Key Predistribution Using Transversal Designs for a Grid-Based Deployment Scheme

Ruj, Sushmita; Roy, Bappaditya

doi:10.1080/15501320802581466

Cited by 7 publications

(3 citation statements)

References 23 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This additional deployment knowledge can be exploited through the use of distinct difference configurations and Costas arrays [1,2]. Other papers that consider a combinatorial approach to grid-based networks include [35,36]. Another specialised model for WSN concerns networks where nodes are deployed randomly in groups.…”

Section: Rational Normal Curves In Projective Spacesmentioning

confidence: 99%

A unified approach to combinatorial key predistribution schemes for sensor networks

Paterson

Stinson

2012

Des. Codes Cryptogr.

View full text Add to dashboard Cite

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. To do so, we define a new, general class of designs, termed "partially balanced t-designs", that is sufficiently general that it encompasses almost all of the designs that have been proposed for combinatorial key predistribution schemes. However, this new class of designs still has sufficient structure that we are able to derive general formulas for the metrics of the resulting key predistribution schemes. These metrics can be evaluated for a particular scheme simply by substituting appropriate parameters of the underlying combinatorial structure into our general formulas. We also compare various classes of schemes based on different designs, and point out that some existing proposed schemes are in fact identical, even though their descriptions may seem different. We believe that our general framework should facilitate the analysis of proposals for combinatorial key predistribution schemes and their comparison with existing schemes, and also allow researchers to easily evaluate which scheme or schemes present the best combination of performance metrics for a given application scenario.

show abstract

Section: Rational Normal Curves In Projective Spacesmentioning

confidence: 99%

A unified approach to combinatorial key predistribution schemes for sensor networks

Paterson

Stinson

2012

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

“…Their works also suggests that both shared key establishment and path key discovery can be better achieved by the suggested deterministic approach. Some other deterministic schemes have been proposed by Ruj and Roy using various combinatorial designs like PBIBD and Transversal Designs in their works [9,10] respectively. Very recently unique factorization of polynomials over Finite Fields has been invoked by Sarkar and Chowdhury [16] to give a KPD scheme while Bag and Ruj [1] utilizes Affine plane geometry over Finite field for similar purpose.…”

Section: Hierarchal Wireless Sensor Network(hwsn)mentioning

confidence: 99%

Assured Full Communication by Merging BlocksRandomly in Wireless Sensor Networks usingReed Solomon Code for Key Predistribution

Sarkar¹,

Dhar²

2011

IJNSA

View full text Add to dashboard Cite

Limited resources available to the sensors (nodes) constituting a Wireless Sensor Network (WSN) is major constraint while dealing with security of such networks. This restrict us to use symmetric key cryptography instead of public-key techniques for transmission of message amongst the nodes. In any symmetric key system, both the sender and receiver must possess the unique enciphering and deciphering key prior to exchange of message. This leads to key distribution in the sensors which in itself is a major challenge. Though there are several methods of distributing the keys, due to resource constraints, Key Predistrubution (KPD) is preferred over other techniques. It requires predistribution of keys in nodes prior to deployment and establishing immediately once deployed. However there are certain weaknesses in various existing KPD schemes. For instance, often it is not guaranteed that any given pair of nodes communicate directly. This leads one to revert to multi-hop communication involving intermediate sensor nodes resulting in increased cost of communication. In this work a key predistribution technique using Reed-Solomon codes is considered which is faced with the above weakness. The authors suggests a technique of merging certain number of sensors into blocks ensuring that the blocks have full connectivity amongst themselves. The approach also improves both time and space complexity of the system while ensuring same scalability with similar resiliency.

show abstract

“…Wide-spread deployment of sensor networks is quite practical these days. A network of thousands or more sensors allows an efficient solution to various challenging tasks: traffic monitoring, monitoring of building with respect to the structure, fire, and security, military sensing and tracking, distributed measurement of seismic activity, real-time pollution monitoring, wild life monitoring, wild fire tracking, and so forth [1][2][3]. Energy-aware distributed intelligent data gathering with wireless sensor networks is a hot issue lately due to the emerge of big data paradigm [4].…”

Section: Introductionmentioning

confidence: 99%

An Energy-Efficient Key Predistribution Scheme for Secure Wireless Sensor Networks Using Eigenvector

Choi

Kim

Youn

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Currently, sensor networks are widely used in various fields. Here secure operations are required for critical applications since the damages are significant if the network is compromised or disrupted. For the security of wireless sensor network, the earlier schemes typically employ asymmetric cryptography. These schemes are, however, often unsuitable for wireless sensor network due to the limited computational power and energy of the sensor nodes. To address this issue, various approaches have been developed, and the random key predistribution approach has been recognized as an effective approach. One shortcoming, however, is that a common key is not guaranteed to be found between any two nodes wanting to communicate. This paper proposes a new robust key predistribution scheme solving this problem, with which the security is not compromised even though the data exchanged between the nodes are tapped by an adversary. This is achieved by using the keys assigned based on the notion of eigenvalue and eigenvector of a square matrix of a pool of keys. Mathematical analysis and computer simulation reveal that the proposed scheme significantly reduces the overhead required for secure connectivity and energy consumption of sensor nodes compared to the existing approaches.

show abstract

Revisiting Key Predistribution Using Transversal Designs for a Grid-Based Deployment Scheme

Cited by 7 publications

References 23 publications

A unified approach to combinatorial key predistribution schemes for sensor networks

A unified approach to combinatorial key predistribution schemes for sensor networks

Assured Full Communication by Merging BlocksRandomly in Wireless Sensor Networks usingReed Solomon Code for Key Predistribution

An Energy-Efficient Key Predistribution Scheme for Secure Wireless Sensor Networks Using Eigenvector

Contact Info

Product

Resources

About