Distributed Routing Protocol Based on Cluster
Feng Jia-lin, Chen Yong-sheng, Ping Yang · Jisuanji gongcheng · 2010
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.