Energy e cient cluster-based routing protocol for

Wireless Sensor Network using Nature Inspired

Mechanism
Rashmi Mishra (  [email protected] )
Delhi Technological University https://orcid.org/0000-0003-0015-8732
Rajesh K. Yadav
Delhi Technological University Department of Computer Engineering

Research Article

Keywords: Wireless Sensor Networks, Energy E ciency, Throughput, Delay, Nature Inspired Algorithm

Posted Date: June 13th, 2022

DOI: https://doi.org/10.21203/rs.3.rs-1618701/v1

License:   This work is licensed under a Creative Commons Attribution 4.0 International License.
Read Full License
Energy efficient cluster-based routing protocol for Wireless Sensor Network
using Nature Inspired Algorithm
1RashmiMishra, 2Rajesh K. Yadav
1Ph.D. Scholar
1-2Delhi Technological University, Delhi, India

Abstract:

WSN consist of tiny sensors which are distributed over the entire network having capabilities of sensing the data, processing it
and convey it from one node to another node. The purpose of the study is to minimize the power utilization per round and elevate
the network lifespan. In the present case, the nature inspired mechanisms are used to minimize the power utilization of the
network. In the proposed study Butterfly Optimization Mechanism is used to choose the optimum quantity of CH from the dense
nodes. The parameter is to be considered for the choosing of the CH is the remaining power of the node, interspace from the
other nodes in the network, interspace from the BS, node centrality and node degree. The PSO is used to form the CH by choosing
certain parameters such as interspace from the CH and the BS. The path is choosing by means of the Ant Colony Optimization
(ACO) Mechanism. The route is optimized by the interspace, node degree and the choose remaining power. The inclusive
performance of the projected protocol is measured in terms of stability period, quantity of active nodes, data acknowledged by
the BS and the overall power utilization of the network. The results of the put redirect methodology are correlated with the extant
mechanisms such as LEACH, DEEC, DDEEC, EDEEC [50-53] and also correlated with the swarm mechanisms such as CRHS,
BERA, FUCHAR, ALOC, CPSO, FLION. This review will help investigators to discover the applications in this arena.

Keyword: Wireless Sensor Networks, Energy Efficiency, Throughput, Delay, Nature Inspired Algorithm

1. INTRODUCATION

With concern of Wireless Sensor networks lifespan, nature-inspired mechanisms are evolving as an appropriate technique. For
increasing the lifespan of the network or in order to decrease sensing the unnecessary data by the battery-driven sensors, optimal
network scope plays an important role. To sense and store the actual data from the nature, the large quantity of geographically
distributed sensors communicated along the wireless means, it is formally known as Wireless Sensor networks (WSNs) [1].
Sensors are operating like repeater as they will accept the data, convert the analogue to digital form and redirect the data to the
other nodes, CH and the sink. The BS will collect the data, analyze it and take decision as per the application. There are various
parameters on which WSN architecture is depend such as fault tolerance (sensor node will redirect the packet and acknowledged
the packet if some of the sensors get drained), scalability (how network will work if sensors will be added or removed), stability,
power efficiency. These sensors are battery powered. So, after some time, the power of the sensors will get depleted and it affects
the entire lifespan of the network. The purpose of the study is to maximize the network lifespan by increasing the quantity of
nodes per round, data send to the BS and the optimal quantity of CH choosing. In the extant case, optimal network scope,
clustering mechanism and the path choosing are mostly used in the WSNs to elevate the lifespan of the network.

WSN consist of tiny sensors which are distributed over the entire network having capabilities of sensing the data, processing it
and convey it from one node to another node. These sensors sense the nature, evaluate, send and accept it. Military, weather
forecasting, industrial area, medical services, agriculture or many other applications use the WSN for the data transmission.
Sensors are limited battery powered and very compact in size. Once, sensors are placed in the harsh and no-man nature, these
sensors will be used in the adequate way because it cannot be replaced and charged. Nodes drain their power in two ways such
as sensing the natural data and conveying the data to the BS [2-10]. Most of the work has been done to maximize the entire
lifespan of the network by saving the power of the sensors. Liank et al. [11] has put redirect the mechanism named as Huang
mechanism, aims is to balance the power utilization in the entire network by using optimal choosing of clusters in the entire
network. But the restriction of this mechanism is, it is very complex and if in case the data size of the packet is large then it may
block the channel. In contract, Cardei et al. [12] have put redirect TianD mechanism, in which sensors nodes are arranged in
disjoint set form to cover the maximal range. As compare to the Hunag mechanism, TianD mechanism is less complex in nature.
However, the mechanism will not able to find the duplicate nodes and data in the nature.

2. LITERATURE SURVEY

The challenges faced by the wireless sensor network are power constraint, correct detection of data, and non-duplicate data, the
sensors need to be placed in such a way that they in appropriate interspace from each other but considering the uncovered area
which leads to the scope hole or blind area problem. For the above stated problem, Wang et al. [13] has put redirect a mechanism
named as Scope Configuration Protocol. The protocol is well suited for the nature where the quantity of sensors is less or
significant. After the literature survey, the two problems have been observed, i.e., power depletion of the sensors and the sensor
node scope problem and there exit aback-and-forth between these two problems. In the literature, may authors have put redirect
the solution for the individual problem but not provide collectively. After the survey, keeping the extant problems, we have
collectively considered the problem and put redirect the multi-purpose optimization mechanism. There are various mechanisms
are published in the literature for the WSN by using nature-inspired mechanisms [14-18]. There are multiples mechanisms put
redirect by the authors to cover the optimal scope in WSN [19-21]. In [19], Metaheuristics for the deployment problem of WSN:
A review, discuss ethe various types of issues while deploying the sensors in the nature by using nature-inspired mechanisms.
In [20], Optimal sensor network layout using multi-purpose metaheuristics, author equated the three protocols and highlights the
problem associated with mechanisms in terms of optimal scope. In [21], Transmutative intelligence in wireless sensor network:
routing, clustering, lateralization and scope., have discussed the genetic, transmutative and theoretical, mathematical and
practical applications of the cluster formation, optimal scope of the network and the lateralization problem in WSNs. Other
challenges faced by the WSN is insufficient power of the sensors which leads to the network failure [14-17]. So, the main
dissimilarity between the WSN and the other network is, WSN is oversensitive and vulnerable to the power. So, the optimal
utilization of power mechanism is the esteem necessity for the wireless sensor network [20]. Nature-inspired mechanism is best
suited for cluster formation and choosing the best path will elevate the life of sensors along which the we can elevate the entire
lifespan, stability period and scalability of the network [21-23]. A cluster having CH who communicate with the other CHs in
the network. Most of the power is consumed when the data is transfer in between the CHs and the BS. To turn down the power
utilization in the clustered wireless sensor network, routing mechanism is used in between the CHs and the BS [24-27]. However,
none of the mechanisms deliver serious effects of the problem in the wireless sensor network to cover the optimal solution. The
purpose of the paper is to turn down the power utilization of the network during the data transmission by literature survey of
recent clustering and routing mechanisms. We have also briefed the nature-inspired mechanisms and their applications used in
the wireless sensor networks in terms of capacity, robustness, self-adaptability. We have also discussed the strengths and
weaknesses of the work done by the different researchers in section 3. The optimization mechanism is segregated into three
types such as model based, simulator based, mechanism based. Mechanism based is further bifurcate two parts such as
deterministic and stochastic mechanism. Stochastic mechanism is further bifurcate two parts heuristic and meta-heuristic. The
meta-heuristic mechanism which is further bifurcate four parts i.e., human inspired, geography inspired, physics inspired and
bio-inspired. Bio-inspired mechanism is further bifurcate three parts transmutative, swarm based and plant based [62-64].
Furthermore, there are more than thirty swarm based optimization is put redirect by the researchers. The swarm-based
mechanism is used in wireless sensor network to resolve many extant problems such as to upgrade the power efficiency of the
network, to elevate the network lifespan, to maximize the packet delivery ratio in the network. The conventional routing
protocols are inefficient to upgrade the power constrain of the wireless sensor network. So, to upgrade the power constrain of
the network, researchers used the efficient clustering and routing protocols by the use of swarm-based approach. As per the
research, the Ant Colony Optimization [28] is used to upgrade the power efficiency of the network and one of the efficient
mechanisms for routing. A review chronology of the research is shown in the fig 1. The review is done on the basis of paper
publication in the area of power efficiency, security based, delay, error free protocol and the cluster-based. The most of the paper
were based on the cluster formation and based on the power efficiency upgradient of the network [65-70].

REVIEW CHRONOLOGY
Energy, Security, Delay, Error Energy Efficiency
Security Based Delay less Protocol
Error Free Protocol Cluster-Based
80

