ISSN ONLINE(2320-9801) PRINT (2320-9798)

All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.

Cluster Head Selection Algorithm to Minimize Energy Consumption in Wireless Sensor Network

Meghashree Kamath1, Nandini Maninarayana2
  1. M. Tech Student, Dept of Electronics & Communication, St. Joseph Engineering College, Mangalore, India
  2. Assistant Professor, Dept of Electronics & Communication, St. Joseph Engineering College, Mangalore, India
Related article at Pubmed, Scholar Google

Visit for more related articles at International Journal of Innovative Research in Computer and Communication Engineering


To prolong the lifetime of Wireless Sensor Networks (WSNs), design of energy-efficient algorithms has become an important factor. Sensor nodes are limited strongly in terms of energy since their batteries cannot be usually recharged. Energy is consumed during sensing, data processing, and communication. Hence, there is a necessity for energy-conserving protocols for WSNs. In this paper, an improved version of LEACH protocol [1], is compared with LEACH protocol [2], with respect to the energy consumed by each of them. The improved version of LEACH protocol takes into consideration the residual energy at each node, distance between a node and the Base Station (BS) and the number of successive rounds in which a node has not been a CH, as parameters for threshold calculation [1] during CH selection. From simulation results, it is seen that the improved version of LEACH protocol [1] could minimize energy consumption and thus, lengthen network lifetime.



LEACH, energy-efficiency, EECHS, wireless sensor networks


Wireless Sensor Network (WSN) is a wireless network that has spatially distributed sensor devices to sense various
environmental conditions and accumulate the sensed data at a central location, such as a Base Station (BS). Since
energy is an important factor in WSN design, a number of routing protocols have been proposed, that aim to achieve
minimum energy consumption and hence, maximize network lifetime,. Generally, data aggregation and hierarchy are
used in WSNs to reduce energy consumption [3].
LEACH [2] is a hierarchical based routing protocol for WSNs. One of the drawbacks of LEACH is the random
election of CHs leading to imbalance in the energy level of the sensor nodes [1]. In EECHS [1], the CHs are chosen
considering the factor of residual energy at each node, distance of the node from the BS and the number of consecutive
rounds in which the node has not been a CH. Thus, EECHS algorithm improves the CH selection strategy and
minimizes energy consumption in the network as shown by simulation results.


Routing protocols for WSNs are classified based on network structure as flat, hierarchical and location-based. In
particular, hierarchical routing is an efficient way of reducing energy consumption by means of data aggregation and
data fusion, which minimizes the number of messages transmitted to the BS. Hierarchical routing is divided into two
levels: One is used to select the CHs and the other one is used for routing in particular. Hence, cluster formations and
special task assignments to CHs can specifically contribute to increasing the scalability, lifetime, and energy efficiency
of the whole network.
The important advantages of using clustering techniques in WSNs are as follows: (i) Clusters make the WSN more
scalable, i.e., it can localize the route set up within the cluster and thus reduce the size of the routing table stored at the
individual sensor nodes [4]. (ii) Data aggregation/fusion performed by the CH removes redundancy in data
transmission from CH to the BS. (iii) Clustering techniques help to increase network lifetime. The reduced energy
consumption due to clustering techniques causes an increase in the lifetime of the network. Thus, hierarchical protocols
reduce energy consumption and increase network lifetime and scalability.


Heinzelman [2] introduced a hierarchical clustering algorithm for sensor networks, called Low Energy Adaptive
Clustering Hierarchy (LEACH). LEACH is a protocol based on clusters. It handles the distributed information from the
clusters. LEACH randomly selects a few sensor nodes as cluster heads (CHs) and rotates this role to evenly distribute
the energy consumption among the sensors in the network.
LEACH’s operation is divided into rounds. Each round is divided into two phases: set-up phase and the steady-state
phase. CHs are chosen in the set-up phase and the data are transferred from the nodes to the CH and onto the BS during
steady-state phase.
In LEACH, cluster-heads are stochastically selected. In order to select cluster-heads each node n determines a
random number between 0 and 1. If the number is less than a threshold T(n), the node becomes a cluster-head for the
current round.
The threshold for LEACH is given as [2]:
image (1)
with p as the cluster-head probability, r as the number of the current round and G as the set of nodes that have not been
cluster-heads in the last 1/p rounds. This algorithm ensures that every node becomes a cluster-head exactly once within
1/p rounds.
In LEACH, the cluster head (CH) nodes compress data arriving from nodes that belong to the respective cluster, and
send an aggregated packet to the base station in order to reduce the amount of information that must be transmitted to
the base station. However, data collection is centralized and is performed periodically. Therefore, this protocol is most
appropriate when there is a need for constant monitoring by the sensor network. A user may not need all the data
immediately. Hence, periodic data transmissions are unnecessary which may drain the limited energy of the sensor nodes. After a given interval of time, a randomized rotation of the role of the CH is conducted so that uniform energy
dissipation in the sensor network is obtained.
LEACH has a few drawbacks. Firstly, the random election of CHs causes an imbalance in the energy consumption
of the sensor network. Secondly, the threshold T(n) is function of only the CH probability, p and the number of the
current round, r.
To overcome the shortcomings of LEACH mentioned above, improvised versions of LEACH have been proposed
and a few of them are as follows [5-8]:
LEACH-C: This protocol uses a centralized clustering algorithm and the same steady-state phase as
LEACH. LEACH-C protocol can produce better performance by dispersing the cluster heads throughout the
network [5].
TL-LEACH: CH collects data from other cluster members as original LEACH [2], but rather then transfer
data to the BS directly; it uses one of the CHs that lies between the CH and the BS as a relay station [6].
Multihop-LEACH: This protocol selects optimal path between the CH and the BS through other CHs and
use these CHs as a relay station to transmit data over through them [7].
VLEACH: In V-LEACH [8], besides having a CH in the cluster, there is a vice-CH that takes the role of
the CH when the CH dies.
EECHS-LEACH: In this protocol, [1] it considers residual energy of the nodes, distance between the
nodes and the BS, the number of consecutive rounds in which a node has not been a CH, as parameters in
time of CH selection.
In EECHS [1], LEACH’s stochastic cluster head selection algorithm is extended by adjusting the threshold T(n)
denoted in equation (1), considering residual energy of the nodes, distance between the nodes and the base station and
the number of consecutive rounds in which a node has not been a cluster head as parameters. Therefore,
Here, residual energy factor is
where Eresidual is the remaining amount of energy and Einitial is the initial energy of node before transmission. Variable i
indicates the serial number of nodes.
Here, the distance factor is
image (4)
where diB is the distance from node i to BS as follows:
and dFarthest is the distance of the farthest node from the BS. Here (<XBS,YBS>) is the location of the Base Station.
In third parameter (s div r) of equation (2), s is the number of consecutive rounds in which a node has not been a cluster
head and r is the number of the current round. And p, n and G express the same meaning as in equation (1).


