A variable degree based clustering algorithm for networks

• DOI: 10.1109/icccn.2003.1284210
• Publication Date: 2004-06-03T20:14:56Z
• Authors: J. Lian; G.B. Agnew; S. Naik
• Keywords: Degree (music); Hierarchical clustering; Routing algorithm; Hierarchical routing; Hierarchical network model

Hierarchical routing is used to reduce update costs, and clustering algorithms partition networks into multilevel cluster structures. In hierarchical networks, performance greatly affected by the sizes structures of partitioned clusters. Two existing are based on concepts lowest ID maximum degree nodes. this paper, we present a new algorithm concept variable Our produces clusters with low variance in size, number close optimal value that leads smallest total table size. The evaluated using simulated ad hoc networks.