MODIFIED LEACH ALGORITHM FOR ENERGY

EFFICIENT CLUSTERING IN WIRELESS SENSOR

NETWORKS
Dr. M.C. Raju1 Neha Rajula2 Rathna Sai Pranay3
dept. of ECE1 dept. of ECE2 dept. of ECE3
VNRVJIET1 VNRVJIET2 VNRVJIET3
Hyderabad, India3
Hyderabad, India1 Hyderabad, India2
[email protected]
[email protected] [email protected]

Siddavatam Sneha4
dept. of ECE4
VNRVJIET4
Hyderabad, India4
[email protected]

Abstract-
wireless sensor node, also known as a sensor node, is made
In wireless sensor networks, node clustering is a vital
up of sensing, computation, communication, actuation, and
operation that aims to balance load and enhance network
power components. These parts are contained in a few
longevity. The most extensively used standard is the low-energy
cubic inches and incorporated onto one or more boards. A
adaptive clustering hierarchy protocol. An improved strategy,
sensor node powered by two AA batteries can operate in the
balanced cluster generation, provides the extra benefit of
1% low duty cycle working mode for up to three years
comparable clusters at the cost of cluster overlapping.
because of low-power circuit and networking technology.
This study proposes a node overhaul technique for
Tens to thousands of these nodes often make up a WSN,
energy efficiency and load balancing while preserving uniform-
which uses wireless channels for communication,
size clusters with no overlap. The proposed technique builds
initial clusters initially, then refurbishes them with a second- information sharing, and cooperative computing.
best option cluster head as necessary. When compared to
previous simulated methodologies, the findings obtained thus
A sensor, such as a thermocouple or strain gauge, measures
far demonstrate a significant improvement in network longevity
a physical quantity and turns it into a signal that can be
and node death rate.
interpreted by an observer or an instrument. Any
Keywords- Sensor networks, energy efficiency, load balancing, interconnected group or system can generally be referred to
network lifetime, uniform size clusters (USCs). as a network. Wireless sensor network (WSNs) is quickly
gaining popularity with both military and commercial uses.
1. INTRODUCTION
With the growth of laptops, mobile phones, PDAs, GPS A network of interconnected, microscopic sensor nodes
devices, RFID, and clever electronics inside the post-PC era, called an AWSN communicate with one another and share
computing devices have become less expensive, more portable, data and information. These nodes collect environmental
and more common in daily life. Using commercial off-the-shelf data, including temperature, pressure, humidity, and
(COTS) components, a wallet-sized embedded system with the pollution levels, and communicate it to a base station.
characteristics of a PC from the 1990s may now be created. Depending on the type and volume of data being watched,
Such embedded devices can be supported by varying versions the latter transfers the information to a wired network or
of the Linux or Windows operating systems. According to this triggers an alarm or an action. Common uses include
viewpoint, the rise of wireless sensor networks (WSNs) is tracking animal and human movement in forests and along
basically the current Moore's Law trend toward the downsizing borders, weather and forest monitoring, combat
and ubiquity of computer systems. A wireless surveillance, and environmental factors including pressure,
temperature, vibration, and pollution.
The suggested network layout aims to reduce delays in protocols created for each particular layer are
wireless sensor networks' data gathering procedures, investigated. Open research concerns for sensor
extending the network's useful life. In order to address the network implementation are also mentioned.
network geometry shortcomings and find the best sink
location relative to those relay nodes in order to overcome
3. LEACH ROUTING PROTOCOL
the lifetime challenge.

