An Energy Efficient and Adaptive Clustering for

Wireless Sensor Network (CH-leach) using Leach

Protocol
Introduction
Wireless sensor network are networks with decreased mobility and sense and gather information about
physical and environmental phenomena. Components like board radio transceiver, micro controller,
memory, power supply and real sensors make up a remote Sensor-Node. Sensors nodes near base
station (BS) will act as a communicator for the sensors that are far from BS. So clustering algorithms
associate with K-means method increase the live time of a network. As each sensor transmit same data
of same event to BS, this causes the nodes to last very short time. In cluster-head architectures, cluster-
head transmit data to BS and other nodes only transmit the collected data. Hence, it cluster-head
improves lifetime of a network.

Related Work
LEACH (low-Energy Adaptive Clustering Hierarchy)
The nodes distribute the load over period of time and depending on signal strength, nodes with highest
energy within cluster become cluster heads and transmit data to BS.

Improved Leach Protocols

In LEACH-CE protocol, each node with less energy die in each round, hence improving the life time of
network. In ME-LEACH protocol, energy is reduced by reducing communication distances between
sensor nodes.

Deec (Distributed Energy Efficient Clustering)

This protocol is for heterogeneous wireless sensor network. Nodes that have more remaining energy
have more chances of being cluster head.

Proposed Approach
It is assumed the sensor nodes are spread randomly on 100x100 field and are homogenous. Regarding
the BS is fixed, it is considered that the location of BS is at edge of network bounding and in the center
of the field.

Energy efficient cluster-head selection k-means approach

Certain number of nodes are selected as cluster head and transmission to base station is done in setup
and steady state phase. The node decides number between 0 to 1 and will become the cluster head for
current round if the number is less than the threshold T(n) being set.
𝑝
𝑇(𝑛) = , 𝑖𝑓 𝑛 ∊ 𝐺
1
1 − 𝑝 (𝑟 𝑚𝑜𝑑 𝑝)
0 , 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
As in Leach, the choice of cluster head is randomly made so the unstable energy level among nodes
arises. If cluster heads are far away from BS, they will spend more energy in transmission. In the
proposed protocol, k-means approach is used to ensure balanced energy distribution. The aim is to
maximize the lifetime of the network.
𝑘

∑ ∑ ∥ 𝑋𝑖 − 𝐶𝑗 ∥2
𝑗=1 𝑋𝑖 ∈ 𝑆𝑖

 Generate k points cluster center, the number of the cluster required k.

 Set the data points. The data points will assign to location of the nodes, in every cluster area
required.
 The cluster center (centroid) in each area will assign to nearest node.
 This node will become the cluster-head if it has enough energy.
 Repeat the steps if assigning node that is near to the cluster center not able to act as cluster
head.

Every each round of the nodes that will become cluster head is assigned to nearest centroid. If the
chosen nodes have energy under the threshold then new cluster head will be selected by repeating
above steps.

Setup phase
The process begins with the setup phase. The nodes near to the centroid act as cluster head transmit
the data to BS. The node will act as cluster head as long as it has energy above threshold.

Equations proposed network model

To evaluate performance of cluster head leach protocol, performance measures like the time period in
which nodes are transmitting and receiving data and the dissipation of energy by nodes in transmitting
and receiving data between normal and CH-nodes are checked.

Simulation results
Parameter Value
Network size (M*M) 100m by 100m
Location of BS (Base Station) 50*50 By Edge of the network
Number of Nodes 100
Cluster head probability 0.1
Initial Energy 0.5 J
ETX and Erx (Eelec) 50 n J/bit
Number of the Cluster (K-means) 5,10,15,20,25 and 30
The Data Packet Size (bits) 4000
TABLE 1. PARAMETERS VALUE USED IN SIMULATION
 FIGURE 1. NETWORK TOPOLOGY

In this section, we provided two scenarios to illustrate the proposed protocol algorithm capabilities
using Matlab R2015a simulation and compare its performance with Leach and Deec. The network
topology as describe on Fig.1 and specific parameters as given in Table 1.

FIGURE 2. Number of cluster area, Improvement of CH -Leach (BS 50/50)

 FIGURE 3. Number of cluster area, Improvement of CH -Leach (BS 50/99)

Number of Cluster Area Network Life Time

Leach Deec CH-Leach
BS 50/50 BS 50/99 BS 50/50 BS 50/99 BS 50/50 BS 50/99
5 911 972 1228 1177 1330 1310
10 888 900 1227 1198 1412 1397
15 872 859 1224 1204 1543 1484
20 904 878 1229 1198 1553 1539
25 940 826 1249 1261 1695 1641
30 919 932 1228 1216 1756 1641
TABLE 2. TABLE STYLES NETWORK LIFE TIME COMPARISO N

FIGURE 4. Number of cluster area, Improvement of CH -Leach (BS 50/50)

 FIGURE 5. Number of cluster area, Improvement of CH-Leach (BS 50/99)

FIGURE 6. The lifetime of the network on a different cluster area, Base station located on
(50/50)
FIGURE 7. The lifetime of the network on a different cluster area, Base station located on
(edge)