A Stable Path-Based Clustering Algorithm in Mobile Ad Hoc Networks
Ren Xiang-xiang · Computer Engineering and Science · 2006
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 purpose of the clustering algorithm is to support the data replication for improving data availability at the point of network partitioning in the MANET environment.We make a theoretical analysis of the complexity of our algorithm.Simulation results show that the clusters created by our clustering algorithm have desirable properties in the MANET environment.