70

60
PERCENTAGE

50

40

30

20

10

0
2006 2008 2010 2012 2014 2016 2018 2020 2022
YEAR OF RESEARCH PUBLICATION

Fig 1: Review Chronology

2.1 Classical approaches

In 2002, LEACH was habituated by W. Heinzelman, the sensors choose their CH and form a cluster. CH collect all the data
form the nodes and send the data to the BS. The elected CH will lose their power very fast. In 2017, Wang et al. put redirect a
mechanism named as LEACH-impt [48]. Is LEACH-impt the communication follows the inter-cluster routing. The route is
choosing on the basis of quantity of hops per path, path remaining power, power utilization per round. The overall performance
of LEACH-impt in terms of power efficiency is upgraded but due to arbitrarily choosing of CH and changes in topology, the
data loss is high.

Haseeb et al. put redirect a mechanism named as WECRR (Weighted Power-Efficient Clustering with Robust Routing protocol.
In WECRR [47], the CH is choosing on the basis of deterministic strategy. Secondly, the routing decision is taken based on
multi-facet factors such as traffic density, remaining power and packet error ratio. Furthermore, the route maintenance and load
distribution among the nodes are upgraded by the protocol. But the restriction of the put redirect mechanism is that, the interspace
between the node and the BS is not considered by the protocol. Again, Haseeb et al. has put redirect a mechanism named as
AECR (Aware Cluster Based Routing) [45]. The CH choosing is based on the node density and the position of the node. The
advantages of the mechanism are it turn downs the cluster overhead and communication cost and it mainly focus on the power
of the node. The disadvantage of the mechanism is that it doesn’t focus on interspace between the nodes [28].

Hang and Zhang put redirect a mechanism named as WPO-EECRP [47]. In this protocol, the CH is choosing on the basis of
remaining power, interspace from the node, interspace from node to BS and the cluster density. The mechanism works well
when there is adjacent quantity of nodes are present in between the CH and BS and it will elevate the power utilization of the
network.

2.2 Optimizations in WSNs using Swarm Intelligence

An optimization is achieved by designing a model, by using a simulation and by designing a mechanism. A detailed taxonomy
of the swarm-based optimization used in WSNs is shown in Fig 2. The swarm-based mechanism is bifurcate two parts such as
local search (deterministic) and global search (stochastic). Local search provides the theoretical assumption about the formulated
problems, provide the analytical properties [71-72]. Guarantee of reaching the global minimum and at least a local minimum,
whereas global search provides the guarantee in terms of probability. However global search is much faster than the local search.
Additionally, the global search method is further classified into two parts: heuristic mechanism is problem-dependent mechanism
and meta-heuristic mechanisms is problem-independent. Both the mechanism is used to speed up the process of finding the
global optimum solution where the finding the solution is difficult. Because the heuristic mechanisms are based on the adaptive
and greedy approach, therefore they are more prone to get stuck at local optima which result to fail to obtain global optima [29].
However, meta-heuristic is non-adaptive and non-greedy approach and able to find the global solution. The meta-heuristic
mechanism is also known as nature-inspired mechanism. The nature inspired mechanism is further bifurcate four parts: bio-
inspired, physics inspired, geography inspired and human inspired [30-37]. The bio-inspired mechanism is bifurcate three parts:
transmutative, swarm based and plant based. Because the nature inspired mechanisms, most of the mechanisms are inspired by
the biological system. Therefore, most of the parts of the nature inspired mechanisms are based on the bio-inspired mechanism.
The transmutative mechanism is based on the Darwin’s principle of choosing whereas the swam is based on the collective
intelligence [38].
 Fig 2: Taxonomy of the Swarm-Based Optimization

As per the research the most popular mechanism used for the CH choosing is butterfly optimization mechanism, for the cluster
formation particle swarm optimization mechanism is popular and for the efficient route choosing the ant colony optimization
mechanism is used by the researchers to upgrade the power efficiency of the wireless sensor network [73]. The ant colony
optimization mechanism works with other popular mechanisms to upgrade the power efficiency of the network such as fuzzy
logic [39]. Xie et al [41]. put redirect a mechanism based on the ACO for wireless sensor network named as Type-2 Mamdnai
Fuzzy Logic System. The route in between the CHs is chooses on the basis of Ant Colony Optimization and the CH choosing is
based on the remaining power, interspace to the BS and quantity of nearest nodes. The CHs choose all the statistics from the
nodes and send it to the BS. Arjunan and Sujatha put redirect a mechanism-based o the fuzzy logic to develop the inadequate
clusters and the routes were chooses using Ant Colony Optimization technique. The CHs are chooses on the basis of remaining
power, node degree, interspace from the BS, node centrality and interspace from the nearest nodes [40]. The mechanism is well
suited to maintain the lifespan of the network [74]. Trend of the literature Fig 3. shows that ACO, PSO and BOA is used by the
many researchers to optimize the extant problem in wireless sensor network such as optimal route choosing, optimal quantity of
CH choosing per round, optimal quantity of nodes is chooses per round and elevate the packet transmission in between the CH
and the BS [42][51].

2013 2014 2015 2016 2017 2018 2019 2020 2021

180
160
140
120
100 2021
2020
80 2019
2018
60 2017
40 2016
2015
20 2014
0 2013
PSO ACO FA BOA ABC
2013 120 120 50 70 50
2014 130 100 38 80 60
2015 143 135 43 140 50
2016 156 141 50 138 65
2017 156 150 50 130 60
2018 156 160 50 130 70
2019 160 165 50 135 75
2020 160 165 50 135 75
2021 165 170 52 137 77

Fig 3: Trends of the mechanism

3. WSN AND OPTIMIZATIONS

The main issues related to the wireless senor network is categories into three main sections such as power efficiency, Quality of service
and the security. The optimization mechanisms are used in wireless sensor network to solve the extant problem i.e., optimal scope of the
sensors, data aggregation, power efficient clustering and routing and the sensor lateralization. There is a correlation in between all the
stated problems such as if we go for the service quality then we have to trade off with the lifespan of the network. Same follow with the
security, for achieving the security, again we have to trade off with the lifespan of the network. If we address the problem individually,
many loopholes exit and will never solved. So, to discover balanced wireless sensor network, we have to build the optimized mechanism
which can handle all the problems simultaneously. The solution of the problem is to create a multi-purpose function and optimize the
mechanism by using appropriate optimizer mechanism. For choosing the appropriate mechanisms, various factors have been considered
such as problem type, time constraint, availability of resources, accuracy desired. To achieve the better performance of the network, the
researchers have used many approaches in nature inspired mechanisms such as, classical approaches [28-32] and swarm intelligence-based
approaches [33-43]. There are various types of mechanisms present in the literature focused on the different types of problem faced by the
wireless sensor networks named as Optimal Scope, Data Aggregation, Power Efficient Clustering, Power Efficient Routing mechanisms,
Sensor lateralization [75-76]. Table 1 shows the detailed survey of the extant mechanism in terms of the various parameters such as Power
Efficiency, Latency, along put, Scalability, Connectivity, Load Balancing, Packet Loss Ratio, Reliability, Complexity.

Table 1: Survey of the extant mechanism with various parameters

Connectivity
Throughput
Mechanism

Complexity
Packet loss
Scalability

Reliability
Efficiency

Balancing
Authors

Latency
Power

Load
Year
Abb.
S.No

rate
Best For

Ant Colony Path choosing, H S H H M M M M M

1 ACO Dorigo 1992
Optimization routing
 Cluster, path
Particle Kennedy
choosing, gives L S M H N/A S H M S
2 Swarm PSO and 1995
optimum results in
Mechanism Eberhart
less parameters
Artificial
L M S H M M H M M
3 Fist Swarm AFSA Li et al. 2002 Cluster formation
Mechanism
Bacterial
Foraging CH choosing, M
4 BFOA Passion 2002
Optimization routing M S M M S S M M
Mechanism
Glowworm
Krishnanad Path choosing,
5 Swarm GWO 2005 H S S M M M M S M
and Ghose routing
Optimization
Find best location
for the near sink
Cat Swarm L M
6 CSA Chu et al. 2006 node, choose CH,
Optimization
Perform well with M M S M M S M
K-mean Clustering
Karaboga
Artificial Cluster formation, M S M M S M M
7 ABC and 2007 M L
Bee Colony CH choosing
Basturk
Cuckoo Yang and Cluster formation, M S M M M S S M S
8 CS 2009
Search Deb CH choosing
Bat M S M M M M M M M
9 BA Yang 2010 Node lateralization
Mechanism
Firefly Clustering, Node M S M M M S M S M
10 FA Yang 2010
Mechanism lateralization
Krill Herd Gandomi Finding the L S S M S M M M M
11 KH 2012
Mechanism and Alavi interspace
CH choosing,
Dolphin Kaveh and
12 DE 2013 Security needs to be M S M M M M M M H
Enholocation Farhoudi
considered
Chicken
M S M S M M M
13 Swarm CSO Meng et al. 2014 CH choosing M H
Optimization

Network scope
Grey Wolf Mirjalili et
14 GWO 2014 optimization, CH
Optimizer al.
CHOOSING

H M M H M M M M H

Scope, connection,
the network-
Ant Lion
15 ALO Mirjalili 2015 longevity and
Optimizer
minimized power H M M M M M M M H
utilization.
Dragonfly L S M M M M M M M
16 DA Mirjalili 2015
Mechanism lateralizationproblem
Whale
Mirjalili
17 Optimization WOA 2016 CH Choosing M S M M M M M M M
and Lewis
Mechanism

Crow Search Lalireza CH choosing, Work

18 CSA 2016
Mechanism Askarzadeh with few parameters

H S M M M M M S S

Grasshopper Network lifespan,

Saremi et
19 Optimization GOA 2017 end-to-end delay, M S M M M M M M M
al.
Mechanism best with ABC
Butterfly-
Node lateralisation,
20 inspired BOA Qi et al. 2017 S M M M S S S M M
cluster formation
Mechanism
 Salp Swarm Mirjalili et S M M M S S S S M
21 SSA 2017 Node lateralisation
Mechanism al.
Routing, Load
Equilibrium Faramarzi
22 EO 2019 Balancing, M M H M M M M M H
Optimizer et al.
Clustering
Bald Eagle Alsattar et
23 BES 2019
Search al.
Harris
Heidari et
24 Hawks HHO 2019
al.
Optimization
Nuclear Latest Technology, Literature not available
25 Reaction NRO Wei et al. 2019
Optimization
Border
26 Collie BCO Dutta et al. 2020
Optimization

3.1 Optimal Scope in WSN

Optimal Scope of sensors in the wireless sensor network is very essential part of the network to elevate the network lifespan.
Scope of the area in such a way that it targets the entire area with minimum quantity of senor nodes. The key parameter of
choosing the area is to choose the shape of the test area. In the extant literature, there are various shape available such as
irregular, solid structure, hexagonal shape or the circular shape. In the figure, we show the four two-dimensional geometrical-
based sensing shapes [54-57]. In the present case, the outline of the test area is uneven and multifaceted due to territory
properties and solid shape. However, the hexagonal or a circular shape is use for the computational and conceptual ease. In
general, hexagonal shape is applied or used by the researchers/industry experts because of its flexible and overlapping feature.
Though, the circular shape is more pronoun because of its low complexity. The restriction is remunerated by growing the
radius of the circle. Due to elevate in the radius of the circle, another problem comes into picture that is duplicate data sensed
by the sensor. As more duplicate data is sensed by the sensor, there will more power utilization [58-60]. We can turn down the
problem by enhancing the single purpose optimization problem into multi-purpose problems by choosing the other parameters.

3.2 Power efficient clustering and routing in wireless sensor network

As wireless sensor network is composed of the sensors which are inbuilt with the battery for shorter duration. These batteries
are not be recharged, so the need of the power efficient networks is of the utmost importance in the extant case [61]. The
sensors dissipate their power by sensing the data from the nature and send it to the BS by using multi-hop communication. For
reducing the power utilization of the nodes, first clusters are formed, secondly CHs are chooses based on the remaining power,
and thirdly, the path is chooses for the data transmission using optimum routing techniques. In the given domain, the problem
faced by the networks are:
 The choosing of the CH having high power and choosing of routing path from each round.
 Maximization of network lifespan and packet delivery ratio to the BS.
 Interspace from the sensor node to the CH and CH to the BS should be minimized.

4 PROBLEM STATEMENT

The problem faced by the WSN are: To find the appropriate purpose function to preserve or creating the power efficient
network. For remaining power, weighted power-efficient clustering with robust routing for wireless sensor network [44], and
Aware cluster-based routing [45] is put redirect. The overall power of the network is preserved by considering the power as
well as interspace. In clustering and routing in wireless sensor using harmony search mechanism [46], the lifespan is affected
by the quantity of member nodes in of the CH. In energy efficient clustering routing protocol [47] based on parameters
optimization in WSN, the information communication from Cluster Head to the Base Station also affects the network lifespan.
The Ant colony optimization generate the packet loss due to the proactive and reactive mechanisms. The solution of the above
mentioned to create a mechanism focused on the power of the node and the interspace of the node to the CH and from CH to
the BS. The best path choosing will be implemented by multi-purpose function. And the packet drop ratio is minimized by the
considering the power of each node. For creating the purpose function, one need to consider the remaining power, interspace
from the node to the CH and from CH to the BS. Therefore, it will work in the small as well as large network.

4.1 Preliminaries

This section describes the network and power model as well as describe the PSO (Particle Swarm Optimization) is used to
formulate the clusters, BOA (Butterfly Optimization) technique for finding the CH, ACO (Ant Colony Optimization) technique
for finding the route from the source to the sink.

4.1.1 Network model

 Sensors are arbitrarily deployed in the network, later they are constant in nature.
  BS receives the data such as remaining power of the node, interspace from the sensors from all the sensors in the
nature.
 To configure the network model of wireless sensor network, all the knob are comparable to each other in terms of
original energy and the dispensation period.
 The interspace amongst the sensor knob to the Cluster Head and from Cluster Head to the BS is intended grounded
on the Euclidean interspace.
 Clusters are formed using Cluster formation mechanism, then CHs are chooses using choosing mechanism. Then
the routing mechanism is used to find the route from source to the sink.

4.1.2 Energy Model

Given in the research, a elementary radio model (1st order) is measured to compute the power of the nodes. For
conveying the l bits from the source to the sink over the interspace d is calculated by using the equation 1 and 2
respectively:

𝐿𝐸𝑒𝑙𝑒𝑐 + 𝐿𝐸𝑓𝑠𝑑2 𝑖𝑓 𝑑 < 𝑑𝑜

𝐸𝑇𝑋 (𝑙, 𝑑) = { (1)
𝐿𝐸𝑒𝑙𝑒𝑐 + 𝐿𝐸𝑚𝑝𝑑4 𝑖𝑓 𝑑 ≥ 𝑑𝑜
Where 𝐿𝐸𝑒𝑙𝑒𝑐 is the power used to run the converter (ETX) or (ERX) and the threshold value is d0. For the experimental survey,
free space and multi-path models is expressed as 𝐸𝑓𝑠 and 𝐸𝑚𝑝 . These values are depended on the converter amplifier model.
Where d0 is expressed as

𝐸𝑓𝑠
𝑑0 = √ (2)
𝐸 𝑚𝑝

5 PUT REDIRECT METHOD

The put redirect model has three mechanisms: First is used to form clusters, second is used to choose the CH by considering
the remaining power and the interspace from the sensors and other one is used to find the path or route over the entire network.
The PSO is used to form the cluster, BOA is used to find the optimum quantity of CHs in each round and ACO is used to find
the route from the source to the sink or from CH to the BS. The entire process is described in the figure 4.
 Fig 4: Flow Chart

6.1 CH choosing using BOA

BOA (Butterfly Optimization Mechanism) is introduced in 2019 by Sankalap Arora [50]. The mechanism shows the butterfly
food search and its mating behavior. In general, butterflies are fascinated to every last one along the cologne of other
apprehensions. The crusade of butterfly is moreover in haphazard way or in the way of the other butterflies who produces the
stronger cologne. The purpose function is used to compute the inducement strength. The butterfly optimization mechanism
chooses the ideal quantity of CH using the certain parameter: node notch, node uniqueness, interspace to its nearest, interspace
between the Base Station to the Cluster Head and the remaining power of the sensors. The author use algorithm proposed by
Prachi M. et al. [30]. The steps of the algorithm are as follows:
Node degree: It is defined as the quantity of sensors connect to the Cluster Head. The Cluster Head with the less quantity of
knob are chooses as CH with the higher quantity of connected sensors deplete their power fast. The degree of the node is
calculated as sum of power of all the sensors belongs to the CH. The weight value for the purpose function is 0.1.

𝑁𝐷 = ∑𝑚
𝑖=1 𝐼𝑖 (3)

Node centrality: It is defined as how much a node is halfway situated from the nearest nodes. The weight value for the purpose
function is 0.1 and it is calculated by using the eq:

∑ 𝑑𝑖𝑠𝑡2(𝑖,𝑗)
√ 𝑗∈𝑛
𝑛(𝑖)
𝑚
∑𝑖=𝑚
𝐶𝑛 = (4)
𝑁𝑒𝑡𝑤𝑜𝑟𝑘 𝑑𝑖𝑚𝑒𝑛𝑠𝑖𝑜𝑛

where n(i) quantity of nearest node to the CH i.

Remaining Power of the node: The node with the higher remaining power will become the CH because the CH need to perform
the various task such as aggregate the data, remove the duplicate data, data transmission to the BS. The weight value for the
purpose function is 0.3. Thus, the node with higher remaining power will chose as the CH and the remaining power is calculated
as:
1
𝑅𝑒 = ∑𝑚
𝑖=1 (5)
𝐸𝐶𝐻𝑖

where the remaining power of the ith CH is 𝐸𝐶𝐻𝑖 .

Interspace between the sensors: It is defined as the interspace from the sensors to the CH and from nearest sensors with in the
cluster. Lesser the interspace, less power will be consumed in the transmission. The weight value for the purpose function is
0.2. Thus, the interspace is calculated by using the formula:

𝐷𝑖𝑗 = ∑𝑚 𝐼𝑖
𝑖=1(∑𝑗=1 𝑑𝑖𝑠(𝑠𝑗 , 𝐶𝐻𝑖 )/𝐼𝑖 ) (6)

where 𝑑𝑖𝑠(𝑠𝑗 , 𝐶𝐻𝑖 ) is interspace from sensor node to the CH and 𝐼𝑖 shows the ith sensor node within the cluster.

Interspace from the CH and BS: It shows the interspace from the from the CH to the BS. If the CH is far away from the BS,
then it consumes more power for the data transmission. So, the nodes near to the BS is used to convey the data to the BS. The
weight value for the purpose function is 0.25. The purpose function used to calculate the interspace from the BS to the CH is
calculated as:

𝐷𝐶𝐻−𝐵𝑆 = ∑𝑚
𝑖=𝑖 𝑑𝑖𝑠(𝐶𝐻𝑗 , 𝐵𝑆) (7)

So, the single purpose function to find the CH from the set of nodes is calculated as

𝐹 = 𝛼1 𝑁𝐷 + 𝛼2 𝐶𝑛 + 𝛼3 𝑅𝑒 + 𝛼4 𝐷𝑖𝑗 + 𝛼5 𝐷𝐶𝐻−𝐵𝑆 (8)

Mechanism

CH choosing using BOA

1. Fitness function derivation using 𝐹 = 𝛼1 𝑁𝐷 + 𝛼2 𝐶𝑛 + 𝛼3 𝑅𝑒 + 𝛼4 𝐷𝑖𝑗 + 𝛼5 𝐷𝐶𝐻−𝐵𝑆

2. Generate a preliminary populace of butterflies.
3. Prepare impetus strength (I) at node I which is intended by f(xi)
4. Prepare shift possibility, sensor modality and power exponent.
5. For j=max quantity of reiterations
6. For every butterfly in populace
7. Calculate cologne 𝑓 = 𝑐𝐼𝑎
8. End for
9. Identify the optimum butterfly populace
10. For every butterfly in populace
11. Generate a arbitrary quantity r from [0,1]
12. If arbitrary quantity < population
13. 𝑥𝑖𝑡+1 = 𝑥𝑖𝑡 + (𝑟 2 × 𝑔∗ − 𝑥𝑖𝑡 ) × 𝑓𝑖 where 𝑓𝑖 is butterfly fragrance, 𝑔∗ is current iteration.
14. 𝑒𝑙𝑠𝑒
15. Move arbitrarily 𝑥𝑖𝑡+1 = 𝑥𝑖𝑡 + (𝑟 2 × 𝑥𝑗𝑡 − 𝑥𝑘𝑡 ) × 𝑓𝑖
16. End if
17. End for
 18. Update the value of energy proponent
19. End for
20. Optimal quantity of CH chooses from the population.

6.2 Cluster formation using PSO

PSO is one of the oldest mechanisms is the nature inspired mechanism used by the researchers to find the optimum results in
the WSN. The mechanism is put redirect by the Kennedy and Eberhart in 1995. The mechanism is inspired by the social
behavior of the bird flocking of fish schooling. It is an effective method to solve the clustering problem in WSN. On the basis
of centralized clustering, the clusters are formed by the BS. For this, BS sends the data collection message to all the sensors in
the nature. After receiving the data, nodes send the data to the BS such as node id, location (interspace from the BS
in and position), power loss and power loss ratio (velocity), and current power to send BS. Then BS initiates the clustering
process steps as follows.

Function: PSO-Cluster formation

Initialize the optimization problem and mechanism, parameters.

1. for i=1 to the particle size do
2. Initialize Xi within the search range of (Xmin,Xmax) arbitrarily;
3. Initialize Vi within the velocity range of (Vmin,Vmax) arbitrarily;
4. pi=xi
5. end for
∑𝑛
𝑖=0 𝑑(𝑐𝑢𝑟𝑟𝑒𝑛𝑡 𝑛𝑜𝑑𝑒,𝑚𝑒𝑚𝑏𝑒𝑟 𝑛𝑜𝑑𝑒 𝑖) ∑𝑛
𝑖=0 𝐸(𝑚𝑒𝑚𝑏𝑒𝑟 𝑖)
6. Evaluate each particle **// fitness value= a +𝑏 + (1 − 𝑎 −
𝑛 𝐸(𝑒𝑥𝑖𝑠𝑡𝑖𝑛𝑔 𝑛𝑜𝑑𝑒)
1
𝑏) where a & b is normalized values and n shows the quantity of nodes
𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑛𝑜𝑑𝑒𝑠 𝑒𝑥𝑖𝑠𝑡 𝑖𝑛 𝑡ℎ𝑒 𝑐𝑢𝑟𝑟𝑒𝑛𝑡 𝑛𝑜𝑑𝑒
in the cluster
7. Identify the best position Ps;
//Loop:
8. While (Stop criterion is not satisfied & t < maximum iteration times) do
9. for i=1 to the particle size do
10. Vit+1 = 𝝎Vit + c1 r1 (Pit − Xit ) + c2 r2 (Pgt − Xit )
11. Xit+1 = Xit + Vit+1
12. Pit+1 = Pit
13. Evaluate fitness value
14. If fitness (Pit+1 ) < fitness (Xit+1 );
15. Update (Pit+1 );
16. End if
17. If fitness (𝑃𝑔𝑡+1 ) < fitness (Pit+1 ) then
18. Update (𝑃𝑔𝑡+1 );
19. End if
20. End for
21. End While

6.3 Routing Mechanism using ACO

Ant Colony Optimization is a metaheuristic mechanism inspired by the performance of the ants. Commonly, ACO applied on
the discrete problems. ACO is used to find the shortest path from source node to the destination node by the use of graph in
which the ant colony (nodes associated with the CH) is represented as a node and the L represent the link in between the nodes
with different weights. In the initial phase, the weight of the link is calculated as the actual interspace in between the nodes by
using arbitrarily quantity which is calculated by the mathematical formula. The disadvantage of ACO mechanism, i.e.,
undefined conjunction is overcome by improving the ACO in terms of remaining power, interspace from the destination and
the knob degree. The route-finding procedure by using ACO is as follows:

1. In the formed CH, the ants are situated in every cluster. CH will create the way from the Cluster
Head to the destination (BS). These routes data are known as redirect data.
 2. Based on the probability matrix, the redirect containers are arbitrarily converted to the following CH.
The redirect program packet is conveyed to the next CH until the packet is acknowledged by the BS.
3. The redirect packet will maintain the local data base about the visited CH, remaining power of the
nodes and the CH (Remaining power of the nodes are calculated as the quantity of data conveyed
along the network), interspace from the CH to the BS and the node degree.
4. The redirect data base is used to create the backward data base or backward packet. We need to create
the backward packet because to extend the path until the packet reaches to the BS. The backward
packet path is same as the path followed by the redirect packet.
5. The pheromone level of the link is updated by the remaining power, interspace to the BS and the
node degree.
6. The next node for the transmission is chooses on the basis of equation no. 9 which shows the chance
of selecting the knob j as the subsequent knob i by means of ant k.

[𝜏𝑖𝑗 (𝑡)]𝛼 [𝜂𝑖𝑗 ]𝛽

𝑖𝑓 𝑗 𝜖 Ν𝑘
𝑃𝑖𝑗𝑘 (𝑡) = {∑𝑙∈Ν𝑘[𝜏𝑖𝑗 (𝑡)]𝛼[𝜂𝑖𝑗 ]𝛽 (9)
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Where, the heuristic value and pheromone intensity are represented as 𝜂𝑖𝑗 and 𝜏𝑖𝑗 respectively. To control the relative
importance of the both the values, parameter 𝛼 and 𝛽 is used. Submission of nodes who has not visited yet is represented asΝ𝑘 .
Base on the data stored in the routing table by the CH, the heuristic and pheromone intensity are updated. Both the values are
updated by the following formulas:
1
𝜂𝑖𝑗 = (10)
𝑑𝐶𝐻

𝑜𝑙𝑑 𝑘
And 𝜏𝑖𝑗 = (1 − 𝜌)𝜏𝑖𝑗 + ∑𝑚
𝑘=1 𝛥 𝜏𝑖𝑗 (11)

Where, 𝑑𝐶𝐻 shows the interspace from the CH, m shows the quantity of ants initialized and the pheromone deterioration
𝑘
quantity is shown as𝜌𝜖[0,1]. Where 𝛥𝜏𝑖𝑗 is calculated as:

𝑘 𝑄
𝛥𝜏𝑖𝑗 =∫ 𝑖𝑓 𝑡ℎ𝑒 𝑘 𝑡ℎ 𝑎𝑛𝑡 𝑡𝑟𝑎𝑣𝑒𝑟𝑠𝑒𝑑 𝑙𝑖𝑛𝑘 (𝑖, 𝑗), 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 0 (12)
𝑐𝑘

Where the value of Q is constant and the route cost is found by the ant is calculated as𝑐𝑘 .

𝑐𝑘 = 𝝋1 𝐸𝑟 + 𝝋2 𝑑𝐶𝐻,𝐵𝑆 + 𝝋3 𝑁𝐷 (13)

Where the weighted values of𝝋1 ,𝝋2 , 𝝋3 are 0.5,0.3 and 0.2. For the successful communication, remaining power of the nodes
should be considered as the priority because the node failure me leads to the communication failure. After that, to obtained the
shortest interspace in between the CH and the BS is considered as the second priority because it consumes the minimum power
or we can say that the power utilization is low in order to find the shortest interspace as compare to maintain the remaining
power of the sensors. Lastly, we consider the node degree as a third priority, in which we choose the next CH as a hop having
lesser quantity of member nodes. To find the route in between the source node to the destination node following steps need to
be followed:

Routing Steps using ACO

1) Initialize pheromone exponential weight and heuristic exponential weight.

2) Generate the initial population of the ants.
3) for j=higher level of the iterations.
4) for each ant in the population.
5) Repeat the steps until kth ant complete its journey to the final destination.
6) Choose the successive ant using equation 9.
7) Update the pheromone using equation 11.
8) End for
9) Update the best solution.
10) End for
11) Output is the optimal route from source to the BS.

