Hierarchical networks: Routing and clustering (A concise survey)

H. Kiwan, Y. L. Morgan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of 2013 26th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2013
DOIs
StatePublished - 2013
Event2013 26th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2013 - Regina, SK, Canada
Duration: 5 May 20138 May 2013

Publication series

NameCanadian Conference on Electrical and Computer Engineering
ISSN (Print)0840-7789

Conference

Conference2013 26th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2013
Country/TerritoryCanada
CityRegina, SK
Period5/05/138/05/13

Keywords

  • clustering
  • Hierarchical
  • networks
  • optimization
  • routing algorithms
  • topology

Fingerprint

Dive into the research topics of 'Hierarchical networks: Routing and clustering (A concise survey)'. Together they form a unique fingerprint.

Cite this