Received: September 4, 2021. Revised: October 22, 2021.

188

An Optimized Energy Efficient Routing for Wireless Sensor Network using

Improved Spider Monkey Optimization Algorithm

Ravi Kumar Sanapala1* Sreenivasa Rao Duggirala1

1
Jawaharlal Nehru Technological University Hyderabad,
Department of Electronics and Communication Engineering, India
* Corresponding author’s Email: [email protected]

Abstract: Wireless Sensor Networks (WSNs) contain thousands of small and inexpensive sensor nodes distributed in
the specific area for collecting the desired information from the environment. However, the sensor nodes have
restricted battery energy, hence the random deployment of sensors creates issues while managing the resources for
effective data delivery over the network. Therefore, this research aims to develop an energy-efficient cluster-based
WSN to minimize the energy consumption of the nodes. In this paper, the Low-Energy Adaptive Clustering Hierarchy
(LEACH) algorithm is used for selecting the optimal Cluster Heads (CHs) from the network. Subsequently, the
Improved Spider Monkey Optimization (ISMO) is used for creating the optimal routing through the CHs to the Base
Station (BS) where the multiple fitness functions such as residual energy, distance, and routing traffic are considered
to optimize the ISMO. Hence, the data communication between the intermediate CHs in hierarchical cluster-based
architecture helps to minimize the energy consumption of the nodes. The performance of the proposed LEACH-ISMO
method is analyzed using network lifetime, total energy consumption, normalized overhead, throughput, End-to-End
Delay (EED) and Packet Delivery Ratio (PDR). The existing methods namely Fuzzy C-Means (FCM) with Artificial
Bee Colony (ABC), Meta-Heuristic Ant Colony Optimization based Unequal Clustering (MHACO-UC) and
Optimized Quality of Service-based Clustering and Multipath Routing Protocol (OQoS-CMRP) are used to evaluate
the LEACH-ISMO method. The PDR of the LEACH-ISMO method is 96.7 % for 200s, which is high when compared
to the FCM-ABC, MHACO-UC and OQoS-CMRP.
Keywords: Cluster head, Energy consumption, Improved spider monkey optimization, Low-energy adaptive
clustering hierarchy algorithm, Packet delivery ratio.

are the three main capacities of the sensors [5]. Each

1. Introduction sensor node in the network observes the information
from its nearby environment and transmits it to the
Wireless sensor networks (WSNs) combine
important location namely base station (BS) or sink.
communication technology, distributed information
Subsequently, the transmitted data is analyzed in the
processing technology, embedded computing
BS to achieve decision-making for diverse
technology, and sensor technology to accomplish
applications [6]. The sensors in the WSN sense
wireless communications [1]. In general, the WSN is
various data such as pictures, video, temperature,
highly distributive and it is self-organized in its
humidity, pressure and so on [7]. Specifically, the
functionality which comprises the numerous tiny
WSN is used in an extensive range of applications in
sensor nodes in the network. Since, the sensor node
various fields such as military, agriculture and
contains various components such as sensor,
transportation [8, 9].
processor and communication unit [2-4]. The sensor
The power supply is considered an important part
nodes are battery-operated devices that observe the
of the sensor node that is used to supply the required
information from the environment and transmit it to
energy to the processors, sensors and transceiver. But,
the destination for performing an immediate action.
the restricted energy of the battery leads to the early
Moreover, sensing, processing and communicating
exhaustion of network because of the extreme usage
International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 189