A few reasonable assumptions of the network model are made based on [1] and they are:
(i)There exists only one base station and it is fixed at a far distance from the sensor nodes. (ii)The sensor nodes are
homogeneous and energy constrained with uniform energy. (iii)Sensor nodes are immobile and all nodes are able to
reach BS. (iv)The RAM size for each node must be sufficient enough to store the distance of the node from BS.


The four main components of a typical sensor node are: a data processing unit, a sensor unit, a radio communication
subsystem that consists of transmitter/ receiver electronics, antenna, and amplifier; and a power supply unit. The energy
dissipation associated with the radio component is mainly considered although energy is dissipated by the first three
components of a sensor node.
A simple model for the radio hardware energy dissipation is assumed where the transmitter dissipates energy to run
the radio electronics [5].
Here, both free space (fs) and multipath (mp) fading channel models have been used, depending on the distance
between the transmitter and receiver, for simulation. If the distance is less than a threshold, the free space (fs) model is
used; otherwise, the multi path (mp) model is used [5].Thus, to transmit a k-bit message over a distance d, the radio
image (7)
Where the threshold d0 is given as:
image (8)
To receive the message, the radio expends:
image (9)


The simulation environment is composed of 100 sensor nodes and they are distributed in a region of 100mX100m.
Table 1 lists the simulation parameters.
Figure 3 shows the randomly distributed 100 sensor nodes in a 100mX100m area with the Base Station (BS) located
at the coordinates (100,100).
Figure 4 shows the plot of number of alive nodes in the network versus number of rounds, for LEACH and EECHSbased
LEACH protocol. From the plot it is seen that, EECHS shows better performance than LEACH.
Figure 5 shows the amount of Energy consumption of LEACH and EECHS-based LEACH based on number of
rounds. EECHS shows better performance than LEACH.
Table 2 shows the comparison of network lifetime with respect to the parameters FND and LND for LEACH and
Figure 6 shows a bar graph representation of the network lifetime. As indicated in the graph, the network lifetime is
prolonged in EECHS LEACH [1] when compared to LEACH protocol [2].
Table 3 shows the comparison of network lifetime with respect to parameters FND and LND, for different amounts
of initial energy of the node.


This paper presents a comparison between LEACH and an improved version of LEACH known as EECHS [1]. In
EECHS, selection of the CH differs from that in LEACH in the set-up phase. The steady-state phase in EECHS is same
as in LEACH. The CH selection in EECHS considers residual energy of the node, the distance of the node from the BS
and the number of rounds in which the node has not become CH, which results in the minimization of energy
consumption in the WSN. This is because EECHS improves LEACH protocol by improving the CH selection
Simulation results show that EECHS exhibits better performance than LEACH with respect to the number of alive
nodes and energy consumption, with number of rounds as the reference. Here, EECHS is 23.96% better than LEACH
with respect to the parameter FND. And, EECHS is 20.55% better than LEACH with respect to the parameter LND.


The authors wish to thank Prof. B.V. Nityananda, Head of the Department, Department of E & C, St. Joseph
Engineering College, Mangalore, for his support and valuable inputs.

Tables at a glance

Table icon Table icon Table icon
Table 1 Table 2 Table 3

Figures at a glance

Figure 1 Figure 2 Figure 3
Figure 1 Figure 2 Figure 3
Figure 1 Figure 2 Figure 3
Figure 4 Figure 5 Figure 6