DocumentCode :
3541614
Title :
Nodes Clustering Method in Large-Scale Network
Author :
Ju Hong-Jun ; Du Li-Juan
Author_Institution :
Dept. of Comput. Sci., North China Inst. of Sci. & Technol., Beijing, China
fYear :
2012
fDate :
21-23 Sept. 2012
Firstpage :
1
Lastpage :
4
Abstract :
Nodes in large-scale network are always divided into many clusters in order to facilitate network management. Super-node based P2P network is an example. The physical scope and the number of clusters are two conflicting objectives and clustering algorithm should strike a balance between them. In this paper, nodes clustering problem is formally described and pre-optimized k-means algorithm is put forward. First pre-optimization algorithm is used to determine the number of clusters and determine reasonable initial cluster centers, then k-means algorithm is used to achieve clustering result. The algorithm presented has low complexity and simulation results shows its effectiveness.
Keywords :
optimisation; pattern clustering; peer-to-peer computing; P2P network; large-scale network; node clustering method; preoptimized k-means algorithm; Algorithm design and analysis; Clustering algorithms; Complexity theory; Delay; Mobile communication; Optimization; Peer-to-peer computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications, Networking and Mobile Computing (WiCOM), 2012 8th International Conference on
Conference_Location :
Shanghai
ISSN :
2161-9646
Print_ISBN :
978-1-61284-684-2
Type :
conf
DOI :
10.1109/WiCOM.2012.6478586
Filename :
6478586
Link To Document :
بازگشت