International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868

Foundation of Computer Science FCS, New York, USA

Volume 5 No.2, January 2013 www.ijais.org

Clustering Protocols in Wireless Sensor Networks:

A Survey

1st Author
Sanjeev Kumar Gupta 2nd Author
Neeraj Jain Poonam Sinha
3rd Author
1st author's
Scope affiliation
College of Engineering 2nd author's
Scope Collegeaffiliation
of Engineering Prof.& Head CS
3rd author's IT, BUIT
affiliation
N.H. 12, Hoshangabad, Road,
1st line of address 12,
N.H.1st lineHoshangabad,
of address Road, 1st line of address
Barkatullah University
2nd line of address 2nd line of address
Bhopal. (INDIA) 2nd line of(INDIA)
Bhopal. address
Bhopal. (INDIA)
1st author's email address 2nd E-mail 3rd E-mail

ABSTRACT cluster head. A cluster head may be pre assigned or elected by

In recent years, the applications of Wireless Sensor Networks the members of the cluster. A cluster head collects the data
(WSNs) have grown enormously. In WSNs there is one from the nodes within cluster and transfer to destination (base
mechanism used to enlarge the lifespan of network and station). The clustering techniques widely perused by
provide more efficient functioning procedures that is researchers increase the lifetime as well as scalability
clustering. Clustering is a process to subdivide the sensing objectives. Many clustering protocols can be use to create
field of sensor network into number of clusters. Each cluster hierarchical structure that reduces the path cost when
selects a leader called cluster head. A cluster head may be communicating with the base station.
elected by the sensor node in the cluster or pre assigned by the
network designer. Optimized Clustering can save lot of
2. CLASSIFICATION OF CLUSTERING
energy in the network. In our paper we have surveyed various PROTOCOLS
clustering protocols for wireless sensor networks and In this section we discuss the set of attributes can be used to
compared on various parameters like cluster count, cluster differentiate clustering protocols for wireless sensor networks
size, cluster density, message count, node deployment, [3, 10].
heterogeneity of nodes, location awareness and cluster head
selection process etc. 2.1 Clustering Method
The two basic approaches for the co-ordination of entire
Keywords clustering process are distributed and centralized. In
Cluster count, cluster size, cluster density, lifetime. distributed clustering, where each sensor node can run their
own algorithm and takes the decision of becoming cluster
1. INTRODUCTION head. In centralized clustering, a centralized authority groups
Recent developments in the areas of Micro Electro the nodes to form clusters and cluster heads. Sometimes
Mechanical Systems (MEMS), wireless communication and hybrid scheme can also be implemented.
low power designs have enabled the small sized battery
operated sensor nodes. A WSN is a set of sensor nodes 2.2 Cluster Properties
deployed in a physical area and connected through wireless In clustering approaches, there are some characteristics for the
links. A sensor node consists of mainly four units that are cluster formation. The following are characteristics that are
sensing, communication, processing and power supply. The related to the internal structure of the cluster.
sensing circuitry measures the different parameters from the
environment like temperature, humidity, pressure etc and 2.2.1 Cluster count
converts them into an electrical signal. Processing of such Cluster count is the number of clusters formed in a round.
signals reveals some properties about the objects or events More number of cluster lead to small size cluster distribution,
happening in the surrounding of sensors. After processing which is better in term of energy consumption. In some
these signals can be transmitted to destination (base station) clustering approaches, the selection of cluster heads are pre
by using radio transmitter either directly or through an assigned from the deployed sensor nodes for fixed clusters or
intermediate gateway. The basic features of a sensor network cluster heads can be selected randomly results in variable
are self organizing capability, dynamic network topology, number of clusters.
limited battery power, short range broadcast communication,
nodes mobility, routing and large scale of deployment. Due to 2.2.2 Cluster size
the capability of self organization and wireless Cluster size is the maximum path length among the member
communication, sensor networks are expected to be used in nodes from cluster head. Small sized cluster is better in term
civil, commercial and military applications such as of energy consumption because it minimizes transmission
surveillance, climate and habitat monitoring, vehicle tracking, distance and load of cluster head. In some clustering
disaster management, medical observation and acoustic data approaches, cluster size is fixed when cluster are fixed
gathering. There are many challenges in wireless sensor throughout the life time, otherwise it is variable for each
networks. The key challenge is to maximize the stability as cluster.
well as lifetime of network. It is not feasible to replace the
batteries of hundreds or thousands of sensor nodes after 2.2.3 Cluster Density
deployment. In sensor network, grouping of sensor nodes into Cluster density is defined as proportion of the number of
a cluster is called clustering. Every cluster has a leader called cluster member in the cluster and cluster area. There is big

41
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

challenge to minimize the energy consumption of cluster 2.4.1 Probability Based

