k-hop compound metric based clustering scheme for ad hoc networks
Supeng Leng, Liren Zhang, Yifan Chen · 2005
This paper focuses on the design of a novel approach for dynamic k-hop clustering architecture, which is called k-hop compound metric based clustering (KCMBC). KCMBC is a fast convergent and load balancing clustering approach that is able to demonstrate significant improvement on the network performance, in terms of scalability and stability for large-scale ad hoc networks. On the other hand, since KCMBC has taken into account the host mobility, the clusters constructed by KCMBC are more stable than the other schemes. Simulation results show that the clusters created by using the KCMBC approach have modest but more uniform cluster size. Moreover, cluster-head duration can be increased by KCMBC significantly.