DocumentCode :
2228497
Title :
SACA: SCM-based adaptive clustering algorithm
Author :
Li, Yan ; Verma, Snigdha ; Lao, Li ; Cui, Jun-Hong
Author_Institution :
Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA
fYear :
2005
fDate :
27-29 Sept. 2005
Firstpage :
271
Lastpage :
279
Abstract :
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 connectivity into consideration. It can control the cluster 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 efficient clustering scheme, while requiring comparable running time for power law topologies and grid topologies, and significantly less running time for random topologies.
Keywords :
grid computing; performance evaluation; routing protocols; telecommunication network topology; SACA; SCM-based adaptive clustering algorithm; grid topology; network modelling; performance evaluation; power law topology; routing protocol; scaled coverage measure; Algorithm design and analysis; Clustering algorithms; Computer science; Design engineering; IP networks; Local area networks; Network topology; Routing protocols; Size control; Telecommunication network topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005. 13th IEEE International Symposium on
ISSN :
1526-7539
Print_ISBN :
0-7695-2458-3
Type :
conf
DOI :
10.1109/MASCOTS.2005.59
Filename :
1521141
Link To Document :
بازگشت