6.4 Cluster maintenance

In the literature survey present, the cluster preservation phase is one of the most significant stages to stable the load amongst
the clusters. The cluster closer to the BS drain their power so fast because of the traffic of inter cluster. So, the preservation of
the cluster is important factor to turn down the problem of knob disaster. Node failure mains to the network failure and
maintenance of the cluster leads to the maximization of the lifespan of the cluster or the entire network. In the put redirect
mechanism, if the power of the CHs drains to the below the threshold value, the butter fly optimization mechanism is used to
initialized the cluster, partial swarm optimization mechanism is used to elect the CH and then ant colony optimization
mechanism is used to find the optimised path in amongst the knob to the Cluster Head and Cluster Head to the BS to maximize
the network lifespan. Furthermore, it leads to the maximize the quantity of data conveyed to the BS.

7. Performance Measurement

The performance of the put redirect mechanism is measured by considering various factors such as:

Number of active nodes: The quantity of active nodes elevates the lifespan of the network. It describes as the quantity of
active nodes in the network.

Dead nodes: The stability period of the network is calculated till the first node die. The network life time will decree when
the quantity of dead nodes will elevate per round.

Data send to the BS

Along put: quantity of bits conveyed to the BS and it will measure in quantity of bits conveyed per second.

Stability period: It is measured along at what round the first node die, quantity of rounds when half of the nodes die in the
network