Several routing protocols have been designed for WSN, The LEACH routing algorithm is a WSN routing
however, the most widely used hierarchical protocols are protocol developed by Heinzehnan et al. at MIT in the
LEACH and PEGASIS . Hierarchical protocols are used United States and is the first conventional hierarchical
to combine data and reduce transmissions to the base routing system .
station. Data is pooled in hierarchical protocols to save The LEACH protocol is a WSN-specific clustering-
energy usage and transfer to the base station. LEACH, the based routing mechanism. LEACH is defined as a WSN
most extensively used routing protocol, uses cluster-based routing method, which is the first conventional
routing to save energy. This article examines the LEACH hierarchical routing
protocol first and then discusses the LEACH protocol’s protocol. The LEACH protocol uses the distributed CH
stages. election mechanism, in which certain network nodes are
randomly selected as CHs whereas other nodes become
cluster member
2. LITERATURE SURVEY nodes . The message that it has become a CH is
broadcast by the CH, and the selection process for the
According to the research [4], the majority of clustering
CH with the strongest received signal to join to form a
algorithms are unable to accommodate mobile and
cluster is undertaken by other nodes . The data is
heterogeneous network infrastructures. Given that a
collected by the cluster member, and this data is sent to
number of applications demand the support of such
the CH, which receives the data and, through single-hop
network properties, more emphasis must be put into
communication, sends it to the BS. The heavy tasks and
addressing mobility and heterogeneity through clustering.
problems are undertaken by the CH. This includes
The results also demonstrate that clustering techniques are
management of member nodes of the cluster, gathering
capable of addressing a wider range of problems, despite
of the data communicated by the member nodes,
their primary focus on lowering energy usage and
intercluster forwarding, and data fusion. Therefore, for
improving load balancing. This will encourage scientists
the regulation of energy consumption by the nodes,
and researchers to use clustering to address additional
CHs rotate, and the cluster structure is updated on a
networking problems.
periodic basis. LEACH is a cluster formation protocol
that is self adaptive. The fundamental idea or approach
It was also studied that LEACH beats static clustering
of the LEACH protocol is to split the network into
methods by forcing nodes to commit to high-energy
equal-sized clusters.
cluster heads and adjusting the relevant clusters based on
which nodes opt to be
Each cycle in the periodic rotation of CH is referred to
cluster heads at any given time. It is also noticed that each
as a
node is responsible for obtaining data from the cluster's
"round." There are two stages into which each round is
nodes at different times, integrating the data or
divided: the stable transmission stage of the cluster and
information to generate an aggregate signal, that is then
the establishment stage . Each node produces a random
communicated to the base station.
number in the range from 0 to 1, and equation(1) is
used to calculate the threshold T(n). T(n) is then
The paper [2] presents the notion of sensor networks,
compared to the number generated at random for each
which has been made possible by the confluence of
node. If it is less than T(n), the node is chosen as the
microelectromechanical wireless communications
CH:
technology, systems technology and digital
electronics .The initial stage is to investigate prospective
sensor networks and sensing tasks, as well as a summary
of variables impacting sensor network design is offered.
The following stage is to sketch out the communication where p = percentage of CH in all nodes,
architecture for WSNs. Furthermore, algorithms and
r = number of current election rounds,

(r mod (1/p)) is the number of nodes chosen this round, and

G is the set of nodes chosen without CHs in this round.
Following the completion of each CH selection round,
every qualified CH
broadcasts its message about becoming a CH to other
nodes. When the broadcast message is received, additional
Figure 1:Stages of Leach
nodes decide whether it should join the cluster based on the
intensity of the received signal and send their message to
Each cluster's member sensors can only connect
the chosen CH . Following the connecting of its member
with the cluster head through an one-hop
nodes, each CH creates and assigns a TDMA schedule
communication. The cluster head combines all acquired
between each member node. Then, the cluster
data and sends it to the base station
establishment stage will be terminated, and the data
either directly or via another cluster head using the static
transmission stage will commence.
route indicated in the source code.

If the value of threshold T(n) is greater than the number,

After a predetermined amount of time, the
the node will become the cluster head for the existing
network returns to the setup phase. The LEACH
round. Once a node is chosen as cluster head, it cannot be
protocol employs the clustering and periodic data
chosen again until all of the nodes in the cluster have
collecting concepts, which can minimise data
become cluster heads once.
transfer between nodes and the BS. Therefore, this
protocol can not only reduce the energy loss, but also
3.1 LEACH PROTOCOL OPERATION
can extend the network lifetime. In addition, the CH
uses the method of data aggregation, which can reduce
The LEACH protocol operation consists of discrete
correlated data locally.
rounds with mainly two phases [3] [2]: the setup phase and
the steady phase.
In the setup phase, the primary objective is to create
This method can also optimize the amount of data in the
clusters and, for each cluster, select the appropriate cluster
network and reduce energy consumption. Moreover, the
head by choosing the sensor node that has the maximum
time division multiple access (TDMA) schedule used by
energy. A common example of such a hierarchical routing
LEACH allows the member nodes to go into sleep
protocol is the LEACH protocol. Leach protocol employs
mode, and this mechanism holds back the collision
rounds as units; wherein every round consists of a cluster
between clusters and extends the sensors’ battery life.
set-up stage and steady-state storage, whose responsibility
it is to reduce redundant energy costs.
3.2 NETWORK MODEL FOR LEACH
The setup phase has three steps:
1. Cluster head advertisement
The following describes the network model used
2. Cluster setup
to create the clustering and routing
3. Creation of transmission schedule
algorithm:
1) There are 100 identically energy initialised nodes in
The advertisement packet is sent by the cluster head
our model. The transmit power can be changed within a
during the first step to let the cluster nodes know that they
range and the base station, which is manned, has
have taken over as cluster heads for the current round. The
unlimited power.
steady phase is relatively longer in duration than the set-up
2) The nodes are thought to be immobile, and either
phase; it deals primarily with the accumulation of data at
GPS or node self-localization techniques have been used
the cluster heads and the transmission of this information
to determine where they are.
to the sink (BS). During this phase, the cluster head gets
3) There is a single, mobile sink node available to us.
data from its associated cluster nodes.
Information exchange allows for the determination of
the separation between network nodes and the sink
node. The sink node can be moved about to determine
the ideal location.
Low-energy communication will take place over the 5. FLOWCHART FOR SIMULATION
shortest possible distance.
4) Because they are closer to the CHs, CHs may utilise a
single hop to the sink node and use more energy in
delivering data to the base station. Cluster Member (CM)
nodes also employ
single-hop communication with CHs.
5) Sensors monitor the surroundings and relay data to the
Base Station on a regular basis.

