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

Pathan, Al-Sakib Khan and Hong, Choong Seon (2006) A key-predistribution-based weakly connected dominating set for secure clustering in DSN. Lecture Notes in Computer Science (LNCS), 4208. pp. 270-279. ISSN 1611-3349 (O), 0302-9743 (P)

PDF (SCIE indexed LNCS Volume) - Published Version Restricted to Registered users only Download (262kB) | Request a copy

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.

Item Type:	Article (Journal)
Additional Information:	6481/783
Uncontrolled Keywords:	distributed sensor network (DSN), wireless sensor network, WSN, key-predistribution scheme
Subjects:	Q Science > Q Science (General) Q Science > QA Mathematics > QA76 Computer software
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology Kulliyyah of Information and Communication Technology Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Dr. Al-Sakib Khan Pathan
Date Deposited:	04 Aug 2011 15:50
Last Modified:	04 Aug 2011 15:53
URI:	http://irep.iium.edu.my/id/eprint/783

Actions (login required)

View Item