K-hop compound metric based clustering scheme for ad hoc networks

Supeng Leng, Liren Zhang, Yifan Chen

    Research output: Contribution to journalConference articlepeer-review

    11 Citations (Scopus)


    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 of 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.

    Original languageEnglish
    Pages (from-to)3396-3400
    Number of pages5
    JournalIEEE International Conference on Communications
    Publication statusPublished - Sept 12 2005
    Event2005 IEEE International Conference on Communications, ICC 2005 - Seoul, Korea, Republic of
    Duration: May 16 2005May 20 2005


    • Ad hoc network
    • Clustering
    • Mobility
    • Scalability

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering


    Dive into the research topics of 'K-hop compound metric based clustering scheme for ad hoc networks'. Together they form a unique fingerprint.

    Cite this