Power utilization in each round: The total power utilization is calculated by the power loss of each node in the network.

Packet Drop Ratio: Quantity of data lost during the transmission from node to the CH and from CH to the BS.

Congestion in the network: It is calculated as quantity of acknowledged data by the BS to the quantity of produced data by
the nodes in the network.

8. Simulation Setup

The put redirect power efficient protocol is implemented and tested on the MATLAB. The reason for using MATLAB is that
it is very appropriate for the data survey and gives mathematical operations. There are 300 devices arbitrarily positioned in the
test reason of 200 m x 200 m. The first order radio model for the power efficiency is considered for analysing the put redirect
model with the extant model. The simulation parameters used for the examination purpose is shown in table 2. The purpose
of the put redirect mechanism is to turn down the power utilization in wireless sensor networks. SO, to achieve the object,
author used the BOA for the CH choosing, PSO is used for the cluster formation process and ACO is used for the routing
process.

Table 2: Simulation Parameter

Parameter that are considered for the butterfly optimization algorithm are: population size considered as 200, switch probability
has taken as 0.8, power exponent considered as 0.1 and sensor mobility is considered as 0.01. Now for the cluster formation,
the parameters considered as Quantity of Particles, Number of of iterations, Inertia Weight, Local Weight (c1), Local Weight
(c2), Fitness are as 200, 100, 0.8, 1.49, 1.49, Predication accuracy. For the optimal route consideration, the parameters chosen
as Quantity of ants, Pheromone exponential weight, Experiential exponential weight, Disappearance rate are as 200, 1,1,0.1.

