Secure Clustering in DSN with Key Predistribution and WCDS

Details Secure Clustering in DSN with Key Predistribution and WCDS Secure Clustering in DSN with Key Predistribution and WCDS

2007-12-27

arxiv.org/abs/0712.4173v1

IEEE Military Communications Conference (IEEE MILCOM 2006), October 23-25, Washington, DC, USA

Computer Science

Networking and Internet Architecture

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Secure Clustering in DSN with Key Predistribution and WCDS does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure Clustering in DSN with Key Predistribution and WCDS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Clustering in DSN with Key Predistribution and WCDS will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200989