heads in dense clusters. Some of the clustering approach use In probability based clustering algorithms, each sensor node
fixed clustering always has sparse density of cluster, but in uses pre assigned probability to determine the initial cluster
heads.
dynamic clustering approaches cluster density variable.
2.4.2 Non Probability Based
In nonprobability based clustering algorithms more specific
2.2.4 Message count
criteria for cluster head selection and cluster formation are
Message count is the number of message transmission is primarily considered which are mainly based on the sensor
requiring for cluster head selection. More number of message nodes proximity, connectivity and degree etc.
transmission lead to large amount of energy consumption for
cluster head selection procedure. There are many algorithms 2.5 Cluster Formation
which is nonprobabilistic, require the message transmission In cluster formation process the cluster heads will broadcast
for cluster head selection. request packet to the sensor nodes come in radio range to
form cluster. In single hop nodes transmits to the cluster head
directly and in multi hop all sensor node will send their data
2.2.5 Stability
through neighbor node. Fig. 1 summarizes the classification of
If the members of a cluster are not fixed the clustering
different attributes of clustering in wireless sensor networks.
schemes are said to be adaptive. Otherwise we can consider as
fixed because the cluster count are not varied throughout the Centralized
Clustering Distributed
clustering process. The fixed cluster count increases the Method
stability of a sensor network. Hybrid
Fixed
2.2.6 Intra-cluster topology Cluster
Count Variable
It indicates the communication within the cluster as direct or
Fixed
multihop. It may be single hop or multihop from sensor node Cluster
to sensor node or sensor node to cluster head. However this Size
Variable
communication also depends on the sensors range. This Fixed
Cluster
limited range bounded the cluster head count. Density
Cluster Variable
Properties
2.2.7 Inter-cluster head connectivity Yes
Message
It indicates the capabilities of sensor nodes /cluster heads count NO
communication to base station. If the cluster heads are not
having long haul communication capabilities, clustering Fixed
Intra-cluster
schemes has to ensure some intermediate provision of routing topology Adaptive
to base station.
Inter-cluster Direct Link
2.3 Cluster-Head Capabilities connectively
Multi-hop
The capabilities of cluster heads in clustering schemes
Fixed
influence the overall clustering process in terms of stability Stability
and lifetime of sensor network. The following are some Adaptive
Clustering
attributes for differentiating the clustering schemes. Stationary
Mobility Re-Locatable
2.3.1 Node Type
At the time of deployment some of the sensor nodes are pre Variable
assigned as cluster heads on the basis of more energy, Resource-rich
Cluster Head
communication and computation resources. Capabilities Node Types
Sensor
2.3.2 Mobility Relay
The mobility of cluster heads in sensor networks can be Data
Role
assigned on the basis of objectives defined in clustering aggregator
schemes. If the cluster heads are mobile, we can use this to
Sink
make balanced cluster for better network performance. Mobile
cluster heads can also be relocatable if there is any need in the Probability Pure Probability
sensor network. Base Weighted
Cluster Probability
Head
2.3.3 Role Selection Neighbors
The role of cluster heads in the sensor networks can act as a Non Distance
relay for the information generated by the cluster members or Probability
perform the task of aggregation or fusion of data. Base Position
Location
2.4 Cluster Head Selection Cluster Single hop
Cluster heads can be pre-assigned or picked randomly from Formation
the deployed set of nodes [3]. Multi hop

Figure. 1 Classification of the different attributes of

clustering in WSNs.

42
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

3. CLUSTERING ALGORITHMS AND In this protocol the selection of cluster heads is random and
the cluster head number is limited. The base station sure those
PROTOCOLS FOR WSN nodes have less energy than it cannot become a cluster head.
There are several different ways to distinguish and classify the This protocol is not suitable for large scale network because
clustering algorithms used in WSN. Most of the known there is a problem to send the status of a node which are far
clustering algorithms for WSNs can be distinguished on the from the base station. The cluster head role rotates every time
basis of cluster head selection process. so it is not feasible to send information every time in a quick
time. It increases the latency and delay.
3.1. Probabilistic (random or weighted) clustering
algorithms A Stale Election Protocol for Clustered Heterogeneous
In the category of probabilistic selection clustering algorithm Wireless Sensor Networks (SEP)
a priori probability assigned to each sensor node is used to Georgios S. et al. [4] introduces the heterogeneity that
determine the initial cluster heads or other type random prolongs the time interval before the death of first node called
selection procedure [36].The probabilities initially assigned to stability period. This protocol is based on the weighted
each node often serve as the primary criterion in order to election probabilities of each node to become cluster head
decide individually on their election as cluster heads. according to the remaining energy in each node. In this there
However other secondary criteria may also be considered are two types of nodes was considered as normal and
either during cluster head election process i.e. the residual advanced. This protocol does not require global knowledge of
energy, initial energy, average network energy etc. Beyond energy at every round to select cluster heads. Authors
the high energy efficiency, the clustering algorithms of this extended the LEACH protocol except the heterogeneity
category usually achieve faster execution or convergence awareness. Cluster count is variable in this algorithm and also
times and reduced volume of exchanged messages. unstable period is not good.

3.2. Non probabilistic clustering algorithms Hybrid Energy-Efficient Distributed Clustering

