A Load Balance K-Hop Clustering Algorithm for Ad Hoc Networks

This paper proposed a load balance k-hop clustering algorithm (LBKC) for ad hoc works. Each node uses criteria to decide whether join the contention of cluster-heads. After k rounds of Floodmax[1], the IDs of cluster members are converged to potential cluster-head nodes of the network. Based on these informations, overloaded cluster-heads balance their loads with selected under-loaded cluster-heads. Simulation experiments indicate that proposed LBKC can decrease the overhead of k-hop clustering significantly, and with lower control overheads than max-min k-cluster heuristic.