Instrumentation Mesure Métrologie

Vol. 22, No. 2, April, 2023, pp. 65-72

Journal homepage: http://iieta.org/journals/i2m

An Energy Efficient Technique for Improved Network Lifetime in Wireless Sensor Network
(WSN) Through Energy, Distance, and Density-Based Clustering
Asha Rawat* , Mukesh Kalla

Department of Computer Engineering, Sir Padampat Singhania University, Udaipur, Rajasthan 313601, India

Corresponding Author Email: [email protected]

(This article is part of the Special Issue: Technology Innovations and AI Technology in Healthcare)

https://doi.org/10.18280/i2m.220203 ABSTRACT

Received: 6 March 2023 The intelligent networks utilize smart and AI federated technologies especially in
Accepted: 31 March 2023 Industrial Internet of Things (IIoT), as it is the need of the hour to gather the data from
sensor devices deployed at diverse locations for the drawing inferences from the gathered
Keywords: data. The data transmission operation requires smart technologies to move the data
AI federated technologies, wireless sensor between base stations and mobile devices. Usually, the sensor devices have limited
networks, energy efficiency, data resources for storage as well as for preserving energy. The design of the network should
aggregation, density based clustering, be done in such a way that it can reduce the energy consumption and the data transmission
residual energy time. This can help improve the lifetime of the network. With the advent of AI based
technologies, it is possible now to integrate the underlying technologies such as data-
mining, IoT and AI federated technologies to create the clusters of sensing nodes to
minimize energy usage. Thus, this study discusses three different cluster-based models for
data collection and transmission. The first model is used to create a cluster and then select
its head based on the energy parameters. The second model, on the other hand, uses a
clustering method to create the cluster and then select its head. The third model in this
paper presents the main contribution of the cluster creation process by considering the
various parameters that affect the density and energy of the cluster. The simulation
experiments are performed for all three models using JUNG simulator. The experimental
results show that the third approach with considering energy, distance, and density for
selecting the clustering head achieves the optimal results for enhancing the lifetime of the
network.

1. INTRODUCTION landscape towards the reality. A network of small sensors or

actuators that are connected to one another is in charge of
It is the fundamental goal of Artificial Intelligence to sensing and sending information towards the Internet. From
develop systems that are capable of replicating the logical and the perspective of a system composed of sensor nodes, with
communication abilities of a human being. It implies to sensors cooperating between themselves and formulating a
develop the infrastructure which is smart sense the data in real- collective system whose component would be to collect
time and capable of communicating in an effective way. The information about the physical variables of systems. A
Internet of Things (IoT) is a network of interlinked equipment wireless sensor network (WSN) is a type of device that is
and entities called sensors that communicate with each other designed to monitor various environmental and physical
through the internet, allowing the sensor nodes to receive and characteristics. It can be placed in a variety of communication
transmit data. The system works in unseen yet intelligent ranges to provide its users with the necessary information.
manner that senses, regulates, and can be programmed [1], and However, it is very important that the network's routing
it does so by utilising embedded technology to connect with technique is designed in a way that is both long-term and
other nodes in the network. The Internet of Things (IoT) efficient.
allows for instant access to information pertaining to any In a typical WSN node, there are four major components: a
device while maintaining high quality and performance [2]. sensor device, which is typically used for sensors to detect a
Approximately 5 billion smart gadgets have already been physically quantifiable and measurable parameter; an Analog
connected as of today, with an estimated 50 billion devices to Digital Converter (ADC), which is used for converting
will be connected by 2020 [1]. The quantity of people who are analogue signals to some different downloads; a processing
literally interacting may surpass the quantity of smart objects unit, which provides basic data analysis and information
that are virtually communicating to them. This will lead to an processing capabilities; and a power unit, which is responsible
accumulation of traffic, with humans becoming a minority of for extending the sensor node's operational life span. In
both the generators and recipients of traffic [3]. Because of the general, it is recognized that WSN is a resource-constrained
opportunities and challenges presented by the IIoT, several infrastructure in which energy efficiency is always the most
research fields are being investigated. The World Wide Web important consideration, due to the fact that the operation of
serves as a conduit for connecting the virtual modern WSN is strongly dependent on the average lifespan of the

