基于COUNCIL的无线Ad Hoc网络安全簇的构建
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
摘要：
在基于簇的路由协议（CBRP）中，两级层次结构被成功地用于减少无线Ad Hoc网络中的过洪泛。针对单点失效的问题，提出了一种新的自适应分布式门限方案COUNCIL，将簇头替换为簇内的一组簇头，并采用（k，n）门限秘密共享方案将单个簇头的服务分发给多个簇头.当妥协的簇头数小于k时，由COUNCIL簇组成的Ad Hoc网络能够正常工作。为了在无线Ad Hoc网络中实现这种自适应门限方案，簇的成员资格应该以自适应的方式定义。本文利用图论中的支配集的概念，讨论了一种基于COUNCIL的聚类算法。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