In the category of nonprobabilistic clustering algorithms, (HEED)
more specific criteria for cluster head election and cluster O. Younis et al. [5] improves the LEACH protocol by using
formation are primarily considered. They are mainly based on residual energy, node degree or density as a main parameters
the sensor nodes proximity, connectivity, position, location for cluster formation to achieve power balancing. This
and degree etc. They are also depends on the information protocol was proposed with three main parameters: First
received from other closely located nodes. This type of parameter is to enhance network lifetime by distributing
algorithms generally requires more exchanges of messages energy consumption, second clustering terminates within a
and probably graphs traversing in some extent, thus leading fixed number of iterations third minimum control over head
sometimes to worse time complexity than probabilistic or and fourth the cluster heads was well distributed. The
random clustering algorithms. One the contrary, these algorithms proposed in this protocol periodically selects
algorithms are usually more reliable toward the direction of cluster heads based on the two basic parameters. The first
extracting robust and well-balanced clusters. In addition to primary parameter is the residual energy of each node; second
node proximity, some algorithms also use a combination of parameter is the intra-cluster communication cast as a
metrics such as the remaining energy transmission power, and function of cluster density or node degree. The primary
mobility (forming corresponding combined weights) to parameter selects initial set of cluster heads probabilistically
achieve more generalized goals than single-criterion which secondary parameter is breaking ties. HEED is not able
protocols. to fix the cluster count in each round and it is also not aware
of heterogeneity.
3.3. Popular Probabilistic Clustering Protocols
Energy-Efficient Communication Protocol for Wireless Distributed Energy Efficient Hierarchical Clustering
Micro sensor Network (LEACH) for Wireless Sensor Network (DWEHC)
W. B. Heinzelman et al. [1] proposed first well known P Ding et al. [6] proposed a distributed weight based energy
clustering protocol LEACH for wireless sensor networks. In efficient hierarchical clustering protocol which aims at high
this sensors are organized into clusters and randomly select a energy efficiency by generating balanced cluster sizes and
few nodes as cluster head with a certain probability of optimizing the intra cluster topology. Each sensor node
becoming a cluster heads per round. The task of being a calculates its weight after finding the neighboring nodes in its
cluster head is rotated between nodes. The rotation role area. The weight is a function of the sensors residual energy
balances the energy dissipation of the nodes in the networks. and the proximity to the neighbors. In a neighborhood, the
LEACH is a distributed algorithm but cluster count (cluster node with largest weight would be elected as a cluster head
head) is not fixed in each round per epoch. Due to distributed and the remaining nodes become members. At this stage the
algorithm each node is capable to select itself as a cluster head nodes are considered as first level members because they have
by choosing random number. There is possibility that each a direct link to the cluster head. A node progressively adjusts
node choose same number for cluster head selection, due to such membership to reach a cluster head using the least
randomness property of random number generator. So cluster amount of energy. Basically, a node checks with its non-CH
head count is varying in each round. neighbors to find out their minimal cost for reaching a cluster
head. Given the nodes knowledge of the distance to its
An application-specific protocol architecture for neighbors, it can reach the cluster head over a two-hop path.
wireless microsensor networks (LEACH-C) The protocol is not performing well in term of stability period
W. B. Heinzelman et al. [2] this protocol uses a centralized due to huge amount of energy consumed in neighbors finding.
approach where the information of node location and energy
level was communicated to base station. The base station
decides about the cluster head selection and cluster formation.

43
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

Distributed Energy Efficient Clustering Algorithm for An Improved LEACH protocol for application specific
Heterogeneous Wireless Sensor Networks (DEEC) wireless sensor network (Improved LEACH)
Li Qing et al. [8] proposed a distributed multilevel clustering Chong Wang et al. [17] suggested a protocol to save energy
algorithm for heterogeneous WSN. In DEEC the cluster heads cost induced due to redundant nodes and balancing the energy
are selected by a probability based on the ratio between consumption among sensor nodes by splitting large cluster
residual energy of each node and the average energy of the into smaller ones. According to author large clusters are split
network. The approach of being cluster heads for nodes are into smaller ones using the mechanism sub cluster head. By
different according to their initial and residual energy. The using this, the data frame will be smaller, thus the number of
authors have assumed that all the nodes of the sensor network frame received by BS will be increasing during the same time.
are equipped with different amount of energy. Two levels of Another make improvement in redundant nodes keeps asleep
heterogeneous nodes are considered in the algorithm and after for most of time. In other words, only one node of them is
that a general solution for multi-level heterogeneity is needed which the others can keep asleep until the first one
obtained. To avoid that each node needs to know the global exhaust with the energy. In such a way the network lifetime is
knowledge of the networks, DEEC estimates the ideal value extended. The proposed protocol leads to unequal sized
of network life-time, which is used to compute the reference cluster due to variable cluster count.
energy that each node should expend during a round. Cluster
count is variable in this approach lead to uneven clusters. Energy Efficient Heterogeneous Clustered Scheme for
Wireless Sensor Networks (EEHC)
Distributed Energy Balance Clustering Protocol for D. Kumar et al. [18] proposed a distributed cluster head
Heterogeneous Wireless Sensor Networks (DEBC) election scheme for heterogeneous WSNs. The election of
Changmin D et al. [9] proposed a protocol for heterogeneous cluster heads is based on different weighted probability. The
wireless sensor network. The selection of cluster heads clusters member nodes communicate with the elected cluster
depends on the probability based on radio between residual head and then cluster heads communicate the aggregated
energy of node to the average energy of network. The high information to the base station. The authors have considered
initial and residual energy nodes have more chances to three types of nodes. Authors have proposed the different
become cluster heads then the nodes have low energy. This threshold for each type of nodes. This guarantees that each
protocol improves the LEACH and SEP protocol by type of node become cluster head according to their weighted
considering two level heterogeneity and extends up to probability. The proposed protocol leads to unequal sized
multihop heterogeneity. cluster due to variable cluster count.

