Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks

Details Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks

2010-03-12

arxiv.org/abs/1003.2614v1

Computer Science

Cryptography and Security

4 Pages, 5 Figures, International Conference on Computers and Device Communication, CODEC-2004, Jan 1-3, 2004, Kolkata, India

Scientific paper

In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless Ad Hoc networks. As it is vulnerable to a single point of failure, we propose a new adaptive distributed threshold scheme to replace the cluster head by a group of cluster heads within each cluster, called COUNCIL, and distribute the service of single cluster head to multiple cluster heads using (k,n) threshold secret sharing scheme. An Ad Hoc network formed by COUNCIL based clusters can work correctly when the number of compromised cluster heads is smaller than k. To implement this adaptive threshold scheme in wireless Ad Hoc Networks, membership of the clusters should be defined in an adaptive way. In this paper, we mainly discuss our algorithm for forming COUNCIL based clusters using the concept of dominating set from graph theory.

Affiliated with

Also associated with

No associations

Rating

Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks 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 Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190818