2010/03/12 by Alok Ojha, Hongmei Deng, Ojha, Alok +5
Computer Science · #Cooperative Communication and Network Coding #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1003.2614
openalex publication_date 2010/03/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.