An unequal cluster-based routing protocol in wireless Stochastic Distributed Energy Efficient Clustering for
sensor networks (UCR) Heterogeneous Wireless Sensor Networks (SDEEC)
Guihai chen. et al. [11] proposed a protocol for mitigating the B. Elbhiri et al. [19] extended the DEEC protocol as the
hot spot problem in WSNs. It is designed for source driven stochastic strategy is the key idea where the number of
sensor network applications, such as detection of periodical transmission intra clusters is reduced. This strategy is used
data from environment. It is a self organized competition when the objective is to collect the maximum or minimum
based algorithm, where selection of cluster heads based on data values like temperature, humidity etc in a region of the
local information as residual energy of neighboring nodes. network. Thus the cluster head selects pertinent information
The cluster heads closer to base station are expected to have between those received and send it to the base station. In this
smaller cluster sizes, than those for their from the base station, case, if the clusters head receives only from nodes with
thus the cluster heads will consume lower energy during the significant information and the others node must be in sleep
intra cluster data processing and can presume some more mode. It is an application specific protocol.
energy for the inter cluster relay traffic. The protocol is
accomplish the cluster head selection procedure in two phase, Stochastic and Balanced Distributed Energy Efficient
which is time consuming and cluster size is uneven due to Clustering (SBDEEC)
variable cluster count. Elbhiri Brahim et al. [20] proposed a protocol that permits to
balance the cluster head selection overall network nodes
Cluster-based Service Discovery for Heterogeneous following their residual energy. So, the advanced nodes are
Wireless Sensor Networks (C4SD) largely solicited to be selected as cluster heads for the first
R.S. Marin et al. [12] developed a protocol (C4SD) for transmission rounds, and when their energy decreases
heterogeneous WSNs that rely on a clustering structure that
sensibly, these nodes will have the same cluster head selection
offers distributed storage of service descriptions. In this
protocol, each node is assigned a unique hardware identifier probability like the normal nodes. The other key idea in of this
and weight. If any node has higher capability must be selected protocol is to better reduce the intra clusters transmission
for cluster head role. These nodes act as a distributed when the objective is to collect the maximum or minimum
directory of service registrations for the nodes in the cluster. data values in a region like temperature humidity etc.
The basic structure ensures low construction and maintenance
overhead, reacts rapidly to topological changes of the sensor Distributed Cluster Head Election Scheme for
network by making decisions based only on the 1-hop Improving Lifetime of Heterogeneous Sensor Network
neighborhood information and avoids the chain reaction and Applications (DCHE)
problems. A service lookup results in visiting only the Dilip Kumar et al. [21] proposed a distributed cluster head
directory nodes, which ensures a low discovery cost. election scheme for heterogeneous WSNs. The election of
cluster heads is based on different weighted probability. The
clusters member nodes communicate with the elected cluster
head and then cluster heads communicate the aggregated

44
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

information to the base station. Authors have considered three suffering from the cluster head selection problem due to low
different types of nodes and all have different threshold. The residual energy. Any cluster that has the problem of cluster
weight assigned to each node will decide the selection of head selection send a message for mobile node in the nearly
cluster head for each type. Simulation results show that the area. Any nearest mobile node of maximum energy will be
DCHE scheme offers a better performance in terms of lifetime activated and move to that reignited cluster. In that way we
can use the energy in a balanced way through the network and
and stability than LEACH, DEEC and Direct Transmission.
increase the lifetime of the sensor network.

Energy Efficient Scheme for Clustering Protocol Improved and Balanced LEACH for Heterogeneous
Prolonging Lifetime of Heterogeneous Wireless Sensor Wireless Sensor Networks (IBLEACH)
Networks (TDEEC) Ben Alla Said et al. [27] proposed an improved and balanced
Parul Saini et al. [22] proposed an energy efficient cluster LEACH which is a self-organizing, adaptive clustering
head election scheme for heterogeneous WSNs. The author protocol that uses randomization to distribute the energy load
have adjusted the value of the threshold, according to which a evenly among the sensors in the network. In the scheme, some
node decide to become a cluster head or not, based on the high energy nodes called NCG nodes (normal node/cluster
ratio of residual energy and average energy of that round in head/gateway) become cluster heads to aggregate the data to
respect to the optimum number of cluster heads. Two level their cluster members and transmit it to the chosen gateways
and three levels of heterogeneous nodes are considered in the that requires the minimum communication energy to reduce
algorithm and after that a general solution for multilevel the energy consumption of cluster head and decrease
heterogeneity is proposed. It requires the average network probability of failure nodes.
energy for cluster head selection, which is more energy
consumable. Energy Consumption and Lifetime analysis in
Clustered Multi-hop Wireless Sensor Networks Using
Developed Distributed Energy-Efficient Clustering for the Probabilistic Cluster-Head Selection Method
Heterogeneous Wireless Sensor Networks (DDEEC) (ECLCM)
Elbhri et al. [23] proposed a developed distributed energy J. Choi et al. [30] developed an energy model to estimate the
efficient clustering scheme for heterogeneous WSNs. DDEEC energy consumed in a multihop WSN clustered with
is based on DEEC scheme, where all nodes use the initial and probabilistic cluster head selection. Each sensor node selects
residual energy level to define the cluster heads. In this itself as a cluster-head with a predefined probability without
protocol each node needs to have the global knowledge of the any information exchange with other nodes. Each cluster-head
networks, DDEEC like DEEC estimate the ideal value of advertises itself as a cluster-head to other nodes within its
network lifetime, which is used to compute the reference radio range. Each node receives advertisements during a
energy that each node should expend during each round. In certain period from the arrival of the first received
this scheme, the network is organized into a clustering advertisement, and then chooses a cluster-head with the
hierarchy, and the cluster heads collect measurements smallest number of hops from it and advertises its cluster-
information from cluster nodes and transmit the aggregated head to other nodes within its radio range. If cluster heads
data to the base station directly. Moreover, the authors have with the smallest number of hops from a sensor node are more
supposed that the network topology is fixed and no-varying than two, then the node randomly selects one of them. This
on time. The difference between DDEEC and DEEC is repeats until each node selects its cluster-head or become a
localized in the expressions which define the probability to be cluster-head. All nodes communicate according to TDMA
a cluster head for normal and advanced nodes. schedules organized by the cluster-heads or the sink node.
Thus, data collision can be prevented. The proposed protocol
An Energy Efficient Clustering Scheme for Self- leads to unequal sized cluster due to variable cluster count.
Organizing Distributed Wireless Sensor Networks Multi hopping lead to network holes near to base station.
(EECS)
Kyung Tae Kim et al. [25] developed an energy efficient Weighted Election Protocol for Heterogeneous
clustering scheme based on the concept of weighted Wireless Sensor Networks (WEP)
probability function for the election of cluster head. In this Md. G. Rashed et al. [31] developed an energy efficient
probability function three parameters are considered. The first protocol (WEP) to enhance the stability period of sensor
parameter is the energy possession rate which is the initial network. Author introduces a clustering scheme with a chain
energy Vs current energy. The second one is the individual routing algorithm to enhance the energy and stable period
round which is the time, it takes for the cluster head to be constraints. In this a weight is assigned to the optimal
selected and the cluster head aggregate the received data from probability for each node. This weight must be equal to the
the member nodes and then transmit the fused information to ratio between initial energy of each node to the initial energy
the base station. Third one is the count that the node had been of the normal node. After assigning weighted probability, the
selected as the cluster head. It mitigates the problem of the cluster heads and cluster number are selected in the same way
decrease in remaining energy of the node as time process by as in LEACH protocol. By using the algorithm a chain among
using the above parameters. The proposed protocol take more the selected cluster heads have been constructed. After this
time for clustering and unequal sized clusters is formed in from the selected cluster heads, a chain leader is selected
sensing area. randomly. All non cluster head nodes send their data to their
respective cluster head nodes. The cluster head nodes in each
Mobile Nodes Based Clustering Protocol for Life Time cluster then fused the data and send it to base station.
Optimization in Wireless Sensor Network: (MNCP)
Babar Nazir et al. [26] proposed an algorithm that uses mobile
nodes to fill the gap formed by any energy hole or hot spot.
The mobile nodes can move any where if any cluster is