of the nodes. The energy efficiency is considered to concluded the LEACH-ISMO method with future
be a challenging issue, due to the deployment of the scope.
sensors in the complex environment [10]. Clustering
and routing are considered as two essential processes 2. Literature survey
developed for energy efficiency of the WSN. The
Zongshan [18] presented the improved ABC to
energy consumption of the nodes is minimized by
select the CHs from the network, since the optimal
using the clustering techniques in WSN. Accordingly,
clustering was found by optimizing the FCM using
the sensors are separated into various groups called
the ABC algorithm. Subsequently, an enhanced
clusters, where a CH is selected from each cluster
version of the ant colony algorithm was developed to
[11-13]. The CHs selected inside the cluster perform
accomplish an energy-efficient routing algorithm.
the critical operations such as data collection and
However, the developed ant-based routing algorithm
transmission. However, the CHs forward the
considered only the energy-distance factor. Guleria
aggregated data packets to the BS on behalf of their
and verma [19] presented the meta-heuristic ant
own cluster members, hence there is a possibility of
colony optimization based unequal clustering
rapid energy depletion in the CHs. This rapid energy
(MHACO-UC) to perform an effective CH and
exhaustion causes the routing interruption and
transmission path selection. The principle of
network disconnection [14-16]. On the other hand,
rendezvous node was developed in the unequal
the communication task utilizes higher energy than
clustering for enhancing the lifetime of CH. However,
the sensing and processing tasks. Therefore, it is
the ACO used in the WSN found the shortest path for
essential to develop the energy efficient protocol for
transmission which failed to consider the energy of
minimizing the energy consumption while
the nodes.
transmitting the data packets [17]. The existing
Deepa and suguna [20] developed the optimized
researches are used to accomplish the routing over the
QoS-based clustering and multipath routing protocol
WSN are FCM with ABC [18], meta-heuristic ant
(OQoS-CMRP) to minimize energy consumption.
colony optimization based unequal clustering
The multi-hop communication path was found by
(MHACO-UC) method [19], modified particle
using the singlesink-AllDestination algorithm.
swarm optimization [20], firefly based routing [21],
However, the OQoS-CMRP method failed to perform
beesearch [22] and multi-constraints QoS routing
the fault tolerance during the communication. Giva
[23]. The explanation of the aforementioned existing
andriana mutiara [21] presented the firefly
researches are given in the following sections.
synchronization multi-hop - geographical energy-
Therefore, recent researchers aimed to improve
aware routing (FSM-GEAR) method was utilized to
the performance by adopting various protocols and
improve the energy efficiency by minimizing the
algorithms. The main contributions of this research
transmission distance. Moreover, the waiting time
paper are given as follows: In this LEACH-ISMO
was reduced by conducting the firefly
method, the LEACH protocol is designed for finding
synchronization among nodes. However, the weight
direct gateway node (i.e., CH) and the ISMO is
was calculated only by the distance, energy and
designed on the optimized routing path detection
power consumption. For a better routing path
states. With this LEACH-ISMO method, the overall
generation, the routing traffic also required to be
performance is improved. The problem of this
considered for minimizing the packet loss.
approach is that most of the WSNs are used in large-
Mann and singh [22] presented the WSN routing
scale applications. But, the sensors nodes having a
strategy using the swarm intelligence approach. The
restricted battery, so an effective routing method is
assessment of reproduction results shows that
developed in WSN. For providing an energy-efficient
beeswarm performs better as far as packet
network, the LEACH-ISMO method is developed to
transmission, energy utilization, throughput and high
accomplish an effective data transmission. A major
network lifetime when compared to the other swarm
objective of this approach is to improve the network
intelligence based progressive routing protocols.
performance by optimized routing method, which
However, the selection of CH considered only the
adopts the major parameters such as energy, distance
energy and distance in the beeswarm.
and routing traffic for improving the performance is
Mostafaei [23] developed the multi-constraints
that energy and network lifetime.
QoS routing of WSN. QoS routing is one of the basic
This paper is organized as follows. Section 2
difficulties in WSNs, particularly for observation
presents various literature related to this work.
frameworks. To improve the proficiency of the
Section 3 presents the LEACH-ISMO method with
organization with multi constraints QoS boundaries,
algorithm novelty. Section 4 presents the results and
a distributed learning robot based calculation was
its comparative analysis discussion. Section 5
International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 190

developed in WSN. However, this QoS-based routing

doesn’t analyze in the large-scale environment.

