Skip to Main Content
Constraints in resources of the constituent sensors of any Wireless Sensor Network (WSN) are most challenging aspects while designing security models for such networks. Naturally one prefers 'less expensive' symmetric key cryptography over public key techniques during communication among nodes. In such cryptosystems, both the communicating parties must possess the same cryptographic key prior to message exchange. This is normally achieved by key predistribution (KPD). One such scheme based on Transversal Design was proposed by Lee and Stinson in 2005. However the mentioned scheme is devoid of full communication among the nodes. The aforesaid weakness gives rise to multi-hop communication involving other node(s) which reduces efficiency of such communication. Deterministic merging nodes results in a smaller network having bigger blocks result in full communication between the blocks. The deterministic merging block strategy can be thought as pre assigning deterministic paths for any pair of non communicating nodes of the original KPD which lags full communication.