45
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

Energy Efficient Cluster Based Data Aggregation for that to construct a network topology based on the node density
Wireless Sensor Networks (ECBDA) in different regions of the overall area covered by the
Siva R. et al. [33] propose a data aggregation method to network. This will avoid bottleneck problem and may result in
enhance the network lifetime. In ECBDA cluster formation long life of the network by proper load balancing. The
phase is used to split the network into set of cluster. K clusters proposed protocol degrades the energy of long distance sensor
are formed in each layer then each layer is divided into a set nodes early than nearer sensor nodes.
of clusters. In Cluster Head election process, one node is
selected as cluster head from each cluster by using its residual A probability Driven Unequal Clustering Mechanism
energy and the communication cost factor. Once a node is for WSNs (PRODUCE)
elected as a cluster head, it broadcasts the cluster head Jung-Hwan et al. [14] proposed a distributed and randomized
message to its cluster members, other cluster heads and base clustering algorithm that organizes the network with unequal
station. Data forwarding is performed in the third phase. In the sized clustering. It determined with localized probabilities and
Data aggregation phase, all cluster members send its sensed multihop routing based on stochastic geometry. In this
data during its allotted time slot. The cluster head waits until algorithm, distance clusters which are far from the BS have
its TDMA frame ends. After receiving its data from its entire larger cluster sizes and closer cluster have smaller cluster
cluster member, cluster head starts the aggregation process. sizes. For the selection of cluster head in cluster a different
Each cluster head eliminates the duplicates and forwards the probability assigned on each level. The proposed protocol
packet to BS via the forwarding nodes. Maintenance phase leads to unequal sized cluster due to variable cluster count.
checks the cluster heads residual energy at each round. If the
residual energy is less than the required threshold value, a Energy and Distance Based Clustering: An Energy
new cluster head is elected from the same cluster. Re- Efficient Clustering Method for WSN (EDBC)
clustering is also performed in the maintenance phase. The Mehdi Saeidmanesh et al. [15] proposed a protocol which
proposed protocol leads to small sized cluster which lead to considers the residual energy and distance from the base
more amount of data transfer form cluster head to base station station of each node in the cluster head selection process. If all
it is energy consumable. sensor nodes are distributed in large area some clusters are far
from the base station and others are close to base station. This
A Density Control Energy Balanced Clustering can lead a great difference in transmission energy dissipations
Technique for Randomly Deployed Wireless Sensor that the nodes use transmits data to base station. In this author
Network (DCEBC) has divided the whole of the network terrain into concentric
Sanjeev Kumar Gupta et al. [34] developed a protocol to circular segments around the base station. The number of
enhance the life time of heterogeneous wireless sensor cluster heads in each segment is different from the other
networks. In this paper authors select cluster heads based on segments in terms of distance from the base station. The
probability threshold and current energy level. Authors also cluster head election probability in closer segments is more
work on redundant node identification and deactivation. than distant segments and the number of cluster heads in these
DCEBC achieves longer lifetime and stability period. segments is more.