4. PROPOSED METHOD

The three goals of the suggested LEACH-USC technique

are as follows:
1) Produce clusters of homogenous distribution (as in
[7]);

2) Produce clusters with distinct limits (as in [3]); and

3) Extend the lifetime of the network (as in [3] and [7]).

As in the LEACH protocol, all nodes are assigned a

cluster head in the proposed solution; however, because
of  the Thcluster threshold, a few nodes will stay un-
clustered. The goal of the cluster refurbishment phase of
the proposed approach is to allow more nodes (MNs—
Thcluster) from different clusters to enter other clusters in
accordance with the cluster leaders' second-best pick.
Because the proposed method incorporates uniform-size
clusters, the approach is referred to as LEACH-USC and
has less intra-cluster communication (USCs).

6. ALGORITHM

The proposed strategy's functioning is represented in

Fig. LEACH also employs a probabilistic strategy for
cluster head selection. All nodes join the closest cluster
head during the first cluster-building procedure.
 After the first cluster creation or formation
operation, clusters of varied sizes exist as a consequence of
the allocation of nodes to the nearest cluster head and
probabilistic cluster head selection as in the LEACH
methodology, but unlike in the BCF approach, there will be
no node without a cluster head. In the proposed approach's
cluster refurbishing operation, clusters will be reformed to
achieve USCs, with the goal of shifting nodes from huge Figure. 2. Sequence of operations in the proposed
clusters to other clusters depending on the second-best LEACH-USC.
cluster head.

Finally, depending on the second-best distance, the first

k nodes (k = Cluster[biggest] Thcluster) from
SecondBestCH[] will be relocated from the largest
cluster to their new clusters. Following the cluster
refurbishing operation, each cluster head in the network
produces a TDMA schedule depending on the number
of nodes inside each cluster. The nodes deliver data to
its respective cluster heads during the data transmission
process, and cluster heads then combine the data and
transfer it to the base station. The cluster heads are
eventually rotated for the following cycle by re-
clustering.

Figure. 3: Network Parameters.

The largest cluster is initially found, and then the distance

between Member Node's of the cluster and the rest of the
cluster heads is calculated. This is done to find the second-
best cluster head alternative. The k-nodes [MN—Thcluster]
with the least communication distance to the remaining
cluster heads will be assigned to the second-best clusters of
the cluster heads. As a result, nodes near the cluster
boundary are assigned to various cluster heads. Algorithm 1
describes the cluster refurbishing procedure.
 7. RESULTS AND ANALYSIS the case of LEACH, as illustrated in Fig. 4. On the other
hand, Cluster 1 contains 25 nodes, and Cluster 2 has 25
nodes in the case of LEACH USC, as illustrated in Fig. 5.

Figure. 4: Cluster formation in Leach

Figure 6: Node death rate comparison for LEACH and

LEACH-USC.

Figure 7: Network Lifetime

Figure 6 depicts the number of nodes that remain alive

