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

Authors:
Al-Sakib Khan Pathan;Choong Seon Hong
Affiliations:
Networking Lab, Department of Computer Engineering, Kyung Hee University Giheung, Yongin, Gyeonggi, Korea;Networking Lab, Department of Computer Engineering, Kyung Hee University Giheung, Yongin, Gyeonggi, Korea
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 6
Cited 2

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

A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Information Processing Letters
Weakly connected dominating set-based secure clustering and operation in distributed sensor networks

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.