3.4. Popular Non Probabilistic Clustering Protocols Distributed Clustering Algorithms with Load
Designing Efficient Routing Protocol for Balancing in Wireless Sensor Network (DCLB)
Heterogeneous Sensor Network (HSR) Farruh Ishmanov et al. [16] evaluated distributed clustering
Xiaojiang Du et al. [7] Considers heterogeneous sensor with load balancing for forming cluster efficiently and
networks by deploying a small number of powerful high end balancing load in inter cluster communication cluster. Size
sensors with large number of low end sensors. In this each (range) is important in terms of energy efficiency and
sensor node is static and aware of its own location. As both balancing load in multi hop communication of cluster heads.
types of sensors are uniformly and randomly distributed in the Since it determine data volume in every step of clustering to
network. In cluster formation process nodes select the cluster avoid energy inefficiency and balanced load of cluster. It
heads based on the signal strength. The cluster heads send the forms cluster with different sizes in each step. The proposed
data to the sink via multi hop transmission over cluster heads. protocol leads to unequal sized cluster due to variable cluster
The proposed approach is static which will not suitable for count.
many applications.
A Density and Distance Based Cluster Head Selection
Traffic Based Clustering in Wireless Sensor Network Algorithms in Sensor Networks (DDCHS)
(TBC) Kyounghwa Lee et al. [24] proposed an algorithm to elect the
Vijay Kr. Chaurasiya et al. [13] proposed an approach to cluster head based on density and distance of sensor nodes in
create a system which will adopt a topology (size of cluster the sensor network. In this the cluster area is divided into two
and number of hierarchal level) in accordance with the traffic perpendicular diameters to get four quadrant, then in each
patterns and density of sensor nodes deployed in a given area quadrant, select following cluster head by groups node
of interest. In multi hopped network load on the cluster head density and distance from the cluster head. Author have
near the base station will be more as compared to farther compared with LEACH and HEED protocols by calculating
cluster heads as the proximity cluster head have to do the dual the energy consumption for communication of once between
work of collecting data from its own cluster and also to whole nodes and cluster head by position of cluster. This
forward data from distant cluster heads. Therefore this protocol shows better performance than LEACH and HEED.
situation may result in dying out of nearest cluster heads It is centralized approach and need location of each node.
sooner than distant cluster heads. It will result in failure of
sensor network as a whole. Therefore, authors have suggested

46
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

An Energy Efficient Clustering Scheme with Self- consumption of sensor nodes for various tasks performed by
organized ID Assignment for Wireless Sensor them during the lifetime of sensor network. This ensures
Networks (EECSIA) balanced energy consumption of all sensor nodes present in a
Qingehao Zheng et al. [28] proposed a distributed clustering cluster, resulting in prolonged network lifetime. The proposed
scheme that considers both energy and topological features of protocol is static in nature, cluster head selection procedure is
a WSN. EESCIA enables an efficient solution to handling not well in term of energy consumption. Load balancing is
large-scale networks in assigning unique IDs to sensor nodes, unevenly distributed, so all these lead to poor stability period.
reducing communication expenses and extending the network
lifetime. EECSIA is fast and locally scalable, and it achieves a Node degree based clustering for WSN.
good distribution of cluster heads within the networks. Sanjeev Kumar Gupta et al. [35] propose Node Degree Based
Further-more, as nodes are energy constrained, frequently Clustering (NDBC) for enhancing life time of heterogeneous
receiving data from common nodes and forwarding them to WSNs. In this paper, authors use two types of sensor nodes,
base station will consume a large amount of energy on cluster i.e., advanced and normal nodes. Advance nodes are having
heads. EECSIA has avoided this problem, and it can achieve more energy than normal nodes. The advanced nodes are
re-clustering within constant time in a local manner. Message selected as cluster head based on its energy and node degree
communication is very large for cluster head selection which in the network. Using NDBC authors have reduced
is more energy consumable. communication cost among sensor nodes used for transmitting
and receiving the messages for cluster head selection.
Fault Tolerant Energy Efficient Distributed Clustering
for WSN (FEED)M. Mehrani et al. [29] proposed an 4. CONCLUSION
energy efficient clustering method, which select suitable
Clustering is a technique to reduce energy consumption and to
cluster heads by using energy, density, centrality and the
provide stability in wireless sensor networks. For
distance between nodes for making cluster. Authors have
heterogeneous wireless sensor networks, several clustering
taken a supervisor node for every cluster head which is to be
protocols are proposed. Most of the recent energy efficient
its replacement when the cluster head fails. This property
clustering protocols designed for sensor networks are based
causes an increase in network lifetime and also helps the
on residual energy, average energy, location, density etc.
network to be fault tolerant. It requires the global position of
which are effective in energy saving. We surveyed energy
sensor nodes and message communication is very large in
efficient clustering protocols based on cluster head selection
cluster head selection, which is costly and energy consumable
techniques, i.e. probability based and nonprobability based.
respectively.
We observe that many probabilistic clustering approach lead
to variable cluster count and variable cluster size. In this type
A location Based Clustering Algorithm for Wireless of clustering approaches network hole is created. In the
Sensor Networks (LBS) nonprobability clustering approach cluster count and cluster
Ashok Kumar et al. [32] proposed a protocol to prolong the size is optimum but it require more number of message
lifetime of sensor network. The clusters are formed only once transmission for cluster head selection, which is very energy
during the lifetime of sensor network. Cluster heads rotation consumable. Table 1 shows the comparison between various
depends on the residual energy of a cluster heads. The rotation clustering protocols used in wireless sensor networks.
frequency timing of cluster head is based on energy

Table 1. Comparison of the Clustering Protocols for Wireless Sensor Networks

Non CH Selection
Clustering Properties
Distributed (D)/ Centralized (C) /Hybrid (H)

based On
Node Deployment Uniform / Random

Location Awareness (Y/N)

Cluster Head Mobility
Fixed (F)/ Mobile (M)
Clustering Approach

Heterogeneity Level

Clustering Method

Proba

Proba
Based

Based
bility

bility
Heterogeneity
(Y/N)

