DocumentCode :
2784370
Title :
A variable degree based clustering algorithm for networks
Author :
Lian, Jie ; Agnew, Gordon B. ; Naik, Sagar
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fYear :
2003
fDate :
20-22 Oct. 2003
Firstpage :
465
Lastpage :
470
Abstract :
Hierarchical routing is used to reduce routing update costs, and clustering algorithms partition networks into multilevel cluster structures. In hierarchical networks, routing performance is greatly affected by the sizes and structures of partitioned clusters. Two existing clustering algorithms are based on the concepts of the lowest ID and the maximum degree of nodes. In this paper, we present a new clustering algorithm based on the concept of the variable degree of nodes. Our new algorithm produces clusters with the low cluster variance in size, and the number of the clusters is close to the optimal value that leads to the smallest total routing table size. The performance of the algorithm is evaluated by using simulated ad hoc networks.
Keywords :
ad hoc networks; mobile radio; pattern clustering; telecommunication network routing; clustering algorithms partition networks; hierarchical routing; multilevel cluster structures; nodes variable degree; simulated ad hoc networks; Ad hoc networks; Clustering algorithms; Computer networks; Costs; Intrusion detection; Mobile ad hoc networks; Network topology; Partitioning algorithms; Routing; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communications and Networks, 2003. ICCCN 2003. Proceedings. The 12th International Conference on
ISSN :
1095-2055
Print_ISBN :
0-7803-7945-4
Type :
conf
DOI :
10.1109/ICCCN.2003.1284210
Filename :
1284210
Link To Document :
بازگشت