An Efficient and Optimal Clustering Algorithm for Mobile Ad Hoc Networks
In an Ad-hoc network mobile nodes communicate with each other using multiple wireless links. There is no stationary infrastructure. A research issues in the design of an Ad-hoc network is in development of a dynamic routing protocol that can find routes between two communicating nodes. Nodes heterogeneity and their high degree of mobility are some of the other challenging issues. Clustering based routing is the solution to address all these issues. The idea behind clustering is to group the network nodes into a number of overlapping clusters. Clustering makes possible a hierarchical routing in which paths are recorded between clusters instead of nodes.