Date of Submission


Date of Award


Institute Name (Publisher)

Indian Statistical Institute

Document Type

Doctoral Thesis

Degree Name

Doctor of Philosophy

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Roy, Bimal Kumar (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

Wireless communication has a compelling need in today’s world. This need is driven by the sudden surge in the demand of ad-hoc networks like wireless sensor networks. These networks consist of many isolated devices called nodes that use the wireless medium for communication. There are three security notions attached to any wireless communication. These are data confidentiality, data integrity and data availability. Cryptographic protocols are required for achieving the first two notions which in turn require shared secret keys. The last notion viz. data availability mainly deals with protecting the data from ‘denial of service attack’.In this thesis, we apply combinatorial designs for achieving these three security notions. We study key predistribution in wireless sensor networks and jamming resistant communication and propose new schemes using combinatorial design. The designs we used here are Affine Geometry, Transversal Design, Steiner Triple System, Symmetric Balanced Incomplete Block Design, Mutually Orthogonal Latin Squares etc. Though combinatorial designs have been in use for key predistribution in wireless sensor networks for past few years, the techniques we propose in this thesis are far better than others in terms of connectivity, resilience etc.As mentioned above, keys are required for ensuring data security in a wireless network. We propose three different schemes that can be used for key predistribution in wireless sensor networks of different kinds. The first one is for a homogeneous wireless sensor network containing identical nodes. We use affine geometry to design the key predistribution scheme. This scheme ensures constant time shared key discovery. We show that the performance of this scheme is better than several other schemes of similar kind. We also propose another key predistribution scheme using a two-layered hybrid design having Symmetric Balanced Incomplete Block Design at the upper layer and Blom’s scheme at the lower layer. Like the previous scheme this scheme also comes with a constant time shared key discovery mechanism. This key predistribution scheme is highly resilient against random node capture attack and beats all other schemes of similar kind with a huge margin. We then show how this scheme can be used in a grid-group deployment.Again we propose a key predistribution scheme for grid-group deployment of sensor nodes. Here we assume that the sensor nodes are distributed in groups. Our scheme mainly focusses on cross-group key establishment i.e key establishment between sensor nodes belonging to two different groups. This scheme offers an improvement in terms of resiliency to other schemes in literature.This thesis is the first one to have proposed the use of combinatorial designs in antijamming wireless communication. Thus, this thesis opens a new direction of research in jamming resistant wireless communication. We discuss jamming resistant communication and propose schemes that attempt to maintain steady communication under denial of service attack.We propose a scheme that enables a group of users to communicate in the presence of a jammer who tries to disrupt the communication as much as possible.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


Included in

Mathematics Commons