Fig 5: Illustration of Case 1. Fig 6: Illustration of Case 2.

Fig 7: Illustration of Case 3.

The put redirect mechanism is validated in 3 cases.

Case 1: In the 1st case, the Base Station is placed at the centre of the test area (100,100) which is used to analyses the shorter
interspace communication.

Case 2: In the 2nd case, the Base Station is placed at the last area which is in the range of the sensing reason (100,200). It is
used to analyse the means range communication.

Case 3: In the 3rd case, the Base Station is placed at the outer area (100,250), which is situated far away from the examination
zone. This case is used to analyse the extended rang communication.

8.1 Performance evaluation in terms of active nodes: The quantity of active nodes in put redirect mechanism is
correlated with the LEACH, DEEC, EDEEC, DDEEC for 500 nodes in different cases such as in the 1st case, the BS
is placed at the centre of the test area (250,250) which is used to analyses the shorter interspace communication, in
the 2nd case, the BS is placed at the last area which is in the range of the sensing reason (100,250). It is used to
analyse the means range communication, in the 3rd case, the BS is placed at the outer area (100,550), which is situated
 far-off from the test area. This case is castoff to analyse the long rang communication. The put redirect mechanism
prolongs the network lifespan as compare to the other protocols.

Amount of active nodes Comparision Proposed

1000 HEED
HCA
800
Amount of active nodes

EEHCS
600 DECP
EDFCM
400
EEUC
200 EECS
MRPUC
0
2000
0
250
500
750
1000
1250
1500
1750

2250
2500
2750
3000
3250
3500
3750
4000
4250
4500
5000
-200
Rounds

Fig 8: Number of Active Nodes

8.2 Performance evaluation in terms of stability period: The stability period is measured till the round when 1st node
dies after the certain quantity of iterations. Fig 9 shows the quantity of dead nodes in the case 1, fig 10 shows the
quantity of dead nodes for the case 2 and the fig 11 shows the quantity of death node for the case 3.

Death Round of the First Node S-1 Death Round of the First Node S-2
6000 2500

5000 2000
4000
1500
3000
2000 1000
1000
500
0
1 0
LEACH MRPUC EEUC SEP LEACH MRPUC EEUC SEP
DECP DEEC EEHCS EECS DECP DEEC EEHCS EECS
HEED HCA EDFCM Proposed HEED HCA EDFCM Proposed

Fig 9: For the case 1 Fig 10: For the case 2

 Death Round of the First Node S-3
2000
1800
1600
1400
1200
1000
800
600
400
200
0

LEACH MRPUC EEUC SEP DECP DEEC

EEHCS EECS HEED HCA EDFCM Proposed

Fig 11: For the case 3