3. LEACH-ISMO method
Low energy adaptive clustering hierarchy
(LEACH) is used on the cluster head selection
process in WSN, which also utilizes the gateway
discovery scheme with optimal routing strategy,
which utilizes the spider monkey optimization
algorithm. LEACH protocol utilizes a two-layer
leveled structure with task randomization to similarly
adjust the hubs. The technique can be applied for the
plan of a few kinds of sensor networks that requires
quality, energy productivity, versatility, network
lifetime, and lesser transmission delay. The greater
part of the LEACH variation conventions is intended
to limit energy utilization since sensor hubs are
energy imperatives. QoS relates to a few WSN
execution issues like delay, data transmission,
throughput and lifetime of the network. Fig. 1 shows
the flowchart of the LEACH-ISMO method.
The wireless sensor networks have a base station
and sensor hubs. The communication is carried out in
two ways that are single and multi-hop
communication. The CH uses the single-hop
communication when the BS is in the range of source Figure. 1 Flowchart of LEACH-ISMO method
CH. If the BS is located outside the transmission
range, then the multi-hop transmission is number of passage hubs, which can be sent in the
accomplished using ISMO. Therefore, the overall network region. The LEACH approach
combination of both the single and multi-hop data includes the development of a cluster of sensor hubs
transmission improves energy efficiency. In the fixated on the got signal quality and the utilization of
greater part of the WSN conventions; energy a nearby CH as a switch to the BS. The decrease in
effectiveness is viewed as a key plan issue to improve energy utilization in information transmission is
the organization’s lifetime. accomplished since the CH is associated with
transmission to the BS instead of individual sensor
3.1 Gateway discovery scheme hubs. LEACH is generally one of the hierarchical
The gateway discovery scheme is used on the clustering protocols which is used to create a cluster
routing path selection of WSN. The CH selection, using the signal strength and to select an optimal CH
optimal route selection, and data transmission are for aggregating the information from its cluster
performed effectively with QoS improvement. Here members. The CHs selected by using the LEACH are
the threshold adopted greedy selection based SMO randomly changed for balancing the energy
algorithm and gateway discovery scheme, are used consumption of the nodes. If the node becomes a CH
with the LEACH protocol. Here the proposed in a network, it cannot be a CH again for 𝑃 rounds.
gateway-based model is used to improve the lifetime The random number generated in the range of [0, 1]
of the network based on random CH selection using and threshold value (𝑇) is calculated by using Eq. (1).
LEACH and appropriate route selection using ISMO. This threshold value is used to select the CH.
They have conveyed sensor hubs in the coherent
𝑃
locales based on their area in the detecting field. They 1
𝑓𝑜𝑟 𝑛𝜖𝐺,
have set the gate hub at the center of the detecting 𝑇(𝑛) = { 1−𝑃.(𝑟.𝑚𝑜𝑑.( ))
𝑃 (1)
field. The entryway hub gathers information from 0 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
different hubs in the field and sends it to the base
station (BS). Where, the required CH percentage is 𝑃 (e.g.,
Additionally, there is no requirement on the 𝑃 = 0.05); the number of nodes in the network is 𝑛,
the group of nodes that haven’t been selected as CH
International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 191

is represented as 𝐺 and the number of rounds are probability computation for the spider monkey 𝑖 .
represented as 𝑟. Hence, the optimal node is chosen Here, the fitness is calculated based on the distance
as CH based on the threshold value. between the individuals and their food source.

3.2 Improved spider monkey optimization for 𝑓𝑖𝑡𝑛𝑒𝑠𝑠

𝑖
𝑃𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 = 0.9 × (𝑀𝑎𝑥𝐹𝑖𝑡𝑛𝑒𝑠𝑠 ) + 0.1 (3)
data transmission
Optimization techniques are utilized for Eq. (4) shows the generation of trail location for
discovering the ideal node of groups and choosing the spider monkey.
ideal quantities of node (optimal selection) in
completely proposed LEACH replacements. 𝑠𝑚𝑛𝑒𝑤 𝑗 = 𝑠𝑚𝑖𝑗 + 𝑅(0,1) × (𝑔𝑙𝑗 − 𝑠𝑚𝑖𝑗 ) +
Streamlining can be utilized for the ideal situation of 𝑅(−1,1) × (𝑠𝑚𝑟𝑗 − 𝑠𝑚𝑖𝑗 ) (4)
sensor hubs and directing the way from hubs to the
BS.
Where, the 𝑖 𝑡ℎ spider monkey’s fitness and
3.2.1. Overview of SMO fitness for the entire population are represented as
𝑓𝑖𝑡𝑛𝑒𝑠𝑠𝑖 and 𝑀𝑎𝑥𝐹𝑖𝑡𝑛𝑒𝑠𝑠 respectively; location of
SMO is generally a population-based algorithm current global leader group for the coordinate 𝑗 is
that is inspired by the social behavior of spider represented as 𝑔𝑙𝑗 ; location of random chosen
monkeys. This SMO mainly depends on the activities
𝑟 𝑡ℎ member for the coordinate 𝑗 is represented as
of spider monkeys which imitates the fission-fusion
𝑠𝑚𝑟𝑗 . Furthermore, the fitness of generated location
social structure. Moreover, SMO comprises of six
iterative phases which are explained as follows: and current location are compared to adopt a better
solution.
a. Local leader phase
c. Global and local leader learning phase
Initially, the current swarm is updated in this local
leader phase. A fresh trial location is generated for In global leader learning, the spider monkey
each spider monkey by using a current location, which has the best fitness value is updated as a global
location of the local leader and a randomly chosen leader. Similarly, the greedy selection is used in the
member of the group are used to accomplish the local local leader learning to choose the local leaders for
leader phase. The perturbation rate value is used to each group.
update each dimension of the solution. The
d. Local and global leader decision phase
generation of trial location (𝑠𝑚𝑛𝑒𝑤 𝑗 ) is expressed in
the Eq. (2). In the local leader decision phase, the random
initialization or integration of global and local leaders
𝑠𝑚𝑛𝑒𝑤 𝑗 = are considering for updating the location of local
𝑠𝑚𝑖𝑗 + 𝑅(0,1) × (𝑙𝑙𝑘𝑗 − 𝑠𝑚𝑖𝑗 ) + leaders up to the predefined threshold namely local
leader limit. On the other hand, global leaders are
{𝑅(−1,1) × (𝑠𝑚𝑖𝑗 − 𝑠𝑚𝑖𝑗 ) 𝑖𝑓 𝑅(0,1) ≥ 𝑝𝑟 (2) separated into small groups, when it is not updated up
𝑠𝑚𝑖𝑗 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 to predefined iterations namely global leader limit.
Subsequently, the population is separated until
Where, location of 𝑖 th spider monkey for the achieving the maximum groups and the local leader
coordinate 𝑗 is represented as 𝑠𝑚𝑖𝑗 ; 𝑅(0,1) and learning is utilized for selecting the leader from the
𝑅(−1,1) are the uniform random numbers between generated groups. Next, all the single groups are
the 0 & 1, and -1 & 1; location of 𝑘 𝑡ℎ local leader combined to generate the single group, when the
group for the coordinate 𝑗 is represented as 𝑙𝑙𝑘𝑗 and location of a global leader is not updated and
maximum groups are generated in the SMO.
the perturbation rate is defined as 𝑝𝑟 . The new
location is taken, when the generated location 3.2.2. Routing path identification using ISMO
achieves improved fitness than the current location.
In ISMO, the subgroups are integrated into a
b. Global leader phase single group, when the position is not updated by the
global optimal value. This process is utilized for
This global leader phase updates only one
balancing the exploitation and exploration capacity
solution which is randomly chosen from the entire
while maintaining the convergence speed. Therefore,
population. The chosen spider monkey has the chance
the ISMO is tried to balance the population diversity
to update based on its probability. Eq. (3) shows the
International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 192

by using three distinct fitness parameters energy,

distance, routing traffic which leads to improving the
route selection process in the WSN. Population
initialization of SMO depends on the routing area and
sensor utility. Then, local leader and global leader
considerations are performed for grouping clusters.
Here the LLP uses a greedy selection process with
threshold adjustment logic and this can adjust the
location of clusters by a fitness function. The GLP
modify their position based on the higher cluster head
value. In this, the greedy selection process helps to
find the optimal solution of CHs and it is updated
with current CHs position. Then it is labeled with new
position and the threshold limit count of global leader
is acted to update the new position of CH. With the
help of local leader decision and global leader
decision, the CH is selected on end criteria of 100th
iteration. The flow chart of SMO approach in CHs
routing is shown in Fig. 2.
CH selection in ISMO procedure:

• Routing structure of clusters.

• Formation of cluster heads.

𝐶𝐻 = 𝑃𝑟𝑜𝑏𝑖𝑡 × 𝑇𝐶𝐻 (5)

Where, 𝑃𝑟𝑜𝑏𝑖𝑡 denotes probability of each Figure. 2 Flow chart of SMO approach in CHs routing
iteration in clusters and 𝑇𝐶𝐻 represents the total
based on energy and network lifetime. Probability
cluster heads used on the network with maximum
evaluation of LLP and GLP is obtained by using Eq.
iteration level.
(7) in Eq. (3).
• Measure the energy of sensor nodes ‘𝐸𝑛 ’ and After cluster development, CHs are assigned that
distance of each sensor nodes ‘𝐷𝑛 ’ to the base are used as an innovator in each group. CHs are
station. burdened with the obligation regarding information
Distance evaluation is given by, accumulation and performing routing for its group
part’s data to the base station. Likewise, the groups
𝐷𝑛 = √(𝑎)2 + (𝑏)2 (6) that comprise of multi-hubs have a higher weight than
bunches with less hubs as the CHs for those
Where, a and b are the active sensor nodes enormous estimated groups need to get, total and
• Update the energy requirement of cluster head communicate more information.
with higher-level priority. A CH can be chosen arbitrarily or pre-allotted by
• Data aggregation within the cluster’s the architect of the organization. A CH can likewise
information. be chosen by contemplating the remaining energy of
• Data transmission based on nearest cluster heads hubs in the group. The CHs are known to have higher
to higher-level CH/BS. weights than part hubs; along these lines, the job of
• Maximum energy updated cluster heads by CH is changed to share the weight and consequently
updating fitness value. improve the lifetime of those clusters. The energy
considered in the ISMO is used to avoid the node/link
1
𝑓𝑖𝑡𝑛𝑒𝑠𝑠 (𝑛) =∝ 𝐸𝑛 + 𝛽 𝑇𝑟 + 𝛾 𝐷
1
(7) failure while transmitting the data packets.
𝑛 𝑛 Subsequently, the energy consumption of the node is
minimized based on the distance and energy used in
Where, 𝐸𝑛 represents the energy, 𝐷𝑛 represents the fitness function. Specifically, the shortest path
the distance, 𝑟𝑛 represents routing traffic node 𝑇 with identification of ISMO results in lesser energy
a number of nodes 𝑛 and ∝, 𝛽, 𝛾 are the weighted consumption which leads to an increase the energy
coefficients. Better QoS performance is obtained efficiency of the WSN.
International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 193

4. Results and discussion nodes and connectivity that exist in the network,
hence the energy consumption should be minimized
The results and discussion of the LEACH-ISMO for achieving a better lifetime.
method is clearly explained in this section. The Fig. 3 shows the network lifetime comparison of
implementation and simulation of the LEACH-ISMO
the FCM-ABC [18], MHACO-UC [19], OQoS-
method is done in the Network simulator-2.34 where
CMRP [20] and LEACH-ISMO method. Fig. 3
the system functions with 4-GB RAM and Intel core clearly shows that the LEACH-ISMO method
processor. The simulation parameters of the LEACH- achieves a higher lifetime than the FCM-ABC [18],
ISMO method are mentioned in Table 1. MHACO-UC [19] and OQoS-CMRP [20]. The
The performance of the LEACH-ISMO method is network lifetime of the LEACH-ISMO method is
analyzed by means of network lifetime, total energy increased, because of its random CH selection and
consumption, normalized overhead, throughput, EED shortest path identification during the communication.
and PDR. The existing methods such as FCM-ABC, Since, the transmission path with lesser distance
OQoS-CMRP and MHACO-UC methods are used to leads to obtain less energy consumption which helps
evaluate the performance of the LEACH-ISMO
to increase the network lifetime.
method, where the existing methods are implemented
and simulated by using the same specifications 4.2 Total energy consumption
mentioned in Table 1.
The sensor’s energy consumption is the
4.1 Network lifetime difference among its initial energy and residual
energy.
Network lifetime generally depends on the alive The comparison of energy consumption for the
LEACH-ISMO method with FCM-ABC [18],
Table 1. Simulation parameters
MHACO-UC [19] and OQoS-CMRP [20] are shown
Parameters Values
Area 300𝑚 × 200𝑚
in Fig. 4. The energy consumption of the LEACH-
Number of nodes 50, 100, 150, 200 & 250 ISMO method is less when compared to the FCM-
MAC Type IEEE 802.15.4 ABC [18], MHACO-UC [19] and OQoS-CMRP [20].
Radio Propagation Model Two-ray ground Due to the shortest path identification of the ISMO,
reflection model the energy consumption of the nodes is minimized
Queue Type Priority Queue while transmitting the data packets.
Channel Type Channel/wireless
Antenna Type Omnidirectional 4.3 Normalized overhead
Traffic source CBR
Normalized overhead is the ratio between the
Data Packet size 128 bytes
Control Packet size 32 bytes
amount of forwarded control packets and the amount
The initial energy of nodes 3 Joules of data packets received by the BS.
Simulation time 500 s Fig. 5 shows the normalized overhead

Figure. 3 Network lifetime Figure. 4 Energy consumption

International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 194

Figure. 5 Normalized overhead

Figure. 6 Throughput
comparison of the FCM-ABC [18], MHACO-UC
[19], OQoS-CMRP [20] and LEACH-ISMO method.
Fig. 5 clearly shows that the LEACH-ISMO method
achieves less normalized overhead than the FCM-
ABC [18], MHACO-UC [19] and OQoS-CMRP [20].
The FCM-ABC [18], MHACO-UC [19] and OQoS-
CMRP [20] achieves higher control overhead
because it broadcasts high amount of control picketer
while generating the data transmission path. But, the
LEACH-ISMO requires only less amount of control
packets due to the fitness function considered in the
ISMO.

4.4 Throughput
Throughput is defined as the number of packets
successfully received at the BS in certain time.
The comparison of throughput for the LEACH-
ISMO method with FCM-ABC [18], MHACO-UC
[19] and OQoS-CMRP [20] are shown in Fig. 6. The
Figure. 7 End to end delay
throughput of the LEACH-ISMO method is high
when compared to the FCM-ABC [18], MHACO-UC
Fig. 7 shows the EED comparison of the FCM-
[19] and OQoS-CMRP [20]. The throughput of the
ABC [18], MHACO-UC [19], OQoS-CMRP [20]
LEACH-ISMO method is increased by minimizing
and LEACH-ISMO methods. Fig. 7 clearly shows
the energy consumption of the nodes. Because, if the
energy is exhausted in the transmitting node, the that the LEACH-ISMO method achieves lesser EED
than the FCM-ABC [18], MHACO-UC [19] and
packet loss occurs in the WSN. On the other hand, the
OQoS-CMRP [20]. The EED of the LEACH-ISMO
energy considered in the ISMO’s fitness function
helps to avoid node failure in the routing path. method is reduced because of the less processing
delay and less transmission delay achieved by the
Therefore, the throughput of the LEACH-ISMO
method is increased by avoiding node failure. shortest path identification of ISMO.

4.5 End to end delay 4.6 Packet delivery ratio

PDR is generally the ratio between the amount of
EED is calculated as the total amount of time
utilized by the data packet to be forwarded from the data packets received by the BS and the amount of
data packets forwarded by the source node.
source node to the BS.
The comparison of PDR for the LEACH-ISMO
International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 195

Table 2. Comparative analysis of network lifetime, total energy consumption and normalized overhead for LEACH-
ISMO in terms of number of nodes
Performances Methods Number of nodes
50 100 150 200 250
Network lifetime (s) FCM-ABC [18] 22360 21200 18920 18000 17500
MHACO-UC [19] 22000 21090 18690 17900 17050
OQoS-CMRP [20] 23000 21500 19000 18500 18000
LEACH-ISMO 24500 23010 21500 20100 19800
Total energy consumption (J) FCM-ABC [18] 3.2 6 9.7 11 13.5
MHACO-UC [19] 3.6 6.8 10.2 11.8 14.1
OQoS-CMRP [20] 3 5.5 8 10.5 12
LEACH-ISMO 2.8 5.0 6.9 8.7 11.3
Normalized overhead (%) FCM-ABC [18] 2.2 4.2 5 7.1 8.5
MHACO-UC [19] 2.4 4.7 6.2 7.5 9.3
OQoS-CMRP [20] 2 4 4.5 6 7
LEACH-ISMO 2 3.8 4.1 5.7 6.9

Table 3. Comparative analysis of throughput, EED and PDR for LEACH-ISMO in terms of simulation time
Performances Methods Simulation time (s)
100 200 300 400 500
Throughput (Kbps) FCM-ABC [18] 46 49 54 60 61
MHACO-UC [19] 44 49 51 58 60
OQoS-CMRP [20] 48 51 56 60 63.5
LEACH-ISMO 53 55 61 66 71
EED (ms) FCM-ABC [18] 0.023 0.031 0.031 0.033 0.038
MHACO-UC [19] 0.025 0.033 0.033 0.035 0.04
OQoS-CMRP [20] 0.021 0.03 0.031 0.031 0.035
LEACH-ISMO 0.018 0.027 0.029 0.03 0.034
PDR (%) FCM-ABC [18] 94.3 92 90.5 90 85
MHACO-UC [19] 93 91.2 88 87.3 85
OQoS-CMRP [20] 95 93 92 89 87
LEACH-ISMO 98.9 96.7 95.2 94.3 93.0

the LEACH-ISMO method is high when compared to

the FCM-ABC [18], MHACO-UC [19] and OQoS-
CMRP [20]. The higher network lifetime of LEACH-
ISMO method helps to increase the PDR of the
network. Further, the packet loss is minimized by
avoiding the node failure by considering the residual
energy of CH in the ISMO’s fitness function.
Tables 2 and 3 show the comparative analysis of
the LEACH-ISMO method in terms of number of
nodes and simulation time respectively. From Tables
2 and 3, it is concluded that the LEACH-ISMO
method provides better performance than the
MHACO-UC [19] and OQoS-CMRP [20]. For
example, the PDR of the LEACH-ISMO method is
96.7 % for 200s which is high when compared to the
FCM-ABC [18], MHACO-UC [19] and OQoS-
CMRP [20]. The existing methods MHACO-UC [19]
and OQoS-CMRP [20] obtains less performance
because it failed to avoid the node failure/ link failure
Figure. 8 Packet delivery ratio during the data transmission. Additionally, the FCM-
ABC [18] failed to consider the routing traffic during
method with FCM-ABC [18], MHACO-UC [19] and routing path generation. The packet loss of the
OQoS-CMRP [20] are shown in Fig. 8. The PDR of network is high, when there is high traffic between

International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
Received: September 4, 2021. Revised: October 22, 2021. 196

the nodes. However, the LEACH-ISMO method Networks”, Journal of Systems and Software, Vol.
avoids node failure by considering the residual 146, pp. 196-214, 2018.
energy of the node during the routing path generation [2] K. Muthukumaran, K. Chitra, and C. Selvakumar,
which helps to improve the packet delivery over the “An Energy Efficient Clustering Scheme Using
network. The route traffic consideration of LEACH- Multilevel Routing for Wireless Sensor
ISMO leads to minimize the packet loss over the Network”, Computers & Electrical Engineering,
network. Subsequently, the shortest path Vol. 69, pp. 642-652, 2018.
identification using the ISMO leads to minimizing [3] S. M. Bozorgi and A. M. Bidgoli, “HEEC: A
the energy consumption of the nodes, and thus results Hybrid Unequal Energy Efficient Clustering for
in a higher network lifetime. Meanwhile, the Wireless Sensor Networks”, Wireless Networks,
appropriate fitness function of ISMO doesn’t require Vol. 25, pp. 4751–4772, 2019.
a high amount of control packets during the route [4] A. Panchal and R. K. Singh, “EHCR-FCM:
discovery process, hence it used to minimize the Energy efficient hierarchical clustering and
control overhead of the LEACH-ISMO method. routing using fuzzy C-means for wireless sensor
networks”, Telecommunication Systems, Vol. 76,
5. Conclusion No. 2, pp. 251-263, 2021.
[5] R. Sharma, V. Vashisht, and U. Singh, “EEFCM-
In this paper, the gateway discovery is done by
DE: Energy-Efficient Clustering based on Fuzzy
using LEACH and routing is done by using ISMO to
C Means and Differential Evolution Algorithm in
improve the performances of WSN. Here the spider
WSNs”, IET Communications, Vol. 13, No. 8, pp.
monkey optimization algorithm is applied to the
996-1007, 2019.
routing network for finding optimal cluster heads.
[6] P. S. Mann and S. Singh, “Artificial Bee Colony
Quality of service is improved for major parameters
Metaheuristic for Energy-Efficient Clustering
of WSN which are energy consumption, network
and Routing in Wireless Sensor Networks”, Soft
lifetime, and throughput. The comparison results
Computing, Vol. 21, pp. 6699-6712, 2017.
show that the LEACH-ISMO method achieves better
[7] S. P. Singh and S. Sharma, “Genetic-Algorithm-
performance than existing FCM-ABC, MHACO-UC
Based Energy-Efficient Clustering (GAEEC) for
and OQoS-CMRP. The routing of WSN analyses the
Homogenous Wireless Sensor Networks”, IETE
performance of WSN parameters such as energy
Journal of Research, Vol. 64, pp. 648-659, 2018.
consumption, throughput, packet delivery rate,
[8] Z. Zhao, K. Xu, G. Hui, and L. Hu, “An Energy-
packet loss, end-to-end delay and network lifetime.
Efficient Clustering Routing Protocol for
The PDR of the LEACH-ISMO method is 96.7 % for
Wireless Sensor Networks Based on AGNES
200s, which is high when compared to the FCM-ABC,
with Balanced Energy Consumption
MHACO-UC and OQoS-CMRP. In the future, an
Optimization”, Sensors, Vol. 18, p. 3938, 2018.
adaptive path can be selected by using the hybrid
[9] K. Xu, Z. Zhao, Y. Luo, G. Hui, and L. Hu, “An
optimization algorithm for improving the overall
Energy-Efficient Clustering Routing Protocol
performances.
based on a High-QoS Node Deployment with an
Inter-Cluster Routing Mechanism in WSNs”,
Conflicts of interest Sensors, Vol. 19, No. 12, p. 2752, 2019.
The authors declare no conflict of interest. [10] S. M. Palvinder and S. Satvir, “Energy Efficient
Clustering Protocol based on Improved
Author contributions Metaheuristic in Wireless Sensor Networks”,
Journal of Network and Computer Applications,
The paper background work, conceptualization,
Vol. 83, pp. 40-52, 2017.
methodology, dataset collection, implementation,
[11] S. K. Gupta and P. K. Jana, “Energy Efficient
result analysis and comparison, preparing and editing
Clustering and Routing Algorithms for Wireless
draft, visualization have been done by first author.
Sensor Networks: GA Based Approach”,
The supervision, review of work and project
Wireless Personal Communications, Vol. 83, pp.
administration, has been done by second author.
2403–2423, 2015.
[12] P. Nayak and B. Vathasavai, “Energy Efficient
References Clustering Algorithm for Multi-Hop Wireless
[1] T. Wang, G. Zhang, X. Yang, and A. Vajdi, Sensor Network Using Type-2 Fuzzy Logic”,
“Genetic Algorithm for Energy-Efficient IEEE Sensors Journal, Vol. 17, No. 14, pp. 4492-
Clustering and Routing in Wireless Sensor 4499, 2017.

International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18
 Received: September 4, 2021. Revised: October 22, 2021. 197

[13] D. I. Reddy, C. Puttamadappa, and H. N. Suresh, IEEE Transactions on Industrial Electronics, Vol.
“Merged glowworm swarm with ant colony 66, No. 7, pp. 5567–5575, 2019.
optimization for energy efficient clustering and
routing in Wireless Sensor Network”, Pervasive
and Mobile Computing, Vol. 71, p. 101338, 2021.
[14] A. Rodríguez, C. D. V. Soto, and R. Velázquez,
“Energy-Efficient Clustering Routing Protocol
for Wireless Sensor Networks based on Yellow
Saddle Goatfish Algorithm”, Mathematics, Vol.
8, No. 9, p. 1515, 2020.
[15] N. Mittal, U. Singh, and B. S. Sohi, “A Stable
Energy Efficient Clustering Protocol for Wireless
Sensor Networks”, Wireless Networks, Vol. 23,
No. 6, pp. 1809-1821, 2017.
[16] K. Haseeb, B. K. Abu, A. Ahmed, T. Darwish,
and I. Ahmed, “WECRR: Weighted Energy-
Efficient Clustering with Robust Routing for
Wireless Sensor Networks”, Wireless Personal
Communications, Vol. 97, No. 1, pp. 695-721,
2017.
[17] N. Morsy, E. Abdelhay, and S. Kishk, “Proposed
Energy Efficient Algorithm for Clustering and
Routing in WSN”, Wireless Personal
Communications, Vol. 103, No. 3, pp. 2575-2598,
2018.
[18] W. Zongshan, D. Hongwei, L. Bo, B. Liyong, and
Y. Zhijun, “An Energy Efficient Routing
Protocol Based on Improved Artificial Bee
Colony Algorithm for Wireless Sensor
Networks”, IEEE Access, Vol. 8, pp. 133577-
133596, 2020.
[19] K. Guleria and A. K. Verma, “Meta-heuristic Ant
Colony Optimization Based Unequal Clustering
for Wireless Sensor Network”, Wireless Personal
Communications, Vol. 105, pp. 891–911, 2019.
[20] O. Deepa and J. Suguna, “An Optimized QoS-
based Clustering with Multipath Routing
Protocol for Wireless Sensor Networks”, Journal
of King Saud University-Computer and
Information Sciences, Vol. 32, No. 7, pp. 763-774,
2020.
[21] G. A. Mutiara, O. Mohd, N. Suryana, and A. N.
Pee, “Weights-Based Energy-Efficient Wireless
Sensor Network Protocol with Firefly
Synchronization for Illegal Logging”,
International Journal of Intelligent Engineering
and Systems, Vol. 14, No. 3, 2021.
[22] P. S. Mann and S. Singh, “Energy-Efficient
Hierarchical Routing for Wireless Sensor
Networks: A Swarm Intelligence Approach”,
Wireless Personal Communications, Vol. 92, No.
2, pp. 785–805, 2017.
[23] H. Mostafaei, “Energy-Efficient Algorithm for
Reliable Routing of Wireless Sensor Networks”,

International Journal of Intelligent Engineering and Systems, Vol.15, No.1, 2022 DOI: 10.22266/ijies2022.0228.18