Secure clustering in DSN with key pre-distribution and WCDS

Authors:
Al-Sakib Khan Pathan;Choong Seon Hong
Affiliations:
Networking Lab, Kyung Hee University, South Korea;Department of Computer Engineering, Kyung Hee University, South Korea
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 6
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

IEEE Transactions on Mobile Computing
Distance-Based Energy Efficient Clustering for Wireless Sensor Networks

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Towards potential-based clustering for wireless sensor networks

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Distributed EM algorithms for density estimation and clustering in sensor networks

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.