65
sensor nodes' batteries. Among the WSN operations, the The typical WSN architecture as shown in Figure 1 is
Ethernet frame routing activity is the one that consumes the composed of multiple sensor nodes and devices that are
most energy. While the WSN shares some traits with distributed in a given area to provide the best possible sensing
conventional networks, it also has several distinct coverage. These nodes are then aggregated to form clusters.
characteristics. As a result, when addressing issues and Each cluster head has its own data processor that is responsible
challenges such as network, runtime configurations strategic for collecting and disseminating the data from the sensing
planning, node distribution and administration, node mobility nodes. The researchers discussed in this paper have developed
power efficiency and usage, network deployment, various protocols that are commonly used in wireless
implementation details and environments, and so on; these communication [6-8]. One of these is the LEACH cluster-
distinctive features are frequently taken into consideration. based network architecture. It is one of the most widely studied
A wireless sensor network (WSN) that can be employed in and utilized WSNs. The LEACH algorithm doesn't Take into
different scenarios, such as reconnaissance, home monitoring, account the amount of energy used by the sensor nodes as well
and logistics, for adding a sensing component, a calculation as their locations throughout the selection process. This leads
element, and data gathering, in addition to multiple fields such to sensor nodes failing prematurely and reducing the lifetime
as environmental and healthcare, among others, to disaster of WSNs.
forecasting and transport systems is useful. The network is This paper presents our proposal for a more efficient
made up of tiny sensor nodes (SN) that can track and process clustering of the LEACH routing system, which goes above
data from a particular geographical location before sending it and beyond the base mechanism that has been proposed in the
to a remote location known as the sink node or base station standard version. We suggest two new clustering
(BS) [1]. methodologies based on the LEACH routing protocol, one
A wireless sensor network (WSN) is a type of device that based on energy and the other a combination of energy and
can be used in low-cost, resource-constrained devices. It can distance from base station. Two concerns are discussed in our
be used to distribute small packets of data over a multi-hop proposed routing protocol. A candidate node's distance from
wireless network. Each node is a type of sensor that has its the BS must be as small as possible in order for it to be
own unique set of features, such as a low-power radio and a considered. Second, the node considering to become a Cluster
limited memory. The location of a battery node is very Head should have more remaining power than just the average
important, as it can be used in large areas even if the battery is residual energy of all living nodes in the WSN in order to be
not attached. Researchers must develop a way to route and considered.
transmit the wireless sensor network (WSN) in order to extend The main focus of this study is on density-based clustering
its lifespan and improve its energy efficiency. algorithms, in which judgments are made based on the extent
For meeting WSN criteria such as energy consumption, the of a node. It refers to the number of nodes that surround a
Cluster-based algorithms perform more effectively than the certain node. The proposed technique is not only dependent on
other routing protocols suggested for WSNs [2-5]. By forming the degree of the node, but also on how widely distributed the
SNs of each cluster or grouping them into those that are given neighbours are. Dense areas have a high presence of sensing
to Cluster Heads, the SNs use their information and data and nodes in a smaller space, i.e., neighbours are in close
pass it to those to the group's heads (CH). The CH nodes proximity to one another. As a result, nodes positioned in the
subsequently transmit the information they have gathered to heart of a heavily populated regions are capable of achieving
the BS. Because CH nodes are critical to the effectiveness of higher connectivity while using less power since they can
cluster-based scheduling algorithms, the policy for selecting identify more nearby neighbours. As a result, becoming a
CH nodes has a significant effect on the system metrics such cluster leader is highly recommended (CH). A low density,
as the network lifetime and the rate at which energy is from the other hand, indicates that a small number of nodes
consumed. have been scattered over a big region of land. As a result,
nodes in these places have minimal neighbours and require
more potential to transmit with each other since they are
located further out from the core.

2. RELATED WORK

In the Internet of Things, one of the most significant issues

is the high cost of maintaining and maintaining the vast
number of sensor nodes that will be deployed [9]. A time-
consuming process [10] can be involved in changing sensor
batteries that have already been installed in the network region.
It is essential that the batteries of a sensing element designed
for use on a certain organism or breed be able to last
significantly longer than that of the organisms in order for the
sensor to be feasible. This leads to another significant issue:
power management. Other major issues in WSN [11] include
efficient end-to-end data transmission, adequate congestion
management, and a low packet loss ratio.
The authors [12] of the LEACH clustering algorithm
Figure 1. Schematic model of cluster based network suggest a distance-energy cluster composed of various nodes.
It takes into account the different factors that affect the

