Secure Clustering in DSN with Key Predistribution and WCDS

This paper proposes an efficient approach of secure clustering in distributed sensor networks. The clusters or groups in the network are formed based on offline rank assignment and predistribution of secret keys. Our approach uses the concept of weakly connected dominating set (WCDS) to reduce the number of cluster-heads in the network. The formation of clusters in the network is secured as the secret keys are distributed and used in an efficient way to resist the inclusion of any hostile entity in the clusters. Along with the description of our approach, we present an analysis and comparison of our approach with other schemes. We also mention the limitations of our approach considering the practical implementation of the sensor networks.Comment: 6 page

An Efficient PKC-Based Security Architecture for Wireless Sensor Networks

In spite of previous widely held belief of the incompatibility of public key cryptography (PKC) schemes for wireless sensor networks (WSNs), some recent works have shown that, PKC based schemes could be implemented for such networks in some ways. The major challenge of employing a PKC scheme in wireless sensor network is posed by the limitations of resources of the tiny sensors. Considering this feature of the sensors, in this paper, we propose an efficient PKC based security architecture with relatively less resource requirements than those of the other previously proposed PKC schemes for WSN. Our security architecture comprises basically of two parts; a key handshaking scheme based on simple linear operations and the derivation of decryption key by a receiver node. Our architecture allows both base-station-to-node or node-to-base-station secure communications, and node-to-node secure communications. Analysis and simulation results show that, our proposed architecture ensures a good level of security for communications in the network and could effectively be implemented using the limited computation, memory and energy budgets of the current generation sensor nodes.Comment: 7 page

Denial of service in wireless sensor networks: issues and challenges

Wireless Sensor Network (WSN), composed of a huge number of resource-constrained sensors can be used for a large number of securitysensitive applications. Regardless of the type of application, smooth collection and delivery of data from this type of network is one of the critical requirements. If the data supply process is hampered and thus the expected services become unavailable due to the intentional attempts of the adversaries, we consider this as a Denial of Service (DoS) attack. As DoS attack targets to jeopardize the usual services, it can often drastically curtail the utility of wireless sensor network. In this short communication, we explore the meaning of DoS in WSN, its effective mitigation techniques, and recent issues and challenges in this research area

A key-predistribution-based weakly connected dominating set for secure clustering in DSN

The intent of this paper is to propose an efficient approach of secure clustering in distributed sensor networks. The clusters or groups in the network are formed based on offline rank assignment and key-predistribution. Our approach uses the concept of weakly connected dominating set to reduce the number of cluster heads in the network. The formation of clusters in the network is secured as the secret keys are distributed and used in an efficient way to resist the inclusion of any hostile entity in the clusters. Along with the description of our mechanism, we present an analysis and comparison to justify the efficiency of our approach