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...

Full description

Bibliographic Details
Main Authors: Pathan, Al-Sakib Khan, Hong, Choong Seon
Format: Article
Language:English
Published: Springer-Verlag, Berlin, Germany 2006
Subjects:
Online Access:http://irep.iium.edu.my/783/
http://irep.iium.edu.my/783/
http://irep.iium.edu.my/783/
http://irep.iium.edu.my/783/1/spathanHPCC.pdf
id iium-783
recordtype eprints
spelling iium-7832011-08-04T07:53:25Z http://irep.iium.edu.my/783/ A key-predistribution-based weakly connected dominating set for secure clustering in DSN Pathan, Al-Sakib Khan Hong, Choong Seon Q Science (General) QA76 Computer software 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. Springer-Verlag, Berlin, Germany 2006 Article PeerReviewed application/pdf en http://irep.iium.edu.my/783/1/spathanHPCC.pdf 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) http://www.springerlink.com/content/h21313l10686g551/about/ DOI: 10.1007/11847366_28
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic Q Science (General)
QA76 Computer software
spellingShingle Q Science (General)
QA76 Computer software
Pathan, Al-Sakib Khan
Hong, Choong Seon
A key-predistribution-based weakly connected dominating set for secure clustering in DSN
description 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.
format Article
author Pathan, Al-Sakib Khan
Hong, Choong Seon
author_facet Pathan, Al-Sakib Khan
Hong, Choong Seon
author_sort Pathan, Al-Sakib Khan
title A key-predistribution-based weakly connected dominating set for secure clustering in DSN
title_short A key-predistribution-based weakly connected dominating set for secure clustering in DSN
title_full A key-predistribution-based weakly connected dominating set for secure clustering in DSN
title_fullStr A key-predistribution-based weakly connected dominating set for secure clustering in DSN
title_full_unstemmed A key-predistribution-based weakly connected dominating set for secure clustering in DSN
title_sort key-predistribution-based weakly connected dominating set for secure clustering in dsn
publisher Springer-Verlag, Berlin, Germany
publishDate 2006
url http://irep.iium.edu.my/783/
http://irep.iium.edu.my/783/
http://irep.iium.edu.my/783/
http://irep.iium.edu.my/783/1/spathanHPCC.pdf
first_indexed 2023-09-18T20:07:56Z
last_indexed 2023-09-18T20:07:56Z
_version_ 1777407283894943744