66
network's location and distance. The three authority layers of degree, the cross - functional and cross distance, based on
the cluster are then divided into three. These layers are residual, and the number of optimal CHs. The following is the
designed to reduce the cluster's power consumption. In definition of the objective function: According to a range of
addition, they eliminate the key linkages between the nodes. various network indicators, the model beats other routing
The researchers [13] provides the detailed structure of the algorithms when compared to the others. It is explained in the
energy-efficient cluster model called EECS. This model works study [19] how to determine PSO-based CHs based on
for data collection in periodical manner, and works in large distances between nodes and from a base station (BS) as well
scale sensor network. The model designed by the researchers as residual energy, among other considerations. The approach
[13] consist of the cluster-head selection process. In this phase provided in the study [20] is advantageous if the sensor nodes
a cluster head is selected from the number of cluster nodes. are distributed unevenly over the sensing area, as this is the
Here, CHs are chosen via a localized competition that takes case in practice. Energy consumption and network lifetime are
account both means of supplying and transmission radius of reduced and extended respectively when the chance of
clustering algorithms. Once this is done, a weighted function engaging in clustering is adjusted in real time on a network.
for the plain component is introduced during the cluster The most significant reduction in power requirements occurs
creation step, which is used to determine whether proper in densely inhabited locations, where the likelihood of a node
cluster should be joined and which should not. The cost of bypassing a cycle of clustering is higher than in less heavily
correlation communication, as well as the value of information populated areas.
exchange between both the CHs and the BS, are used to The author [21] proposed that the selection process for CH
calculate the value of the function. involves the residual energy. After comparing the two
Furthermore, the authors [14] suggest a WSN partitioning different methods, it was found that one of the methods, the
algorithm based on the k-nearest neighbour algorithm (KNN). Multi-hop approach, outperforms the other. He also proposed
A clustering algorithm are proposed, each of which has a BS a non-probabilistic method, which involves clustering the
as well as all sensor nodes directly interact with the BS networks into zones. ANP is a decision tool that can be used
included inside the cluster in which they are situated. The to analyze the various characteristics of a cluster. After
authors [15] present a trustworthiness derivation process for generating a set of parameters, the tool chooses its head.
WSN-based Internet of Things connections that is both The authors of this study [22] propose an energy-efficient
energy-efficient and reliable. Using risk strategy analysis to method for clustering and localization that is based on a
determine the ideal amount of recommendations, the system is genetic algorithm (ECGAL). In this method, the fitness
able to reduce communication load while simultaneously function is constructed by combining residual energy, distance
increasing efficiency. The energy-aware method provides estimation, and coverage connection. The execution of this
enough security while also reducing network latency. It is function takes very little time. A lower quantity of energy is
proposed by Junping et al. [16] to use a time-based CH used by the ECGAL that has been proposed, which in turn
selection method known as TB-LEACH to set well-distributed enhances the life of wireless networks.
clusters and increase longevity by 20 to 30%. The spacing This study [23] presents a novel form of the LEACH
among nodes and the BS is taken into consideration for protocol known as LEACH augmented with probabilistic
minimum level CH selection [13], which enhances longevity cluster head selection. The goal of this protocol is to extend
by 10% compared to the previous method. the lifetime of sensors (LEACH-PRO). LEACH-PRO presents
Imperialist competitive algorithm is essentially algorithm a number of new methods for extending the lifetime of nodes
that is inspired by social phenomena and is used to solve in WSNs. One of these methods is the selection of cluster head
optimization problems. This algorithm requires the colonial nodes through the application of a probabilistic function that
system to be a step in the growth of society and politics. An is based on the highest amount of residual energy and the
imperialist competitive algorithm can help improve the shortest distance to the sink.
performance of the LEACH. It can also determine the optimal The purpose of this study [24] is to execute communications
location for the cluster's head. This method can also help between sensor nodes in a way that is efficient with energy and
improve the abnormalities that are present in the LEACH to lengthen the lifetime of the network by distributing the load
framework. One of the most important factors that this strategy across gateways that are under less energy constraint.
can consider is the amount of energy that each node has. The Clustering is an efficient method for reducing the amount of
authors [16] calculated an adjustment to the likelihood of energy that is lost by the sensor nodes in a wide-range wireless
selecting CH. Additionally, the optimal value of CH is taken sensor network. This helps to extend the lifetime of the
into consideration in the article, although only for fixed values network as well as achieve scalability and robustness.
like 1 and 6. This results in a 40- to 50 percent increase in the The fuzzy-GWO algorithm is used for the identification of
network's lifetime. CH in the protocol that is suggested in this work [25]. Because
The authors [17] presents the strategy for selection of of its quicker rate of convergence, GWO was selected as the
cluster head. These cluster head work for the aggregation of optimal metaheuristic method to use rather than any of the
data. While aggregation cluster head eliminates the redundant alternatives. In addition, GWO causes a constant shrinking of
data. This technique improves the overall lifetime of the the search area and brings about a reduction in the number of
network with reduction in resource utilization. In the technique, decision variables.
the threshold value of the sensor is changed based on the The authors of the paper [26] propose a new mechanism for
external temperature of the sensor node. If the temperature of fully connected energy efficient clustering (FCEEC). This
the sensor node is higher in comparison to the entire network mechanism makes use of the electrostatic discharge algorithm
the threshold of the node varies. in order to construct a densely integrated communications
CH is chosen [18] by using particle swarm optimization to system with shortest path routing from sensor nodes (SNs) to
determine its location (PSO). Optimal CHs are chosen based the cluster head (CH) in an environment that involves multiple
on an objective function, which is represented by the node hops. The electrostatic discharge algorithm (ESDA) that was

