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

Full description

Bibliographic Details
Main Authors: Pathan, Al-Sakib Khan, Hong, Choong Seon
Format: Conference or Workshop Item
Language:English
Published: 2006
Subjects:
Online Access:http://irep.iium.edu.my/662/
http://irep.iium.edu.my/662/
http://irep.iium.edu.my/662/1/707.pdf
id iium-662
recordtype eprints
spelling iium-6622011-08-02T03:22:53Z http://irep.iium.edu.my/662/ Secure clustering in DSN with key predistribution and WCDS Pathan, Al-Sakib Khan Hong, Choong Seon Q Science (General) QA76 Computer software 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. 2006 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/662/1/707.pdf Pathan, Al-Sakib Khan and Hong, Choong Seon (2006) Secure clustering in DSN with key predistribution and WCDS. In: IEEE Military Communications Conference (IEEE MILCOM 2006), October 23-25, 2006, Washington, DC, USA. http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=Secure+Clustering+in+DSN+with+Key+Predistribution+and+WCDS&x=0&y=0
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
Secure clustering in DSN with key predistribution and WCDS
description 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.
format Conference or Workshop Item
author Pathan, Al-Sakib Khan
Hong, Choong Seon
author_facet Pathan, Al-Sakib Khan
Hong, Choong Seon
author_sort Pathan, Al-Sakib Khan
title Secure clustering in DSN with key predistribution and WCDS
title_short Secure clustering in DSN with key predistribution and WCDS
title_full Secure clustering in DSN with key predistribution and WCDS
title_fullStr Secure clustering in DSN with key predistribution and WCDS
title_full_unstemmed Secure clustering in DSN with key predistribution and WCDS
title_sort secure clustering in dsn with key predistribution and wcds
publishDate 2006
url http://irep.iium.edu.my/662/
http://irep.iium.edu.my/662/
http://irep.iium.edu.my/662/1/707.pdf
first_indexed 2023-09-18T20:07:49Z
last_indexed 2023-09-18T20:07:49Z
_version_ 1777407276680740864