A survey on clustering algorithms for wireless sensor networks

被引:1294
作者
Abbasi, Ameer Ahmed [1 ]
Younis, Mohamed
机构
[1] Al Hussan Inst Management & Comp Sci, Dept Comp, Dammam 31411, Saudi Arabia
[2] Univ Maryland, Dept Comp Sci & Elect Engn, Baltimore, MD 21250 USA
关键词
wireless sensor networks; clustering algorithms; scalability; network architecture; energy aware design;
D O I
10.1016/j.comcom.2007.05.024
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility. (C) 2007 Published by Elsevier B.V.
引用
收藏
页码:2826 / 2841
页数:16
相关论文
共 57 条
  • [1] ADAMOU M, 2001, WIP SESS IEEE REAL T
  • [2] Akkaya K., 2005, Ad Hoc Networks, V3, P325, DOI 10.1016/j.adhoc.2003.09.010
  • [3] Wireless sensor networks: a survey
    Akyildiz, IF
    Su, W
    Sankarasubramaniam, Y
    Cayirci, E
    [J]. COMPUTER NETWORKS, 2002, 38 (04) : 393 - 422
  • [4] AMIS AD, 2000, P IEEE INFOCOM MARCH
  • [5] AMIS AD, 2000, P 20 JOINT C IEEE CO
  • [6] [Anonymous], 2005, P IEEE 19 IEEE INT P
  • [7] [Anonymous], 2005, P IEEE INT C DISTR C
  • [8] [Anonymous], P INT S PAR ARCH ALG
  • [9] [Anonymous], P IEEE ACM WORKSH MO
  • [10] [Anonymous], 2001, P 7 ANN ACM IEEE INT