8.3 Performance evaluation of average power utilization: The performance evaluation of average power utilization
of the put redirect mechanism is correlated with the extant mechanisms like LEACH, DEEC, MEEDEEC, SEP,
EDEEC, DDEEC is shown in the figure 12. The power utilization is calculated when the BS is situated in centre of
the region (100,250) and second comparison is based when the BS is situated far away from the BS (100,250)
respectively. As per the result obtained from the mechanism, it is clearly shown that the put redirect mechanism
gives higher power efficiency as compare to the LEACH and other mentioned protocols. The put redirect mechanism
gives the higher power efficiency because it considers the optimal quantity of CH choosing per round, it includes
the interspace while choosing the CH and optimal route when sending the data from one node to the other node. The
reason behind the higher power utilization is that LEACH choose the CH arbitrarily and use single hop transmission
whereas DEEC does not consider the interspace during CH choosing. The overall comparison in terms of remaining
power of the put redirect mechanism with the extant mechanism is shown in the table 6.

Remaining Power
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000

Proposed HEED HCA EEHCS DECP

EDFCM EEUC EECS MRPUC DEEC

Fig 12: Remaining power

Table 6: Comparison of the remaining power of the extant mechanism with the put redirect mechanism

Put
Rounds HEED HCA EEHCS DECP EDFCM EEUC EECS MRPUC DEEC
redirect
0 0.711 0.108 0.45 0.027 0.09 0.09 0.18 0.27 0.009 0.09
500 0.711 0.18 0.405 0.045 0.162 0.09 0.198 0.306 0.009 0.18
1000 0.711 0.27 0.351 0.135 0.18 0.18 0.225 0.36 0.018 0.225
1500 0.675 0.2691 0.306 0.162 0.162 0.297 0.288 0.36 0.027 0.315
2000 0.64675 0.333 0.234 0.18 0.18 0.45 0.252 0.369 0.036 0.342
2500 0.52735 0.351 0.18 0.171 0.207 0.45 0.225 0.351 0.045 0.35091
3000 0.44775 0.36 0.135 0.126 0.207 0.45 0.198 0.261 0.054 0.36
3500 0.44775 0.324 0 0.108 0.225 0.45 0.18 0.261 0.063 0.369
4000 0.44775 0.288 0 0.099 0.225 0.45 0.18 0.261 0.072 0.349992
4500 0.4577 0.225 0 0.09 0.225 0.45 0.162 0.261 0.081 0.349992
5000 0.48755 0.234 0 0.045 0.225 0.45 0.1638 0.261 0.09 0.349992

8.4 Performance evaluation based on the packet transmission to the BS: The put redirect mechanism gives the
higher packet acknowledged by the BS is that, the fitness functions of BOA, PSO and ACO reserve the power
utilization of the nodes due to which leads to elevate the quantity of active nodes in the network along which the
data packet will be conveyed to the BS. The fitness function chosen for the CH choosing and route choosing, it helps
to minimize the overhead in the routing process due to which a smaller quantity of nodes dies in each round during
the data transmission and it leads to the higher quantity of data acknowledged by the BS. In the extant mechanism,
the inappropriate quantity of CH choosing and routing overhead, the lesser quantity of data is conveyed to the BS.
Fig 13 shows the quantity of data acknowledged by the BS if there are 250 nodes are present in the case and Fig 14
shows the quantity of data acknowledged by the BS if there are 150 nodes are present in the case.

Packet Convey to the BASE Packet Convey to the BASE STATION

STATION
160000
250000 140000
200000 120000
100000
150000
80000
100000 60000
40000
50000
20000
0 0
0
334
668
1002
1336
1670
2004
2338
2672
3006
3340
3674
4008
4342
4676

1566
1
314
627
940
1253

1879
2192
2505
2818
3131
3444
3757
4070
4383
4696
Proposed EDEEC DEEC Proposed EDEEC DEEC
MEDEEC DDEEC MEDEEC DDEEC

Fig 13: For the 250 Nodes Fig 14: For the 150 Nodes

8.5 Performance evaluation of throughput: The inappropriate choosing of CH in the extant mechanism is the main
reason for the higher power utilization in the data transmission. The put redirect mechanism chooses the CH and the
route in the efficient way due to which higher data are conveyed to the BS and achieve the efficiency. The
comparison of put redirect mechanism is correlated with the extant mechanism.

8.6 Performance evaluation of the network lifespan: Network lifespan is totally dependent on the remaining power
of the nodes and the lifespan of the network got exhausted when entire node will lose their power. The network
lifespan of the entire network is correlated when the first node die, half of the nodes die and last node die in the
network. It is well said by the researchers that the demise of the 1st node in the network doesn’t disturb the network
execution but the system performance is affected when half of the node die in certain rounds or in the data
transmission. Furthermore, the entire network gets drained when all the nodes die. So, to upgrade the network
lifespan, the optimal quantity of CH choosing per round and chosen of optimal path from node to BS is mandatory
requirement in the present case.

8.7 Comparative survey of the put redirect procedure with further cluster-based routing mechanisms
The comparative survey of the put redirect mechanism is correlated with some extant mechanism is shown in the figure 15.
Table 7 shows the Comparative survey of Delay, Packet Drop Ratio, Throughput to the BS with the extant routing protocol.

Comparision Survey
1800
1600
1400
1200
1000
800
600
400
200
0
Delay in Delay in PDR in PDR in Throughput Throughput
Proposed CPSO Proposed BERA in Proposed in BERA

Fig 15: Comparison survey with CPSO, BERA

Table 7: Comparative survey of Delay, Packet Drop Ratio, Throughput to the BS with the extant routing protocol

Delay PDR Throughput

Put Put Put
Nodes redirect CPSO redirect BERA redirect BERA
50 373.82 391 81.8197 84.0419 1409.99 1427.34
100 473.45 746.97 76.6302 80.0872 1094.45 951.33
150 248 395.48 82.5347 84.9127 940.1 899.76
225 359 501.48 80.4411 83.9704 1477.54 1436.96
315 616.1 677.81 85.1583 90.3678 1677.48 1463.59

Delay PDR Throughput

Put Put Put
Nodes redirect FUCHAR redirect FUCHAR redirect FUCHAR
50 467.57 465.57 79.2301 83.1894 1415.3 1409.87
100 517.78 515.78 79.8012 81.1282 989.09 952.42
150 444.22 442.22 83.2691 84.238 989.44 937.5
225 696.14 694.14 85.7013 88.1779 1563.04 1502.28
315 539.6 537.6 90.044 91.5886 1475.36 1383.06

9. Conclusion

In the extant case of Wireless Sensor Network, the power utilization of the network is very high due to which the
network lifespan gets turn down. So, to upgrade the network lifespan author focus on the following parameters such
as optimal quantity of CH choosing par round, quantity of cluster formation and the optimal route choosing. The
author uses the BOA, PSO and ACO to turn down the power utilization per round and elevate the network lifespan.
The BOA mechanism is used to choose the CH, the fitness function was used with consideration of five parameters
such as remaining power of the node, interspace from the nodes and the BS, node centrality and the node degree to
turn down the CH choosing per round. The PSO is used to form the cluster by using certain parameters such as
interspace to the CH and the BS. The ACO is used to find the best route from source to the destination by considering
 following parameters such as interspace to the neighbour node, remaining power of the nodes and the node degree.
The performance of the put redirect mechanism was measured in three different cases in which the BS was situated
at different positions. The put redirect mechanisms were correlated with the extant mechanism and result shows that
the put redirect mechanism gives the higher result in terms of stability period.

Authors' contributions RM and RKY contributed to collecting related literature and implementing the mechanism.

Funding “Not applicable”

Declarations

Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.

Consent for publication “Not applicable”

References