Variable (V) /Fixed (F)

Variable (V) /Fixed (F)
Variable (V) /Fixed (F)

Pure Probability (Y/N)

Intra-cluster Topology

Connectivity of CH to

Probability(Y/N)
Neighbor (Y/N)
Yes (Y) /NO (N)

Location (Y/N)
Cluster Density

Message Count

Distance (Y/N)
Cluster Count

Cluster Size

Weighted
BS

Single Direct - - - -
LEACH [1] Random N - D N F V V V N Y
Hop Link
Single Direct - - - -
LEACH-C [2] Random N - C N F V V V N Y
Hop Link

47
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

Single Direct Y - - -
SEP [4] Random Y Two D N F V V V N -
Hop Link
Single Direct - - - -
HEED [5] Random N - D N F V V V N Y
Hop Link
Single Direct Y - - -
DWEHC [6] Random N - D N F V V V N -
Hop link
Multi Multi - - Y -
HSR [7] Random Y Two D Y F V V V Y -
Hop Hop
Two/ Single Direct Y - - -
DEEC [8] Random Y D N F V V V N -
Multi Hop Link
Two/ Single Direct Y - - -
DEBC [9] Random Y D N F V V V N -
Multi Hop Link
Single Multi Y - - -
UCR [11] Random N - D N F V V V N Y
Hop Hop
Multi Multi Y - - -
C4SD [12] Random Y Multi D Y M V V V N -
Hop Hop
Multi Multi - Y Y
TBC [13] Random N - D Y F V V V Y -
Hop Hop
PRODUCE Single Direct - - Y -
Random N - D Y F V V V Y -
[14] Hop Link
Single Direct - - Y -
EDBC [15] Random N - D Y F V V V Y -
Hop Link
Single Multi - Y - Y
DCLB [16] Random N - C Y F V V V Y -
hop Hop
Improved Single Direct - - - -
Random N - D N F V V V N Y
LEACH [17] Hop Link
Single Direct Y - - -
EEHC [18] Random Y Three D N F V V V N -
Hop Link
Single Direct Y - - -
SDEEC [19] Random Y Two D N F V V V N -
hop Link
Single Direct Y - - -
SBDEEC [20] Random Y Two D N F V V V N -
Hop Link
Single Direct Y - - -
DCHE [21] Uniform Y Three D N F V V F N -
Hop Link
Two/ Single Direct Y - - -
TDEEC [22] Random Y D N F V V V N -
Multi Hop Link
Single Direct Y - - -
DDEEC [23] Random Y Two D N F V V V N -
Hop Link
Single Direct
DDCHS [24] Random N - D Y F V V V Y Hop Link
- - Y Y -
Single Direct Y - - -
EECS [25] Random N - D N F V V V N -
Hop Link
Single Direct Y - - -
MNCP [26] Random N - D N M V V V N -
Hop Link
IB-LEACH Single Direct - - -
Random N - D N F V V V N Y
[27] hop Link
Single Direct - Y - -
EECSIA [28] Random N - D N F V V V Y -
Hop Link
Single Direct - Y - -
FEED [29] Random N - D N F V V V Y -
Hop Link
Multi Multi - - - -
ECLCM [30] Random N - D N F V V V N Y
Hop Hop
Single Direct Y - - -
WEP [31] Random Y Two D N F V V V N -
Hop Link
Single Direct Y - - Y
LBC [32] Random N - C Y F F F V Y -
Hop Link
Single Multi Y - - -
ECBDA [33] Random N - H N F V V V N -
Hop Hop
Single Single Y Y - -
DCEBC [34] Random Y Two D N F V V V N -
Hop Hop
Multi Single - Y - -
NDBC [35] Random Y Two D N F F V V Y Hop Hop
-

48
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

5. REFERENCES [16] Farruh Ishmanov and Sung Won Kim,2009. Distributed

[1] W. Rabiner Heinzelman and H. Balakrishnan, 2000. Clustering Algorithm with Load Balancing in Wireless
Energy-Efficient communication Protocol for Wireless Sensor Network, IEEE World Congress on Computer
microsensor networks, IEEE, Proceeding of the 3rd Science and Information Engineening.
Hawali International Conference on System Science. [17] Chong Wang and Jiakang Liu, 2009. An Improved
[2] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, LEACH Protocol for Application Specific Wireless
2002. An application specific protocol architecture for Sensor Networks, IEEE: WiCOM 09 Proceedings of the
wireless microsensor networks, IEEE Transactions on 5th International Conference on Wireless Communication
Wireless Communications. Networking and Mobile Computing.

[3] I.F. Akyildiz et al. 2002. Wireless sensor networks: a [18] D. Kumar, 2009. Energy Efficient Heterogeneous
survey, Computer Network. Clustered Scheme for Wireless Sensor Networks, In
Elsevier Computer Communications.
[4] Georgios Smaragdakis and Ibrahim Matta, 2004. SEP: A
Stable Election Protocol for Clustered Heterogeneous [19] B. Elbhiri and R. Saadane, 2009. Stochastic Distributed
Wireless Sensor Networks. Energy-Efficent Clustering (SDEEC) for heterogeneous
wireless sensor networks.
[5] O. Younis, S. Fahmy, 2004. HEED: A Hybrid, Energy-
Efficient, Distributed clustering approach for Ad Hoc [20] Elbhiri Brahim and Saadane Rachid,2009. Stochastic and
sensor networks, IEEE Transactions on Mobile Balanced Distributed Energy-Efficient Clustering
Computing. (SBDEEC) for heterogeneous wireless sensor networks,
Signal Processing and communications group UPC.
[6] P. Ding, J. Holliday, 2005. A. Celik, Distributed energy
efficient hierarchical clustering for wireless sensor [21] Dilip Kumar and Trilok C.,2010. Distributed Cluster
networks, In: Proceedings of the IEEE International Head Election (DCHE) Scheme for Improving Lifetime
Conference on Distributed Computing in Sensor Systems of Heterogeneous Sensor Networks, Tamkang Journal of
(DCOSS05). Science and Engineering.

