Projective Plane-Based Key Pre-distribution by Key Copying and Exchanging based on Dominating Sets in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. WSNs are susceptible to security attacks and their simple hardware architecture prevents applying hardware based defensive mechanisms. Pair-wise key predistribution protocols are essential for WSNs since they are under the influence of resource limitations of physical nodes. One mathematical structure called Balanced Incomplete Block Design (BIBD) is used to construct the key rings. BIBD scheme uses finite projective plane of order n to generate a symmetric design. Since parameter n has to be a prime power; therefore, not all network sizes can be supported for a fixed key-chain size. Weakly Connected Dominating Set (WCDS) was recommended to serve as a virtual backbone for WSNs.It can reduce the routing overhead and topology control.Therefore network security is improved by restricting the main routing tasks to only dominators. In this paper, we discuss the use of combinatorial set systems in the design of deterministic key pre-distribution schemes for distributed sensor networks. We focus on analyzing combinatorial properties of the set systems that relate to the connectivity and resilience of the resulting distributed sensor networks and then we present a new model for reforming projective plane with permutation key copying and exchanging (PKCAE) based on dominating sets and virtual backbone-based topology control, we deal with the evaluation of design efficiency by analyzing shared common key and connectivity of the model in arbitrary network size, scalability in sensor network and path key establishment.