[1]. K. Sohrabi, J. Gao, V. Ailawadhi, G.J. Pottie, Protocols for self-organization of a wireless sensor network, IEEE
Pers. Commun. 7 (5) (2000) 16–27.
[2]. A. Singh, V. Kotiyal, S. Sharma, J. Nagar, C.C. Lee, A machine learning approach to predict the average localisation
error with applications to wireless sensor networks, IEEE Access 8 (2020) 208253–208263.
[3]. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: A survey, Comput. Netw. 38
(4) (2002) 393–422.
[4]. L. Borges, F.J. Velez, A.S. Lebres, Survey on the characterization and classification of wireless sensor network
applications, IEEE Commun. Surv. Tutor. 16 (4) (2014) 1860–1890.
[5]. S. Lu, X. Huang, L. Cui, Z. Zhao, D. Li, Design and implementation of an ASIC-based sensor device for wsn
applications, IEEE Trans. Consum. Electron. 55 (4) (2009) 1959–1967.
[6]. S. Sharma, J. Singh, R. Kumar, A. Singh, Throughput-save ratio optimiza- tion in wireless powered communication
systems, in: 2017 International Conference on Information, Communication, Instrumentation and Control (ICICIC),
2017, pp. 1–6, http://dx.doi.org/10.1109/ICOMICON.2017. 8279031.
[7]. R. Kumar, A. Singh, Throughput optimization for wireless information and power transfer in communication
network, in: 2018 Conference on Signal Processing and Communication Engineering Systems (SPACES), 2018, pp.
1–5, http://dx.doi.org/10.1109/SPACES.2018.8316303.
[8]. J. Yick, B. Mukherjee, D. Ghosal, Wireless sensor network survey, Comput. Netw. 52 (12) (2008) 2292–2330.
[9]. M. Imran, H. Hasbullah, A.M. Said, Personality wireless sensor networks (pwsns), 2012, CoRR abs/1212.5543.
[10]. S. Sharma, R. Kumar, A. Singh, J. Singh, Wireless information and power transfer using single and multiple path
relays, Int. J. Commun. Syst. 33 (14) (2020) e4464.
[11]. Daji, H., Jinping, Z., & Jilan, S. (2003). Practical implementation of Hilbert-Huang transform mechanism. ACTA
OCEANOLOGICA SINICA-ENGLISH EDITION-, 22(1), 1-14.
[12]. Cardei, M., Du, DZ. Improving Wireless Sensor Network Lifespan through Power Aware Organization. Wireless
Netw 11, 333–340 (2005). https://doi.org/10.1007/s11276-005-6615-6
[13]. Huang R., Chen Z. and Xu G.2010 International Conference on Communications, Circuits and Systems
(ICCCAS), IEEE (2010), pp. 103-107
[14]. Y. Liang, H. Yu, Power adaptive cluster-head selection for wireless sensor networks, in: Sixth International
Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT’05), 2005, pp. 634–
638, http://dx.doi.org/10.1109/PDCAT.2005.134.
[15]. M. Cardei, D.-Z. Du, Improving wireless sensor network lifespan through power aware organization, Wirel. Netw.
11 (3) (2005) 333–340.
[16]. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, C. Gill, Integrated scope and connectivity configuration in wireless
sensor networks, in: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, in:
SenSys ’03, ACM, New York, NY, USA, 2003, pp. 28–39, http://dx.doi.org/10.1145/958491.958496, URL:
http://doi.acm.org/10. 1145/958491.958496.
[17]. C.-W. Tsai, T.-P. Hong, G.-N. Shiu, Metaheuristics for the lifespan of wsn: A review, IEEE Sens. J. 16 (9) (2016)
2812–2831.
[18]. S.J. Nanda, G. Panda, A survey on nature inspired metaheuristic mechanisms for partitional clustering, Swarm Evol.
Comput. 16 (2014) 1–18.
[19]. M. Iqbal, M. Naeem, A. Anpalagan, A. Ahmed, M. Azam, Wireless sensor network optimization: Multi-purpose
paradigm, Sensors 15 (7) (2015) 17572–17620.
[20]. O. Demigha, W.-K. Hidouci, T. Ahmed, On power efficiency in collaborative target tracking in wireless sensor
network: A review, IEEE Commun. Surv. Tutor. 15 (3) (2012) 1210–1222.
[21]. R.V. Kulkarni, A. Forster, G.K. Venayagamoorthy, Computational intelligence in wireless sensor networks: A
survey, IEEE Commun. Surv. Tutor. 13 (1) (2010) 68–96.
[22]. C.-W. Tsai, P.-W. Tsai, J.-S. Pan, H.-C. Chao, Metaheuristics for the deployment problem of wsn: A review,
Microprocess. Microsyst. 39 (8) (2015) 1305–1317.
[23]. G. Molina, E. Alba, E.-G. Talbi, Optimal sensor network layout using multi-purpose metaheuristics., J. UCS 14 (15)
(2008) 2549–2565.
[24]. A.J. Al-Mousawi, Transmutative intelligence in wireless sensor network: routing, clustering, localization and scope,
Wirel. Netw. 26 (8) (2019) 1–27.
[25]. J. Grefenstette, Optimization of control parameters for genetic mechanisms, IEEE Trans. Syst. Man Cybern. 16 (1)
(1986) 122–128.
[26]. Y. Sun, W. Dong, Y. Chen, An improved routing mechanism based on ant colony optimization in wireless sensor
networks, IEEE Commun. Lett. 21 (6) (2017) 1317–1320.
[27]. A. Mehrotra, K.K. Singh, P. Khandelwal, An unsupervised change detection technique based on ant colony
optimization, in: 2014 International Conference on Computing for Sustainable Global Development (INDIACom),
2014, pp. 408–411, http://dx.doi.org/10.1109/IndiaCom.2014.6828169.
[28]. S. Arjunan, P. Sujatha, Lifespan maximization of wireless sensor network using fuzzy based unequal clustering and
ACO based routing hybrid protocol, Applied Intelligence 48 (8) (2018) 2229–2246.
[29]. Z.X. Wang, M. Zhang, X. Gao, W. Wang, X. Li, A clustering WSN routing protocol based on node power and
multipath, Cluster Comput. (2017) 1–13.
[30]. Prachi Maheshwari, Ajay K. Sharma, Karan Verma, “Power efficient cluster-based routing protocol for WSN using
butterfly optimization mechanism and ant colony optimization”, Ad Hoc Networks, Volume 110, 2021, 102317,
ISSN 1570-8705, https://doi.org/10.1016/j.adhoc.2020.102317.
[31]. J. Tian, M. Gao, G. Ge, Wireless sensor network node optimal scope based on improved genetic mechanism and
binary ant colony mechanism, EURASIP J. Wireless Commun. Networking 2016 (1) (2016) 104.
[32]. M. Yazdani, F. Jolai, Lion optimization mechanism (loa): a nature-inspired metaheuristic mechanism, J. Comput.
Des. Eng. 3 (1) (2016) 24–36.
[33]. G. Han, H. Xu, T.Q. Duong, J. Jiang, T. Hara, Localization mechanisms of wireless sensor networks: a survey,
Telecommun. Syst. 52 (4) (2013) 2419–2436.
[34]. B. Xing, W.-J. Gao, Innovative computational intelligence: a rough guide to 134 clever mechanisms, in: Intelligent
Systems Reference Library, Springer, 2014, pp. 1–451.
[35]. F. Campelo, C. Aranha, R. Koot, Transmutative computation bestiary, 2019, URL: https://github.com/fcampelo/EC-
Bestiary (accessed November 1, 2020).
[36]. A. Tzanetos, I. Fister Jr, G. Dounias, A comprehensive informationbase of nature-inspired mechanisms, Information
Brief (2020) 105792.
[37]. F. Tao, Y. Laili, L. Zhang, Brief history and overview of intelligent optimization mechanisms, in: Configurable
Intelligent Optimization Mechanism, Springer, 2015, pp. 3–33.
[38]. D. Pham, D. Karaboga, Intelligent Optimisation Techniques: Genetic Mechanisms, Tabu Search, Simulated
Annealing and Neural Networks, Springer Science & Business Media, 2012.19
[39]. T. M. Behera, S. K. Mohapatra, U. C. Samal, M. S. Khan, M. Daneshmand and A. H. Gandomi, "I-SEP: An Improved
Routing Protocol for Heterogeneous WSN for IoT-Based Environmental Monitoring," in IEEE Internet of Things
Journal, vol. 7, no. 1, pp. 710-717, Jan. 2020, doi: 10.1109/JIOT.2019.2940988.
[40]. Vinitha, M.S.S Rukmini, International Journal of Pure and Applied Mathematics Volume 118 No. 11 2018, 725-732
ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi:
10.12732/ijpam.v118i11.93.
[41]. Xie, B., & Wang, C. (2017). An Improved Distributed Power Efficient Clustering Mechanism for Heterogeneous
WSNs. 2017 IEEE Wireless Communications and Networking Conference
(WCNC). doi:10.1109/wcnc.2017.7925670.
[42]. M.T. Mekonnen, K.N. Rao, Cluster optimization based on metaheuristic mechanisms in wireless sensor networks,
Wireless Personal Communications 97 (2) (2017) 2633–2647.
[43]. Anamika Chauhan and Amit Kaushik, “TADEEC: Threshold Sensitive Advanced Distributed Power Efficient
Clustering Routing Protocol for Wireless Sensor Networks,” International Journal of Computer Applications (0975
– 8887), Volume 96 No.23 June 2014.
[44]. K. Haseeb, K.A. Bakar, A. Ahmed, T. Darwish, I. Ahmed, WECRR: weighted powerefficient clustering with robust
routing for wireless sensor networks, Wireless Personal Communications 97 (1) (2017) 695–721.
[45]. . Haseeb, K.A. Bakar, A.H. Abdullah, T. Darwish, Adaptive power aware clusterbased routing protocol for wireless
sensor networks, Wireless Networks 23 (6) (2017) 1953–1966.
[46]. P. Lalwani, S. Das, H. Banka, C. Kumar, CRHS: clustering and routing in wireless sensor networks using harmony
search mechanism, Neural Computing and Applications 30 (2) (2018) 639–659.
[47]. G. Han, L. Zhang, WPO-EECRP: power-Efficient Clustering Routing Protocol Based on Weighting and Parameter
Optimization in WSN, Wireless Personal Communications 98 (1) (2018) 1171–1205.
[48]. Z.X. Wang, M. Zhang, X. Gao, W. Wang, X. Li, A clustering WSN routing protocol based on node power and
multipath, Cluster Comput. (2017) 1–13.
[49]. N. Javaid, T. N. Qureshi, A.H. Khan, A. Iqbal, E. Akhtar and M. Ishfaq (2013), “EDDEEC: Enhanced Developed
Distributed Power-Efficient Clustering for Heterogeneous Wireless Sensor Networks”, ELSEVIER, Procedia
Computer Science 00, 2013, pp 1-6.
[50]. M. Y. Khan, N. Javaid, M. A. Khan,"Hybrid DEEC: Towards Efficient Power Utilization in Wireless Sensor
Networks", Published in World Applied Science Journal (ISI Indexed), 2013.
[51]. S. Arora, S. Singh, Butterfly optimization mechanism: a novel approach for global optimization, Soft comput. 23
(3) (2019) 715–734
[52]. Saini, Parul, and Ajay K. Sharma. "E-DEEC-enhanced distributed power efficient clustering scheme for
heterogeneous WSN." Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on.
IEEE, 2010.
[53]. Elbhiri, Brahim, et al. "Developed Distributed Power-Efficient Clustering (DDEEC) for heterogeneous wireless
sensor networks." I/V Communications and Mobile Network (ISVC), 2010 5th International Symposium on.IEEE,
2010.
[54]. J. Luo, J. Hu, D. Wu and R. Li, "Opportunistic Routing Mechanism for Relay Node Selection in Wireless Sensor
Networks," in IEEE Transactions on Industrial Informatics, vol. 11, no. 1, pp. 112-121, Feb. 2015, doi:
10.1109/TII.2014.2374071.
[55]. Cui, Z., Xue, F., Zhang, S., Cai, X., Cao, Y., Zhang, W., & Chen, J. (2020). A Hybrid BlockChain-Based Identity
Authentication Scheme for Multi-WSN. IEEE Transactions on Services Computing, 1–
1. doi:10.1109/tsc.2020.2964537.
[56]. Sabir Hussain Awan, et al.,” BlockChain with IoT, an Emergent Routing Scheme for Smart Agriculture”, 2020
(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 11, No. 4,pp.420-429, 2020.
[57]. A. Gambhir, A. Payal, and R. Arya, “Performance analysis of artificial bee colony optimization-based clustering
protocol in various scenarios of WSN,” Procedia Computer Science, vol. 132, pp. 183–188, 2018.
[58]. L. Feng, H. Zhang, L. Lou and Y. Chen, "A Blockchain-Based Collocation Storage Architecture for Information
Security Process Platform of WSN," 2018 IEEE 22nd International Conference on Computer Supported Cooperative
Work in Design ((CSCWD)), Nanjing, 2018, pp. 75-80, doi: 10.1109/CSCWD.2018.8465319.
[59]. F. Engmann, F. A. Katsriku, J. Abdulai, K. S. Adu-Manu, and F. K. Banaseka, “Prolonging the Lifespan of Wireless
Sensor Networks: A Review of Current Techniques,” Wireless Communications and Mobile Computing, vol. 2018,
pp. 1–23, 2018.
[60]. M. K. Khan, M. Shiraz, K. Z. Ghafoor, S. Khan, A. S. Sadiq, and G. Ahmed, “EE-MRP: Power-Efficient Multistage
Routing Protocol for Wireless Sensor Networks,” Wireless Communications and Mobile Computing, vol. 2018,
2018.
[61]. C. Xu, Z. Xiong, G. Zhao and S. Yu, "An Power-Efficient Region Source Routing Protocol for Lifespan
Maximization in WSN," in IEEE Access, vol. 7, pp. 135277-135289, 2019, doi: 10.1109/ACCESS.2019.2942321.
[62]. 20. M. Sheik Dawood, S. Sakena Benazer, S.K. Vijaya Saravanan, V. Karthik, Power efficient distance based
clustering protocol for heterogeneous wireless sensor networks, Elsevier, Materials Today:
Proceedings,2020,ISSN 2214- 7853,chttps://doi.org/10.1016/j.matpr.2020.11.339.
[63]. Mehta, D., & Saxena, S. (2020). MCH-EOR: Multi-purpose Cluster Head based Power-aware Optimized Routing
Mechanism in Wireless Sensor Networks. Sustainable Computing: Informatics and Systems,
100406. doi:10.1016/j.suscom.2020.100406.
[64]. Hussien, Abdelazim & Amin, Mohamed & Wang, Mingjing & Liang, Guoxi & Alsanad, Ahmed & Gumaei, Abdu
& Chen, Huiling. (2020). Crow Search Mechanism: Theory, Recent Advances, and Applications. IEEE Access.
10.1109/ACCESS.2020.3024108.
[65]. Kaushik, A., Indu, S., & Gupta, D. (2019). A Grey Wolf Optimization Approach for Improving the Performance of
Wireless Sensor Networks. Wireless Personal Communications. doi:10.1007/s11277-019-06223-2
[66]. Yu Xiuwu, Liu Qin, Liu Yong, Hu Mufang, Zhang Ke, Xiao Renrong, Uneven clustering routing mechanism based
on glowworm swarm optimization, Ad Hoc Networks, Volume 93,2019, 101923, ISSN 1570-8705,
https://doi.org/10.1016/j.adhoc.2019.101923.
[67]. Mahesh, N., Vijayachitra, S. DECSA: hybrid dolphin echolocation and crow search optimization for cluster-based
power-aware routing in WSN. Neural Comput & Applic 31, 47–62 (2019). https://doi.org/10.1007/s00521-018-
3637-4
[68]. Y. Lin, J. Zhang, H.S.-H. Chung, Wai Hung Ip, Yun Li, Yu.-Hui. Shi, An ant colony optimization approach for
maximizing the lifespan of heterogeneous wireless sensor networks, IEEE Trans. Syst. Man. Cybernet., 42 (3)
(2012), pp. 408-420
[69]. Cui, Z., Xue, F., Zhang, S., Cai, X., Cao, Y., Zhang, W., & Chen, J. (2020). A Hybrid BlockChain-Based Identity
Authentication Scheme for Multi-WSN. IEEE Transactions on Services Computing, 1–
1. doi:10.1109/tsc.2020.2964537
[70]. Lazrag, H., Chehri, A., Saadane, R., & Rahmani, M. D. (2020). Efficient and secure routing protocol based on
Blockchain approach for wireless sensor networks. Concurrency and Computation: Practice and Experience, John
Wiley & Sons, Ltd. doi:10.1002/cpe.6144
[71]. She, W., Liu, Q., Tian, Z., Chen, J., Wang, B., & Liu, W. (2019). Blockchain Trust Model for Malicious Node
Detection in Wireless Sensor Networks. IEEE Access, 1–1. doi:10.1109/access.2019.2902811
[72]. Liu, Y., Dong, M., Ota, K., & Liu, A. (2016). ActiveTrust: Secure and Trustable Routing in Wireless Sensor
Networks. IEEE Transactions on Information Forensics and Security, 11(9), 2013–
2027. doi:10.1109/tifs.2016.2570740
[73]. Belkasmi, M., Ben-Othman, J., Li, C., & Essaaidi, M. (Eds.). (2020). Advanced Communication Systems and
Information Security. Communications in Computer and Information Science. doi:10.1007/978-3-030-61143-9
[74]. M. Sheik Dawood, S. Sakena Benazer, S.K. Vijaya Saravanan, V. Karthik,Power efficient distance based clustering
protocol for heterogeneous wireless sensor networks, Materials Today: Proceedings, 2020, ISSN 2214-7853,
https://doi.org/10.1016/j.matpr.2020.11.339.
[75]. D. Yi, H. Yang, HEER – A delay-aware and power-efficient routing protocol for wireless sensor networks, Computer
Networks, Volume 104, 2016, Pages 155-173, ISSN 1389-1286, https://doi.org/10.1016/j.comnet.2016.04.022.
[76]. H. Mostafaei, "Power-Efficient Mechanism for Reliable Routing of Wireless Sensor Networks," in IEEE
Transactions on Industrial Electronics, vol. 66, no. 7, pp. 5567-5575, July 2019, doi: 10.1109/TIE.2018.2869345.