A Distributed Clustering Framework in Mobile Ad Hoc Networks

Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amount of computational and information overhead while maintaining a stable cluster formation. The algorithm is a distributed version of the Basic Leader-Follower Algorithm used in pattern recognition. Our algorithm does not require maintaining a cluster head. The parameters of the algorithm give us `good' control over the cluster properties.

• Type: Conference
• Year: 2004
• Where: ICWN
• Authors: Mohit Garg, R. K. Shyamasundar
• Keywords: Algorithm, Basic Leader-Follower Algorithm, ICWN 2004, ICWN 2007, Stable Cluster Formation