67
 𝑝 𝐸𝑟𝑒𝑠𝑖𝑑𝑢𝑎𝑙
presented improves the network's life time while 1 × 𝑘𝑜𝑝𝑡 ; 𝑓𝑜𝑟 𝑎𝑙𝑙 ∪ 𝐺
𝐸𝑖𝑛𝑖𝑡𝑖𝑎𝑙
simultaneously achieving full connectivity between sensor 𝑇(𝑛) = {1−𝑝(𝑟 𝑚𝑜𝑑 𝑝 (2)
nodes in an energy efficient manner. Because to ESD, the 0; 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
number of dead nodes in the network is greatly reduced, which
results in an increase in the network's longevity. where, Eresidual denotes the node's remaining energy level and
Following a thorough examination of the literature, it was Einitial signifies the node's initial allocated energy level. The
discovered that the primary advantage of the fat-based routing study [22] can be used to discover the optimum no. of cluster
protocol was its simplicity in operation, as well as the fact that kopt.
it would have a proper communication framework with both
the base station, in which all nodes were permitted to take an 𝐸𝑓𝑠
𝑘𝑜𝑝𝑡 = √𝑛⁄2𝜋 √ 𝑀 (3)
active part even during routing operation. For the sake of 𝐸𝑎𝑚𝑝 𝑑 4 (2𝑚−1)𝐸0 −𝑚𝐸𝐷𝐴
convenience, individual nodes only require information about
their directly connected neighbors and no further information. The network diameter is represented by the letters "M" and
While nodes are spread out in a fast approach and all nodes are "E0," and the value of each node's initial supply of energy
seeking to participate equally, the significant disadvantage is deduced from the number. The CHs that are participating in
that the nodes nearest to the sink drain their power more the current round of the program distribute notifications to the
quickly than those positioned farther distant from the sink. clusters that are part of their respective clusters. The signal
This is primarily due to the high volume of data being intensity of the request is evaluated by the sensing nodes
transmitted. This is having a negative impact on the nodes that before it is sent to the central hub. This ensures that the CHs
are nearer to the sink in terms of keeping them alive for a are only sent to the appropriate areas. Data conflicts are
longer period of time. As a result, the nodes located further avoided by using Time Division Multiple Access (TDMA)
away from the base station may be unable to interact with it protocols, which allow nodes to send data at different times of
over a period of time due to a network isolated segmentation the day or night. Continue repeating the process for the second
fault in the WSN. A huge number of nodes are unable to and third rounds once all of the nodes within the network have
engage in routing as a result of which they are never able to exhausted their available resource allocations.
make full use of their available energy. More research is
deemed necessary in order to address the energy efficiency of
WSNs from this perspective. Furthermore, fast routing is still
plagued by challenges such as data conflict overhead, links
built on the fly without synchronized, energy dissipation that
varies based on traffic patterns, and fairness that isn't always
ensured w.r.t. standard encryption models in the next section
of this text.

3. ENERGY BASED CLUSTER ROUTING

The suggested protocol is a clustering algorithm that

consists of setup stage and steady-state performance. Firstly,
in set-up procedure, sensor nodes are distributed all through
the infrastructure and separated into clustered led by a CH who
is responsible for data gathering from sensing nodes. The
content is fused to decrease the quantity of data by deleting
any superfluous bits. This transpires even during relatively
stable stage, and it is during this period that data is actually
routed to the BS by the network's CHs. After a first round of
generation using the usual LEACH method, cluster and
Cluster Head is selected using the following equation.
𝑝 Figure 2. Flowchart of energy based cluster routing
1 ; 𝑓𝑜𝑟 𝑎𝑙𝑙 ∪ 𝐺
𝑇(𝑛) = {1−𝑝(𝑟 𝑚𝑜𝑑 𝑝 (1)
0; 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 CHs receive data within the time slot that has been allocated
to every single node in the network. Because of the need to
The energy expended by each node in the network conserve energy, just the transmitting node is kept active,
following data transmission varies from node to node and is while the other nodes in the cluster turn down their radios.
determined by the amount of data transmitted by each node. Following the completion of data transmission by all of the
The distance between both the transmission and reception cluster's nodes, the CH will begin processing of the data
nodes, which is denoted by the letter ‘d’, determines the received from them. It collects data and aggregates that to
amount of power that is used in the transmission. Therefore, remove redundancy before compressing it to the greatest
the CH is selected for the following round by means of an extent possible to maximise bandwidth utilization. The CHs
improved equation, which is as follows: communicate with the BS or sink using either multi-hop or
single-hop communication. The entire technique is shown in
Figure 2.

68
4. ENERGY AND DISTANCE BASED CLUSTER to the base station. The presented approaches are based on the
ROUTING presumption that the network does have a high node density,
which is often not true. However, only a few attempts were
Energy and Distance-dependent Cluster Routing is the made to develop a density measurement system. The equation
name given to a second routing proposal that takes into that is used to determine the network density is shown below.
account both the energy and the distance of a cluster head. It Here the density is measured as the no. of nodes per m.
takes into account the many different aspects that contribute to
the decision that a cluster head makes. For instance, the 𝑁(𝐴)
𝑑(𝑟) = 𝑙𝑖𝑚|𝐴|→ 0 (7)
|𝐴|
distance between a base station and the nodes is taken into
account. A second threshold is also set depending on the
cluster head's distance. The aggregation delay is calculated by where, N symbolizes the no. of live nodes in the particular area
taking into account the current and energy consumption of the A, and R represents the range of data transmission in the area
nodes when it comes to choosing CH elections. It ensures that A.
the ones with the most transmission power will have a higher
chance of being CHs. In addition to this, the selection of CH
components also affects the overall performance of the WSN.

|𝑑𝑡𝑜𝐵𝑆𝑎𝑣𝑔 −𝑑(𝑖,𝐵𝑆)| 𝐸𝑖
𝑐× × , 𝑖𝑓 𝑛 ∈ 𝐺
𝑇(𝑛) = { 𝑑𝑡𝑜𝐵𝑆𝑎𝑣𝑔 𝐸𝑖𝑛𝑖𝑡𝑖𝑎𝑙 (4)
0; 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

The energy of a candidate node in a given round is referred

to as Ei. This term indicates the initial energy that a node has
before it is transferred. The region's boundary value is
determined by the proximity of its sensor network and the BS
to its prospective node:

Pch(n) = P(nresi) P(ndist) P(ndcn)

(5)
1-P (r mod1/P)

P(n) < Pdc(n) < Pch(n) (6)

ch(n) – cluster head Figure 3. Flow of energy, distance and density based model
nresi – node with highest residual energy
ndcn - distributed cluster node
c – number of cluster (variable) 6. RESULT ANALYSIS
r – number of rounds
We implemented the system on standard machine i7 9th Gen
Processor and 8 GB of RAM. The simulator used for analysis
5. ENERGY, DISTANCE AND DENSITY BASED of the system is JUNG, which gives us the number of
CLUSTER ROUTING functionalities for generating and managing the network. The
results obtained from the simulation are presented below:
The third technique is a density-based clustering algorithm,
which means that rather than grouping data, it generates an
arranged list of data, with data that are more closely related to
one another appearing in the denser sections. To put it another
way, the nodes having high density and those that are close
together are ranked in succession in the previously described
list of nodes. In this structure, it is simple to retrieve
information about cluster centroids and their locations. The
proposed method is based upon that Distance function
between both the nodes, as well as the number of sensor nodes
that come together to create a new cluster must be more than a
particular threshold in order to be considered successful.
Actually, the points are subjected to a DBSCAN-based
preprocessing step, during which the points are sorted relying
on its accessibility by that of the core points, after which the
Density - based algorithm is performed to the ordered points,
and lastly the points are clustered. Figure 3 depicts the Figure 4. Energy consumption for sending the data with
flowchart for the suggested method. variable data size
According to this strategy, the CH selection criteria requires
the integration of three criteria: the calculation of the Figure 4 depicts the outcomes, and Figure 5 depicts the
aggregation delay involves taking into account the energy that amount of energy and time expended during the transmission
the node has left in its current round. In addition to this, it takes of the information. We illustrated the outcomes of all five
into account the length of the path that extends from the node approaches in addition to allowing for a more in-depth study

69
of the results. At the moment, the number of resources We also calculated the packet delivery ration in the above
consumed during transmission contain the properties that are experiment. Packet delivery ratio is computed by taking into
utilised to delay the transmission. Handling delay can be account how many packets were successfully received by the
defined as the length of time it takes for component nodes to network. The throughput rate refers to the amount of data that
generate their encrypted messages and compare marks, among is transferred across a network. If a network is overburdened,
other things. The calculation of the aggregation delay involves packets may get stuck at the source and never reach the other
tracking down the time it takes to test the marks that have been parts of the network. The result is tabulated in Table 3 and
received from various components. It also involves collecting graphically presented in Figure 8.
ciphertexts and marks. The average time spent at the end of the
process on obtaining the first knowledge for the BS by
checking accumulated markings and decoding collected
ciphertexts is referred to as the unscrambling delay.

Figure 6. Energy utilization for energy, distance based

cluster routing and energy, distance and density based routing
Figure 5. Time consumption for sending the data with
variable data size

All the three modules have been tested with variable

number of nodes. The count of nodes has been increased
gradually and the performance of the system has been noted.
The number of nodes used for testing the system are 20, 40,
60, 80, 100 and 120. Table 1 gives use the summary of the
evaluation based on the energy consumption during the data
transmission.

Table 1. Energy consumption for all the three methods

Initial Number of
energy nodes ES PS1 PS2 PS3
1825 20 717 590 504 548
3616 40 763 553 598 636 Figure 7. Remaining energy after data transmission for
5457 60 871 873 680 748 energy, distance based cluster routing and energy, distance
7223 80 921 1133 921 820
8944 100 971 1157 924 822
and density based routing
10847 120 1403 1304 1192 1026

The remaining energy after the same experiment is

presented in Table 2.

Table 2. Remaining energy after the data transmission for all

the three models

Initial Number of
ES PS1 PS2 PS3
energy nodes
1825 20 1108 1235 1321 1277
3616 40 2853 3063 3018 2980
5457 60 4586 4584 4777 4709
7223 80 6302 6090 6302 6403
8944 100 7973 7787 8020 8122
10847 120 9444 9543 9655 9821

The graphical comparison of the above experiment is Figure 8. Packet delivery ratio for energy, distance based
presented in Figures 6 and 7 respectively. cluster routing and energy, distance and density based routing

70
 Table 3. Packet delivery ratio for all the three models networks with energy-harvesting sensors. Computer
Networks, 57(14): 2689-2704.
Number of nodes ES PS1 PS2 PS3 https://doi.org/10.1016/j.comnet.2013.06.003
20 24 23 24 25 [6] Kuila, P., Gupta, S.K., Jana, P.K. (2013). A novel
40 62 52 54 59 evolutionary approach for load balanced clustering
60 85 86 85 85 problem for wireless sensor networks. Swarm and
80 120 111 118 117
Evolutionary Computation, 12: 48-56.
100 143 144 144 147
120 172 170 178 185
https://doi.org/10.1016/j.swevo.2013.04.002
[7] Manjeshwar, A., Agrawal, D.P. (2001). TEEN: Arouting
protocol for enhanced efficiency in wireless sensor
7. CONCLUSION networks. In IPDPS, 1(2001): 189.
[8] Lindsey, S., Raghavendra, C.S. (2002). PEGASIS:
To make wireless sensor networks (WSNs) more Power-efficient gathering in sensor information systems.
In Proceedings, IEEE Aerospace Conference, Big Sky,
sustainable and to improve their operation, a unique energy-
efficient routing protocol that is based on energy, distance, and MT, USA, pp. 3-3.
density has been suggested in this study. This protocol was https://doi.org/10.1109/AERO.2002.1035242
developed to address the shortcomings of LEACH by [9] Chen, Y.K. (2012). Challenges and opportunities of the
introducing a cluster head selection that takes into account the internet of things. 17th Asia and South Pacific Design
remaining energy, the distance to the base station, and the Automation Conference, pp. 383-388.
[10] Ali, A., Ming, Y., Si, T., Iram, S., Chakraborty, S. (2018).
density of the nodes in the network. According to the findings
of the performance evaluation, the suggested method Enhancement of RWSN lifetime via firework clustering
outperforms both the LEACH protocol and the transmitter and algorithm validated by ANN. Information, 9(3): 60.
receiver protocol in terms of the obtained network lifetime, the https://doi.org/10.3390/info9030060
speed at which residual energy is depleted, in addition to the [11] Wang, C., Sohraby, K., Li, B., Daneshmand, M., Hu, Y.
(2006). A survey of transport protocols for wireless
amount of traffic load that is generated on the network. The
sensor networks. IEEE Network, 20(3): 34-40.
findings also indicate that the effectiveness of the proposed
algorithms improves along with the size of the network. This https://doi.org/10.1109/MNET.2006.1637930
is because the increasing density of the network's nodes is [12] Thein, M.C.M., Thein, T. (2010). An energy efficient
responsible for this phenomenon. The performance of the cluster-head selection for wireless sensor networks. In
proposed mechanism will be tested in a real-time environment 2010 International Conference on Intelligent Systems,
Modelling and Simulation, Liverpool, UK, pp. 287-291.
as part of future study, which will include implementing it on
a hardware platform. The technology that is provided in this https://doi.org/10.1109/ISMS.2010.60
work has demonstrated some promising performance, and it [13] Kang, S.H., Nguyen, T. (2012). Distance based
has the potential to efficiently handle numerous possible thresholds for cluster head selection in wireless sensor
applications in intelligent transportation systems. networks. IEEE Communications Letters, 16(9): 1396-
1399.
https://doi.org/10.1109/LCOMM.2012.073112.120450
REFERENCES [14] Stankovic, J.A. (2014). Research directions for the
internet of things. IEEE Internet of Things Journal, 1(1):
[1] Jorio, A., El Fkihi, S., Elbhiri, B., Aboutajdine, D. (2015). 3-9. https://doi.org/10.1109/JIOT.2014.2312291
An energy-efficient clustering routing algorithm based [15] Duan, J., Gao, D., Yang, D., Foh, C.H., Chen, H.H.
(2014). An energy-aware trust derivation scheme with
on geographic position and residual energy for wireless
game theoretic approach in wireless sensor networks for
sensor network. Journal of Computer Networks and
Communications, 2015: 170138. IoT applications. IEEE Internet of Things Journal, 1(1):
https://doi.org/10.1155/2015/170138 58-69. https://doi.org/10.1109/JIOT.2014.2314132
[2] Tyagi, S., Kumar, N. (2013). A systematic review on [16] Junping, H., Yuhui, J., Liang, D. (2008). A time-based
clustering and routing techniques based upon LEACH cluster-head selection algorithm for LEACH. In 2008
IEEE Symposium on Computers and Communications,
protocol for wireless sensor networks. Journal of
Marrakech, Morocco, pp. 1172-1176.
Network and Computer Applications, 36(2): 623-645.
https://doi.org/10.1016/j.jnca.2012.12.001 https://doi.org/10.1109/ISCC.2008.4625714
[3] Abd Ellatief, W., Younes, O., Ahmed, H., Hadhoud, M. [17] Maraiya, K., Kant, K., Gupta, N. (2011). Efficient cluster
(2016). Energy efficient density-based clustering head selection scheme for data aggregation in wireless
technique for wireless sensor network. In 2016 8th sensor network. International Journal of Computer
Applications, 23(9): 10-18.
International Conference on Knowledge and Smart
Technology (KST), Chiang Mai, Thailand, pp. 196-200. [18] Singh, B., Lobiyal, D.K. (2012). A novel energy-aware
https://doi.org/10.1109/KST.2016.7440509 cluster head selection based on particle swarm
[4] Bian, Q., Zhang, Y., Zhao, Y. (2010). Research on optimization for wireless sensor networks. Human-
clustering routing algorithms in wireless sensor networks. Centric Computing and Information Sciences, 2(1): 1-18.
In 2010 International Conference on Intelligent https://doi.org/10.1186/2192-1962-2-13
[19] Rao, P.S., Jana, P.K., Banka, H. (2017). A particle swarm
Computation Technology and Automation, Changsha,
China, pp. 1110-1113. optimization based energy efficient cluster head selection
https://doi.org/10.1109/ICICTA.2010.343 algorithm for wireless sensor networks. Wireless
[5] Zhang, P., Xiao, G., Tan, H.P. (2013). Clustering Networks, 23: 2005-2020.
algorithms for maximizing the lifetime of wireless sensor https://doi.org/10.1007/s11276-016-1270-7

71
[20] Shankar, A., Jaisankar, N., Khan, M.S., Patan, R., cities applications. Journal of Sensor and Actuator
Balamurugan, B. (2019). Hybrid model for security‐ Networks, 10(3): 50.
aware cluster head selection in wireless sensor networks. https://doi.org/10.3390/jsan10030050
IET Wireless Sensor Systems, 9(2): 68-76. [24] Ahmad, H., Kohli, N. (2021). LBCM: Energy-efficient
https://doi.org/10.1049/iet-wss.2018.5008 clustering method in wireless sensor networks.
[21] Fan, X., Song, Y. (2007). Improvement on LEACH Engineering and Applied Science Research, 48(5): 529-
protocol of wireless sensor network. In 2007 536.
International Conference on Sensor Technologies and [25] Singh, J., Deepika, J., Sathyendra Bhat, J., Kumararaja,
Applications (SENSORCOMM 2007), Valencia, Spain, V., Vikram, R., Jegathesh Amalraj, J., Saravanan, V.,
pp. 260-264. Sakthivel, S. (2022). Energy-efficient clustering and
https://doi.org/10.1109/SENSORCOMM.2007.4394931 routing algorithm using hybrid fuzzy with grey wolf
[22] Chen, J., Sackey, S.H., Anajemba, J.H., Zhang, X., He, optimization in wireless sensor networks. Security and
Y. (2021). Energy-efficient clustering and localization Communication Networks, 2022: 9846601.
technique using genetic algorithm in wireless sensor https://doi.org/10.1155/2022/9846601
networks. Complexity, 2021: 1-12. [26] Jagan, G.C., Jesu Jayarin, P. (2022). Wireless sensor
https://doi.org/10.1155/2021/5541449 network cluster head selection and short routing using
[23] Yousif, Z., Hussain, I., Djahel, S., Hadjadj-Aoul, Y. energy efficient ElectroStatic discharge algorithm.
(2021). A novel energy-efficient clustering algorithm for Journal of Engineering, 2022: 1-10.
more sustainable wireless sensor networks enabled smart https://doi.org/10.1155/2022/8429285

72