摘要
目前的分簇算法一般基于移动节点初始状态静止的假设,且部分算法在节点移动或节点退出时会导致全局簇结构的重建。针对上述问题,提出一种基于权值的分布式分簇算法,利用该算法改进CBRP协议,提出DRP协议。运用NS-2模拟仿真工具对CBRP与DRP的性能进行分析,结果显示,DRP具有较高的吞吐率和较低的网络开销。
Most clustering algorithms assume that mobile nodes keep static in initial state, and some algorithms may cause the cluster structure to be completely rebuilt over the network when some local events take place. This paper presents a Distributed Weighted Clustering Algorithm（DWCA） to solve these problems, improves Cluster-based Routing Protocol（CBRP） with DWCA, and proposes Distributed Routing Protocol（DRP） based on cluster. Experiments with NS-2 network simulator show that DRP has the advantages of higher throughput and lower overhead.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第3期89-91,共3页
Computer Engineering
