Clustering Routing Algorithms In Wireless Sensor Networks: An Overview

• Published in: KSII transactions on Internet and information systems 2012, 6(7), , pp.1735-1755
• Main Authors: Liu, Xuxun, Shi, Jinglun
• Format: Article
• Language: English
• Subjects: Algorithms; Clustering (Computers); Wireless sensor networks; 컴퓨터학
• ISSN: 1976-7277; 1976-7277
• DOI: 10.3837/tiis.2012.07.001

Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions. Keywords: WSN, clustering routing, block-based clustering, grid-based clustering, chain-based clustering