Figure.5: Cluster formation in Leach-USC during the course of the network's existence. The figure
shows that the death rate of the node in LEACH-USC is
always lower (i.e., better) than that of LEACH
A comparison was performed between the clusters throughout the network lifespan. This is due to the fact
produced in a round of LEACH and the anticipated LEACH- that clusters obtained by LEACH-USC are more
USC. Figures 4 and 5 show a hollow circle representing balanced in size than those obtained by LEACH, which
sensor nodes, a star in red within the circle representing increases overall network lifetime. LEACH-USC
cluster heads, and a cross in red representing the base surpasses BCF not only because of the well-balanced
station. In this scenario, the network has three clusters: clusters, but also because the total intra-cluster
Cluster 1 in red, Cluster 2 in green, and Cluster 3 in blue. communication distance is also less in comparison to the
BCF approach, which significantly improves network
Cluster 1 contains 25 nodes, and Cluster 2 has 20 nodes in lifetime.
8. CONCLUSION Structured Clustering Algorithm for Wireless Sensor
Networks" International Conference on Computing
Wireless sensor networks are widely employed in a Analytics and Security Trends pp. 523-527 2016.
variety of applications. One of the most extensively used [11]  W. B. Heinzelman A. P. Chandrakasan and H.
methodologies in WSN is the LEACH protocol. The
Balakrishnan "An Application-Specific Protocol
clustering technique, LEACH-USC, which is presented in
Architecture for Wireless Microsensor-Networks" IEEE
this paper, is primarily noticed in this study and balances
Transactions on Wireless Communications vol. 1 pp.
the load of the network by constructing all clusters of
660-670 Oct. 2002.
uniform size. The suggested model, LEACH-USC, has
[12] Mst. J. Ferdous J. Ferdous and T. Dey "Central
primarily produced high-quality clusters with uniform size
Base-Station Controlled Density Aware Clustering
and complete intra-cluster communication distance. This
Protocol for Wireless Sensor Networks" International
will provide the simulation results of LEACH-USC in
Conference on Computer and Information Technology
contrast to the LEACH methodology.
pp. 37-43 2009.
[13] A. Karmaker M. Mahedee Hasan M. Showkat Moni
9. REFERENCES
and M Shah Alam "An efficient cluster head selection
strategy for provisioning fairness in wireless sensor
[1] F. Karray, M. W. Jmal, A. Garcia-Ortiz, M. Abid, and
networks" IEEE International WIE Conference on
A. M. Obeid, “A comprehensive survey on wireless sensor
Electrical and Computer Engineering (WIECON-ECE)
node hardware platforms,” Comput. Netw., vol. 144, pp.
pp. 217-220 December 2016.
89–110, 2018.
[14]  M. Ye C. Li G. Chen and J. Wu "EECS: an energy
[2] A. Shahraki, A. Taherkordi, Ø. Haugen, and F.
efficient clustering scheme in wireless sensor networks"
Eliassen, “Clustering objectives in wireless sensor
In International Conference on Performance Computing
networks: A survey and research direction analysis,”
and Communications pp. 535-540 Apr. 2005.
Comput. Netw., vol. 180, 2020, Art. no. 107376.
[15] A. More and V. Raisinghani "A survey on energy
[3] W. B. Heinzelman, A. P. Chandrakasan, and H.
efficient coverage protocol in wireless sensor networks"
Balakrishnan, “An application-specific protocol
Journal of King Saud University-Computer and
archfitecture for wireless microsensor networks,” IEEE
Information Science vol. 29 pp. 428-448 Oct. 2017.
Trans. Wireless Commun., vol. 1, no. 4, pp. 660–670, Oct.
2002.
[4] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.
Cayirci, “Wireless sensor networks: A survey,” Comput.
Netw., vol. 38, no. 4, pp. 393–422, 2002.
[5] H. Shin, S. Moh, I. Chung, and M. Kang, “Equal-size
clustering for irregularly deployed wireless sensor
networks,” Wireless Pers. Commun., vol. 82, no. 2, pp.
995–1012, May 2014.
[6] C. Bejaoui, A. Guitton, and A. Kachouri, “Equal size
clusters to reduce congestion in wireless multimedia sensor
networks,” Wireless Pers. Commun., vol. 97, pp. 3465–
3482, 2015.
[7] V. Pal, G. Singh, and R. P. Yadav, “Balanced cluster
size solution to extend lifetime of wireless sensor
networks,” IEEE Internet Things J., vol. 2, no. 5, pp. 399–
401, Oct. 2.
[8] Y. P. Chen A. L. Liestman and J. Liu "Clustering
Algorithms for Ad Hoc Wireless Networks " Ad Hoc and
Sensor Networks Nova Science Publishers 2004.
[9] Shimul Bhowmik; Amartya Sen; Sanghita
Bhattacharjee, "Balanced neighborhood aware clustering
technique in Wireless Sensor Networks" IEEE 2nd
International Conference on Power, Control and Embedded
Systems, 2012.
[10]  P. Yuvaraj and K. V. L. Narayan "Energy Efficient