A Quality of Service Routing and Distributed Clustering Framework in Mobile Ad Hoc Networks

Abstract — In this document, 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 algo-rithm is a distributed version of the Basic Leader-Follower Algorithm used in pattern recognition. Our algorithm does not require maintaining a cluster head. We also propose a modified Quality of Service routing algorithm for a partitioned (clustered) set of mobile nodes in an ad-hoc network. The proposed algorithm works on the basis of an acquaintance based approach in which temporary contacts enable fast inter-cluster routing