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 duster 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 duster properties