Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network

  • Tripathy A
  • Chinara S
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.

Cite

CITATION STYLE

APA

Tripathy, A. K., & Chinara, S. (2012). Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network. ISRN Sensor Networks, 2012, 1–10. https://doi.org/10.5402/2012/375026

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free