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...
Main Authors: | , |
---|---|
Format: | Proceeding Paper |
Language: | English |
Published: |
2006
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/662/1/707.pdf |
_version_ | 1796874691120463872 |
---|---|
author | Pathan, Al-Sakib Khan Hong, Choong Seon |
author_facet | Pathan, Al-Sakib Khan Hong, Choong Seon |
author_sort | Pathan, Al-Sakib Khan |
collection | IIUM |
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. |
first_indexed | 2024-03-05T22:28:03Z |
format | Proceeding Paper |
id | oai:generic.eprints.org:662 |
institution | International Islamic University Malaysia |
language | English |
last_indexed | 2024-03-05T22:28:03Z |
publishDate | 2006 |
record_format | dspace |
spelling | oai:generic.eprints.org: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 Proceeding Paper 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 |
spellingShingle | Q Science (General) QA76 Computer software Pathan, Al-Sakib Khan Hong, Choong Seon Secure clustering in DSN with key predistribution and WCDS |
title | 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_short | Secure clustering in DSN with key predistribution and WCDS |
title_sort | secure clustering in dsn with key predistribution and wcds |
topic | Q Science (General) QA76 Computer software |
url | http://irep.iium.edu.my/662/1/707.pdf |
work_keys_str_mv | AT pathanalsakibkhan secureclusteringindsnwithkeypredistributionandwcds AT hongchoongseon secureclusteringindsnwithkeypredistributionandwcds |