关键词: MANET 分簇 完全子图

Abstract:

A new distributed clustering algorithm is presented in this paper for dynamically organizing mobile nodes into clusters in which the probability of path availability can be bounded. The algorithm can adapt to the topological changes and help minimize the far-reaching effects of these changes. The purp ose of the clustering algorithm is to support the data replication for improving data availability at the point of network partitioning in the MANET env  iromnent. We make a theoretical analysis of the complexity of our algorithm. Simulation results show that the clusters created by our clustering algorit hm have desirable properties in the MANET environment.

Key words: MANET cluster clique