DocumentCode :
624451
Title :
Hierarchical networks: Routing and clustering (A concise survey)
Author :
Kiwan, H. ; Morgan, Y.L.
Author_Institution :
Fac. of Eng., Univ. of Regina & Appl. Sci., Regina, SK, Canada
fYear :
2013
fDate :
5-8 May 2013
Firstpage :
1
Lastpage :
4
Abstract :
The network topologies enhancements are necessary in correspond to the growing of data networks. In this paper, large network problem is described. It includes the routing update cost. The concept of hierarchical network is explained as a considered solution. The hierarchical routing algorithms working methodology and protocols are presented and compared. In addition, it provides a sufficient description for the pros and cons of each protocol. The hierarchical network problems of cluster number, size distribution and number of levels, and solving approaches are discussed. This paper discusses how to identify the best clustering algorithm for wired, ad-hoc and wireless sensor networks. The optimization guidelines are explained.
Keywords :
telecommunication network routing; telecommunication network topology; wireless sensor networks; ad hoc networks; clustering algorithm; data network; hierarchical network problem; hierarchical routing algorithm; network topology; optimization guidelines; protocols; wireless sensor networks; Algorithm design and analysis; Classification algorithms; Clustering algorithms; Heuristic algorithms; Optimization; Routing; Wireless sensor networks; Hierarchical; clustering; networks; optimization; routing algorithms; topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Computer Engineering (CCECE), 2013 26th Annual IEEE Canadian Conference on
Conference_Location :
Regina, SK
ISSN :
0840-7789
Print_ISBN :
978-1-4799-0031-2
Electronic_ISBN :
0840-7789
Type :
conf
DOI :
10.1109/CCECE.2013.6567742
Filename :
6567742
Link To Document :
بازگشت