[7] Xiaojiang Du and Fenging Lin, 2005. Designing [22] Parul Saini, Ajay K Sharma, 2010. Energy Efficient
Efficient Routing Protocol for Heterogeneous Sensor Scheme for Clustering Protocol Prolonging the Lifetime
Network, IEEE, Performance, Computing and of Heterogeneous Wireless Sensor Networks,
Communication conference. International Journal of Computer Applications.

[8] L. Qing, Q. Zhu, M. Wang, 2006. Design of a distributed [23] Elbhiri B. and R. Saadane, 2010. Developed Distributed
energy-efficient clustering algorithm for heterogeneous Energy-Efficient Clustering (DDEEC) for heterogeneous
wireless sensor networks, In ELSEVIER, Computer wireless sensor networks, In IEEE I/V Communications
Communications. and Mobile Network (ISVC).

[9] Changmin Duan, 2007. A Distributed Energy Balance [24] Kyounghwa Lee and Hyeopgeon Lee, 2010. A Density
Clustering Protocol for Heterogeneous Wireless Sensor and Distance based Cluster Head Selection Algorithm in
Networks, IEEE WiCon, Sensor Networks, IEEE, ICACT.

[10] A.A. Abbasi and M. Younis, 2007. A survey on [25] Kyung Tae Kim and Han Ku Yoo, 2010. EECS: An
clustering algorithms for wireless sensor network, Energy Efficient Cluster Scheme In Wireless Sensor
Computer Communication. Networks, IEEE International Conference on Computer
and Information Technology.
[11] Guihai Chen Chengfa Li, 2007. An unequal cluster-
based routing protocol in wireless sensor networks, [26] Babar Nazir and Halabi Hasbullah, 2010. Mobile Nodes
Springer Science Business Media, LLC. based Clustering Protocol for Lifetime Optimization in
Wireless Sensor Network, In: International Conference
[12] R.S. Marin-Perianu and J. Scholten, 2007. Cluster-based on Intelligent and Information Technology.
service discovery for heterogeneous wireless sensor
networks, International Journal of Parallel, Emergent [27] Ben Alla Said and EZZATI Abdellah, 2010. Improved
and Distributed Systems. and Balanced LEACH for Heterogeneous Wireless
Sensor Networks.
[13] Vijay Kr. Chaurasiya and S. Rahul Kumar, 2008. Traffic
Based Clustering in Wireless Sensor Network, IEEE [28] Qingchao Zheng, 2010. An Energy Efficient Clustering
WCSN. Scheme with Self-Organized ID Assignment for Wireless
Sensor Networks, Parallel and Distributed Systems
[14] Jung-Hwan Kim and Chauhdary Sajjad Hussain, 2008. (ICPADS), 2010 IEEE 16th International Conference.
PRODUCE: A Probability-Driven Unequal Clustering
Mechanism for Wireless Sensor Networks, IEEE, 22nd [29] Mehrani, M., 2010. FEED: Fault tolerant, energy
International Conference on Advanced Information efficient, distributed Clustering for WSN, IEEE,
Networking and Applications Workshops, WAINA. Advanced Communication Technology (ICACT).

[15] Mehdi Saeidmanesh and Mojtaba Hajimohammadi, [30] Jinchul Choi and Chaewoo Lee, 2011. Energy
2009. Energy and Distance Based Clustering: An Energy consumption and lifetime analysis in clustered multi-hop
Efficient Clustering Method for Wireless Sensor wireless sensor networks using the probabilistic cluster-
Networks, World Academy of Science, Engineering and head selection method, EURASIP Journal on Wireless
Technology. Communications and Networking.

49
 International Journal of Applied Information Systems (IJAIS) ISSN : 2249-0868
Foundation of Computer Science FCS, New York, USA
Volume 5 No.2, January 2013 www.ijais.org

[31] Md. Golam Rashed and M. Hasnat Kabir, 2011. WEP: an [34] Sanjeev Kumar Gupta, Neeraj Jain and Poonam Sinha,
Energy Efficient Protocol for Cluster Based 2012. A Density Control Energy Balanced Clustering
Heterogeneous Wireless Sensor Networ, International Technique for Randomly Deployed Wireless Sensor
Journal of Distributed and Parallel Systems (IJDPS). Network, IEEE WOCN 2012 Conference.
[32] Ashok Kumar and Narottam Chand, 2011. Location [35] Sanjeev Kumar Gupta, Neeraj Jain and Poonam Sinha,
Based Clustering in Wireless Sensor Network, World 2012. Node Degree Based Clustering for WSN,
Academy of Science, Engineering and Technology. International Journal of Computer Applications (IJCA).

[33] Siva Ranjani. S and Radha Krishnan.S, 2012. Energy- [36] Yan Zhang, Laurence T. Yang & Jiming Chen, 2010,
Efficient Cluster Based Data Aggregation for Wireless RFID and Sensor Networks, auerbach publication,
Sensor Networks, IEEE Recent Advances in Computing International Standard Book Number:978-1-4200-7777-3
and Software Systems (RACSS).

50