loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
SACA: SCM-based Adaptive Clustering Algorithm
Atlanta, Georgia
September 27-September 29
ISBN: 0-7695-2458-3
Yan Li, Computer Science and Engineering Department, University of Connecticut, Storrs, CT
Snigdha Verma, Computer Science and Engineering Department, University of Connecticut, Storrs, CT
Li Lao, Computer Science Department, University of California, Los Angeles, CA
Jun-Hong Cui, Computer Science & Engineering Department, University of Connecticut, Storrs, CT

Network clustering is an important technique widely used in efficient hierarchical routing protocol design, network modelling and performance evaluation, etc. In this paper, we discuss the important clustering criteria, such as node connectivity, cluster diameter, number of orphan nodes. Our main contribution is a novel clustering algorithm SACA based on an accurate clustering measure called SCM. SACA adaptively forms clusters to incrementally improve the clustering quality, taking node connectiuster size effectively and limit the number of orphan nodes. Our simulation study indicates that SACA is more accurate than MCL, a well accepted scalable and eficient clustering scheme, while requiring comparable running time for power law topologies and grid topologies, and significantly less running time for random topologies.

vity into consideration. It can control the cl
Citation:
Yan Li, Snigdha Verma, Li Lao, Jun-Hong Cui, "SACA: SCM-based Adaptive Clustering Algorithm," mascots, pp.271-279, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005
Usage of this product signifies your acceptance of the Terms of Use.