Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx

Contents lists available at ScienceDirect

Journal of King Saud University –

Computer and Information Sciences
journal homepage: www.sciencedirect.com

Secure and energy aware multi-hop routing protocol in WSN using

Taylor-based hybrid optimization algorithm
A. Vinitha a, M.S.S. Rukmini b, Dhirajsunehra c
a
Kshatriya College of Engineering, Chepur, Armoor, T.S. 503224, India
b
Vignan’s University, Guntur, A.P, India
c
JNTU, Jagityal, T.S, India

a r t i c l e i n f o a b s t r a c t

Article history: The advancements of Wireless sensor network (WSN) in large number of applications made it common.
Received 4 July 2019 However, the energy is a major challenge in the WSN environment as the battery-operated sensor nodes
Revised 15 November 2019 in the network consumes huge amount of energy during transmission. This work addresses the energy
Accepted 15 November 2019
issue and provides an energy efficient multi-hop routing in WSN named Taylor based Cat Salp Swarm
Available online xxxx
Algorithm (Taylor C-SSA) by modifying C-SSA with Taylor series. This method undergoes two stages
for attaining multi-hop routing, which includes selection of cluster head (CH), and transmission of data.
Keywords:
Initially, the energy-efficient cluster heads are selected using the Low Energy Adaptive Clustering
WSN
Energy
Hierarchy (LEACH) protocol for effective data transmission, the sensor nodes sends data over the CH,
Multi-hop routing which transmits the data to the base station through the selected optimal hop. The optimal hop selection
Trust is done using the proposed Taylor C-SSA. Moreover, the security aware multi-hop routing is performed by
LEACH introducing trust model that involves indirect trust, integrity factor, direct trust, and data forwarding
rate. The proposed Taylor C-SSA algorithm shows best performance in terms of energy, number of alive
nodes, delay, and throughput values of 0.129, 42, 0.291, and 0.1, respectively.
Ó 2019 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an
open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

1. Introduction cations for the huge-scale WSN can be considered in different

The rapid advancements in WSNs have inspired the growth of
low-cost and less power- equipped devices. The sensors consist
of signal processing devices, and sensing equipments that provide
several capabilities for processing WSN nodes to initiate wireless
communications. The sensor networks are helpful in many areas,
like chemical plant, disaster area, and nuclear reactor. WSN is con-
sidered as a network that contains different nodes, which accumu-
lates the data from neighbours and transmits the data that are
sensed to its sink node in a sovereign manner (Jain & Trivedi,
2012). Thus, WSN can monitor the external environments and con-
verts the sensed data into a user-understandable form. WSN cover
lots of applications, which involves home, military, environment
and hospital (Huang et al., 2009). Moreover, the forthcoming appli-
Peer review under responsibility of King Saud University.
Production and hosting by Elsevier
fields, which include monitoring the environments, military appli-
cations, and surveillance. Moreover, the sensors are generally inex-
pensive and endow less battery power and thus, constrained with
energy issues. The major problem in WSN is to increase network
lifetime, whenever initial node is not capable to transmit the data
to the sink node. In applications of data gathering, each node is
responsible for sensing the data packets to sink node. The process
of aggregating data minimizes data traffic and stores the energy by
integrating different incoming data packets into single packet.
Thus, many applications are designed for extending the network
lifetime (Hussain & Islam, 2007).
The efficiency of energy is a major problem in WSN, as sensor
nodes are activated using battery. Thus, the usage of energy is
managed for prolonging the system lifetime. The sensor node in
WSN poses two roles: First is to accumulate data from the physical
environment and second function is data routing from itself to sur-
rounding nodes from the base stations and collect the data from
WSN for processing. The multihop network is the common mech-
anism used in huge-scale network for sending data directly to the
sink node (Jakobsen, et al., 2010). WSN faces energy as a major

https://doi.org/10.1016/j.jksuci.2019.11.009
1319-1578/Ó 2019 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University.
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
2 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx
challenge while initiating the communication. Thus, the number of
transmissions must be minimized for providing the effective rout-
ing to attain extended system lifetime. The wireless sensor system
consists of nodes in which node is harmonized and data that are
sensed are linked. The uninterrupted monitoring is a fundamental
instance for this type of system. The WSN applications suffer from
energy constraint as the nodes broadcast the obtained data to the
sink node. Thus, usage of different paths for gathering the data in
WSN has the ability to balance the energy and network lifetime.
The sensor lifetime is the time, when sink node obtains data
through the sensors contained in WSN. The solitary path places
more overhead in a particular node thereby, causes low lifetime.
Thus, balancing the energies amongst the nodes helps to maximize
the network lifetime (Hussain & Islam, 2007).
The routing mechanisms (Mohan & Ananthula, 2019; Mohan &
Reddy, 2018) are important in WSN as they provide less energy
consumption, latency, Quality of Service (QoS), and data through-
put. As WSN is application-specific, various protocols are devised
for addressing the problems caused while routing data packets.
The existing protocols solve the energy issues in WSN that ranges
from physical to application layer (Pantazis et al., 2013). Several
protocols (Johnson et al., 2001; Perkins & Royer, 1999), and
(Perkins & Bhagwat, 1994) were devised for routing the data start-
ing from initial node to target node involves Link Quality Source
Routing (LQSR) (Draves et al., 2004), are considered for routing
the data packets in WSN and are known as traditional routing
(Rozner et al., 2009). In (Zhan et al., 2012), a multipath routing pro-
tocol named Trust-Aware Routing Framework (TARF) is designed
in WSN by computing the reliability of neighbouring nodes. The
protocol neglects the unreliable nodes and performs routing on
the basis of energy efficiency and trust evaluation (Zahedi &
Parma, 2018). In (Zahariadis et al., 2011), distributed algorithm
was designed for computing the nodes reliability using Ambient
Trust Sensor Routing (ATSR). Here, every node is utilized to moni-
tor the activities of neighbour’s on the basis of particular criteria of
trust and computes the value of direct trust using the neighbouring
nodes. In (Babu et al., 2011), Trust dependent Link State Routing
Protocol (TLSRP) algorithm was designed for multihop routing
based on indirect and direct trust. The multi-hop routing protocols
are based on two different categories, Location routing protocols
and data centric routing protocols. The data centric routing uses
the sink node for transmitting the queries to specific regions
(Maheswari, 2018). Likewise, the hierarchical routing is utilized
for maintaining the energy consumption among the sensor nodes
using multi-hop communication for reducing the transmitted mes-
sage to the sink. Different routing protocols for sensor networks
are deigned, which needs location information of the nodes for fur-
ther processing. Here, the location information is used for comput-
ing the distance between the two nodes and estimate the
consumed energy (Akkaya & Younis, 2003).
The multi-hop routing assists the routing within the network
beyond the communication range, which is constrained by energy
factor. Here, delay has been minimized, but energy consumption is
high and hence, the routing needs to save the energy. Therefore,
researchers’ aim towards developing an energy-efficient routing
protocol. The main aim of this work is to development an energy
efficient multi-hop routing protocol for WSN using a hybrid opti-
mization algorithm. In this work, two operations are carried out,
which include choosing the Cluster Head (CH) and Multi-hop rout-
ing. In CH selection, optimal CH is selected using LEACH protocol
and then, the data transmission is carried out using the multi-
hop routing. Thus, the optimal hop for data transmission is started
by placing the hops in an optimal manner, which is done using the
proposed Taylor C-SSA. The proposed Taylor C-SSA is designed by
incorporating Taylor series in the C-SSA, exhibiting the qualities
of both Taylor series and C-SSA. Moreover, the security of the
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
routing is maintained by including the trust model in the fitness
function. The trust model contains several parameters such as
direct trust, indirect trust, data forwarding rate, and integrity fac-
tors. The newly devised fitness function considers several parame-
ters like delay, Link-Lifetime, inter-cluster distance, energy, intra-
cluster distance, and trust model to maintain energy efficiency in
the routing process.
The major contributions of the research are:
Proposed Taylor C-SSA: The proposed Taylor C-SSA is essential
for the effective placement of the hops to progress the multihop
routing. The proposed technique is obtained through the inclusion
of the Taylor series in the C-SSA algorithm, which is the integration
of the Cat Swarm optimization (CSO) and Slap Swarm algorithm
(SSA) for determining the optimal hops to perform the multi-hop
routing in WSN. The security-aware multihop routing is devised
by including the trust model in the fitness function. Thus, the mul-
tihop routing is progressed using the proposed Taylor C-SSA-based
fitness function.
The remaining sections are arranged as follows: Here, the Sec-
tion 2 describes review of the conventional methods of multihop
routing along with the challenges. The proposed method of
security-aware multihop routing is deliberated in Section 3 and
the results for proving the effectiveness of proposed method is
described in Section 4. At last, Section 5 illustrates the conclusion.
2. Motivation
The section discusses the literature survey of multihop routing
techniques in WSN along with their drawbacks. Also, the chal-
lenges of the existing methods are deliberated, which can be used
for designing the protocol.
2.1. Literature review
Literature review height existing techniques based on multihop
routing in WSN are elaborated as follows:
Cengiz and Dag (2018) developed a protocol named energy-
efficient multi-hop routing protocol for routing data in WSN. Here,
a green routing protocol was devised for reducing the excessive
overhead. The method could enhance the lifetime of network sig-
nificantly that would probably reduce the overhead using an
energy efficient protocol. The relay nodes were utilized in this
method, which allowed the transmission of accumulated cluster
data using inter cluster transmissions. Thus, the scalability of
WSN was subsequently maximized and the use of relay nodes pro-
vided positive impact while dissipating energy in the WSN. This
method did not suitable for large size networks.
Purkait and Tripathi (2017) developed a protocol named energy
efficient cluster based routing protocol based on fuzzy logic using
multi-hop routing technique, in which the size of cluster was
dynamic. The configuration of size of cluster, and fuzzy logic
approach was utilized for implementing the protocol. The perfor-
mance was evaluated on the basis of devised protocol based on
alive nodes count and other protocols. The method improved the
network lifetime and attained minimal speed of dead nodes. The
computational time of this method was high.
Selvi et al. (2017) developed a delay constrained energy effi-
cient routing technique for multihop routing in WSN. This method
provided a delay limitation and provides trustworthy routing for
reducing the consumed energy by assembling proficient clusters
without maximizing delay. This method improved performance
based on network lifetime and the overhead caused by the method
was tackled effectively. However, this method did not consider
mobility parameters for improving the QoS service based on con-
gestion control, flow control, and routing.
 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx
Sert et al. (2018) developed a method named Two-Tier Distrib-
uted Fuzzy Logic Based Protocol (TTDFP) for extending the lifetime
of WSNs by evaluating the efficiencies of routing. This method was
termed as a distribution adaptive protocol, which could efficiently
run in sensor network applications. The method used fuzzy clus-
tering for optimizing the performance of the WSN. The method
was not applicable with other optimization algorithms, like Parti-
cle Swarm Optimization (PSO) (kulkarni & Murugan, 2019) and
needs addition WSN coupled parameters.
Chen and Shen (2018) developed a method named grid-based
reliable multi-hop routing protocol for performing routing in WSN.
The method had the ability for balancing the energy consumption
and optimized CH selection based on residual energy and location
of the node. The method improved the stability period and showed
improved performance on the basis of energy, delays and ensured
reliable transmission. However, the method did not yield a stable
and scalable protocol. Thus, nodes posing higher energy are utterly
elected to work as relays. In addition, the entire consumption of ener-
gies for both transmitter and receiver had been fused for modelling
the links weight amongst nodes. At last, the Dijkstra algorithm was
utilized for searching the path with minimum cost. Moreover, two
MH protocols were commenced on the basis of BEEMH algorithm.
Fawzyet al. (2018) designed an algorithm named Balanced and
Energy Efficient Multi-Hop (BEEMH) algorithm to perform multi-
hop routing in WSN. This method was devised on the basis of Dijk-
stra algorithm. This method provided great interest in node’s
residual energy. Thus, the nodes with higher energy were consid-
ered for transmitter and receiver node for providing the inter-
cluster head communications among clustering routing protocols.
The method provided effective platform for optimizing the cluster
head selection using several parameters, like energy and location.
However, the method did not optimize the grid regions and
affected the reliable communication among the nodes that yielded
to poor performance.
Akila and Venkatesan (2018) designed a method, named geo-
clustering process on the basis of location of the node to obtain
effective energy-saving in WSN. This method maximized the life-
time of the network, but this method was complicated as the per-
formance parameters adapted for the routing provided complex
tradeoff between the parameters. Thus, the energy efficient clus-
tering extended the lifetime of network, but the throughput was
not acceptable.
Laouidet al. (2017) developed a method named balanced multi-
path routing algorithm based on energies of residues and the count
of hops of each node for determining optimal routes and to interleave
them in routing table. The method was devised on the basis of auto-
mata network modelization and Ant Colony Optimization (ACO).
Here, the algorithm performance was based on optimal routes and
less number of hops and provided the low energy routes, but the fault
tolerance and the scalability was poor in this method.
Huynh & Tran (2016). modelled the distributed clustering
approach that offered proper trade-off between energy consump-
tion and end-to-end delay, but the problem was regarding the
selection of the optimal hops. Sajwan et al. (2018) developed the
Hybrid energy-efficient multi-path routing algorithm that mini-
mized the energy consumed at the nodes, but the distance was a
major factor that affected the performance.
2.2. Research gaps
The research gaps in the multi-hop routing are listed as follows:

The energy constraints and the limited computing resources of
sensors nodes are the major challenges in WSN. The major
drawback is to preserve the sensor’s energies by maximizing
the lifetime of WSN (Huang, et al., 2009).
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
3

The batteries were used for operating the sensor nodes, which
pose a fixed energy source and thus, replacing many batteries
is impractical and a major issue. Thus, the power-efficient tech-
niques are important in WSN to extend WSN lifetime. Thus, the
sink node suffers from an isolation problem that defines the iso-
lation of the sink node, which results in energy starvation
(Abdulla et al., 2012).

The major challenge in sensor network is the security, which lie
in between maximizing security and minimizing resource con-
sumption. Also, the constraints of sensor nodes affect the pri-
vacy, which is hosted on platform of sensor node. The attacks
generated on the WSN can intend one node, which becomes
liable to leak confidential information and impersonating nodes
(Riad et al., 2013).

The sink node is liable to receive the interpretation of individual
sensor as single packet instead it receives the data as the
weighed sum during the multihop routing on the basis of Com-
pressive sensing technique (Wang et al., 2010).

The cost of transmission and the uneven distribution of traffic
load throughout network is a challenge, which should be mini-
mized. The usage of a large number of sensor nodes for individ-
ual compressive sensing cause’s energy consumption in an
unproductive way (Heinzelman, 1995).

The distribution of traffic load and transmission cost over the
network suffers from a major challenge as it should be reduced.
The use of less sensor nodes for compressive sensing cause
energy consumption in an ineffective way (Heinzelman, 1995).
3. Proposed multihop routing using Taylor based C-SSA
algorithm
In this section, the security-aware multi-hop routing protocol
based on multiple objectives in WSN is illustrated using the newly
designed optimization algorithm. Here, a trust model is employed
considering various trust factors, such as direct trust, indirect trust,
integrating factor, and forward rate factors along with other
parameters, which involves distance, delay, intra-cluster distance,
link lifetime, energy and inter-cluster distance. The trust model
is included for offering high security to the network. Then, the mul-
tihop routing is performed by the proposed Taylor-based Cat Salp
Swarm Algorithm (Taylor C-SSA). The proposed Taylor C-SSA is
designed by integrating the Taylor series (Mangai et al., 2014) with
C-SSA. The proposed Taylor C-SSA and the multi objectives are
used to perform security-aware multi-hop routing in WSN. The
two steps are considered for multihop routing. In first step, CH is
selected using the LEACH (Masdari et al., 2013) protocol to obtain
the optimal CH with maximal energy. Then, the second step is pro-
gressed by the selection of optimal hops using the proposed Taylor
C-SSA based on the devised multi-objectives. Fig. 1 shows the sche-
matic diagram of proposed multihop routing based on Taylor C-
SSA algorithm.
3.1. LEACH protocol for cluster head selection
The LEACH protocol (Masdari et al., 2013) considers a dense
sensor network containing nodes with equivalent energy, whose
task is to send the data to sink node. Thus, an optimal CH is chosen
for collecting and broadcasting the data to sink node. In some
cases, sink is placed in far, and thus, the CH requires more energy
for transmission. Thus, LEACH must select a CH in such a way that
the selected node poses higher energy. Thus, the LEACH protocol
uses a random number of rotations of CH for evenly distributing
the energy amongst sensors. In LEACH, the nodes are completely
distributed and hence, do not require any control information from
the base station, and does not require the global information of the
network. The network lifetime is concentrated and increased and
4 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx
Fig. 1. Proposed multihop routing using Taylor based C-SSA.
there is no need for the information regarding the location of the
node. Additionally, using the LEACH facilitates the aggregation of
the collected data in the CH that minimizes the traffic in the net-
work. LEACH is a MAC protocol that assumes the homogenous net-
work of nodes engaged in collecting the data and transmitting to
the sink node. Since the nodes consume large amount of energy,
the LEACH evenly distributes the energy in the nodes so that the
energy load is minimized. Here, LEACH protocol is arranged in a
specific manner and once an optimal percentage of CH is deter-
mined, then LEACH protocol proceeds in 1g rounds. For each round,
a group of CH is determined with size hg , where h represents the
total number of rounds and gdenote the CH. Here, each round con-
tains steady-state phase and set-up phase. The set up phase con-
tains three subphase, which includes advertisement, cluster
setup, and broadcast schedule subphase. The advertisement phase
is proceeded as follows, Here each node h produces a random num-
ber in the range 0 and 1 and evaluate it with the predefined thresh-
old. The threshold is given by,
( g
1gðc mod
; if e 2 a
Q ðhÞ ¼
1
gÞ
0; Otherwise
where, a represents the node that is never been a CH, g denote CH,
and c indicates update interval of current topology. Thus, the nodes
that make a decision to be a CH notifies its neighbour with adver-
tisement packet. In cluster head setup phase, all other nodes pre-
sent in the network replies the CH advertisement to inform their
decisions. In broadcast phase, the replies of all the nodes are gath-
ered for deciding the membership of particular cluster. Here, the CH
produces a TDMA schedule based on total nodes in the cluster. This
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
schedule strikes a chord among node concerning time to broadcast
the message in a specific time. Finally, for transmitting data, the
data are collected in the CH and then, the obtained data is sent to
sink node. Here, node transmits the data to its CH and the CH then
sends to base station. Thus, the LEACH protocol is used for selecting
the optimal CH based on energy parameter. Hence, the CH formed
by the LEACH protocol is given by,
G ¼ fG1 ; G2 ;    ; Gt ;    ; Gn g ; 16t6n ð2Þ
where, n specifies the total CH using LEACH protocol.
3.2. Proposed Taylor C-SSA for multihop routing
The multihop routing in WSN has optimized the communica-
tion over the network. The multi hop routing is usually employed
for effective data transmission. However, the energy is the major
constraint in multihop routing. Thus, for resolving the issues of
energy, the proposed Taylor C-SSA employs multihop routing in
which the source node sends their data to the CH through the
intermediate nodes inside each cluster. Here, each source node in
ð1Þ
the cluster sends their data to the neighbour node for minimizing
the transmission energy. The proposed Taylor C-SSA derives the
optimal hops based on the newly devised fitness function for pro-
gressing the routing in WSN.
3.2.1. Solution encoding
The solution encoding is the representation of the solution
determined using the proposed Taylor C-SSA algorithm. Here, the
solution is the optimal route selected for transmitting the data.
The optimization methods use the proposed Taylor C-SSA
 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx 5

algorithm based on newly devised multi-objective fitness function where, l represents the total nodes present in WSN, and b indicates
for finding the optimal hop from the set of hops present in the the total number of hops needed for the routing.
WSN. The hops are the chosen CH that has the ability to provide iii) Intra-cluster distance: The intra-cluster distance is com-
effective routing in the network by decreasing the information loss puted by summation of distances between hop and the individual
that occurred throughout the transmission. Here, the proposed nodes present in the hop and is minimal. If the intra-cluster dis-
Taylor C-SSA algorithm is adapted for determining the best path tance is minimum, then the nodes are closer to the hop thereby
from source node. Fig. 2 represents the solution encoding of pro- the energy and information loss is reduced. The formula of intra-
posed Taylor C-SSA based on multiobjective fitness function. Con- cluster distance is expressed as,
sider S1 is the initial node and S4 is the target node, then the optimal
Pb Ps !
route S1 ! S2 ! S3 ! S4 is selected using the proposed Taylor C- 1 t2k XðJ k ; Lt Þ
SSA and is represneted as in Fig. 2. X¼ k¼1
ð7Þ
b b

3.2.2. Fitness function based on multiple objectives for multihop

routing where, b represents the regularization factor, XðJk ; Lt Þ denote the
th
The fitness function is evaluated for finding the optimal solution distance between the k hop and t th node, the total nodes is repre-
from a solution using a set of parameters. The fitness computed for sented as s.
proposed Taylor C-SSA uses seven parameters, namely trust model, iv) Inter-cluster distance: The ratio of the distance computed
energy, distance, link lifetime, inter-cluster distances, delay and between two clusters is known as inter-cluster distance and must
intra-cluster distances. Here, the fitness is considered as a maxi- be maximal for providing the effective routing. The formula of
mization function. Thus, the solution yielding the maximum trust, inter-cluster distance is given by,
link lifetime, intra-cluster, energy and less delay, distance and
Pn Pn 
inter-cluster distance is used for the routing. Hence, the solution t¼xþ1 XðGx ; Gt Þ
X ¼ x¼1
ð8Þ
providing maximum value of fitness is considered for multihop b
routing. The fitness of the proposed Taylor C-SSA is formulated as,
O ¼ W 1  P þ W 2  ð1  T Þ þ W 3  ð1  X  Þ þ W 4  X þ W 5 where, XðGx ; Gt Þ denote the distance between two clusters, and n
represents the total CH.
 ð1  DÞ þ W 6  M þ W 7  K ð3Þ v) Distance: The summation of the distance computed between
where, W 1 , W 2 , W 3 ,W 4 , W 5 , W 6 and W 7 represents the weights the two hops represented in Eq. (9). The distance should be mini-
computed using the fuzzy membership function (Dennis & mal for multihop routing and is represented as,
Muthukrishnan, 2014). Pdenote the node’s energy, Trefers trans- Pb1  !
mission delay, X  indicates the inter-cluster distance, Drepresents 1 k¼1 X J k ; J kþ1
D¼  ð9Þ
the distance between two hops, Xis the intra-cluster distance and b b
Mis the link-time, and the trust model is denoted as K. The weight
is computed using the following equation,
vi) Link Lifetime: The network lifetime is derived from the link
8
>
> 0; if r < f lifetime and should be maximal to attain effective routing. The link
> rf
>
< ; if f 6 r 6 p lifetime is represented as,
pf
W¼ ð4Þ
>
>
qr
; if p 6 r 6 q
>
> qp
1 Xb1
MðJ k ; J kþ1 Þ
: M¼  ð10Þ
0; if r P q b k¼1 b
where, p; q; and r denote the vertices of triangular membership
function Tðf Þ. Here, p is the lower boundary, q is the medium th
where, MðJk ; Jkþ1 Þ represents the link lifetime of the k hop and
boundary with membership value 1 and r is the upper boundary th
ðk þ 1Þ hop.
with membership value 0.
vii) Trust model: The trust model (Zhu, 2018; Das & Islam,
i) Energy: The network energy is defined as the summation of
2012) provides security in the proposed technique during the rout-
the energies of all hops, which indicates the energy remained in
ing process. Trust computation model is used for computing the
the nodes. The energy must pose a high value and is formulated as,
trust of agents in the presence of suspicious behaviour. Several
1X b
parameters are considered for computing the trust, which involves
P¼ EðJ k Þ ð5Þ direct trust, indirect trust, forwarding rate factor, and integrity fac-
b k¼1
tor. Here, each hop in the WSN provides higher trust degrees for
where, b represents number of hops that take part in multihop rout- evaluating the trust level among the hops and the neighbouring
th hop. It offers higher scalability as the value is computed using
ing, and EðJk Þ denote the energy of the k hop.
ii) Delay: The delay is computed using the hops that take part in the information of network topology. The trust model is formu-
routing and the delay should be less for performing effectual rout- lated using four parameters named direct trust, indirect trust, for-
ing. The delay is computed as the ratio of hops needed for the rout- warding rate factor, and integrity factor and is represented as,
ing total nodes contained in WSN and is formulated as, n o
K ¼ Kd þ Ki þ KF þ KI ð11Þ
b
T¼ ð6Þ
l where, K d represents the direct trust, K i is the indirect trust, K F
denote the forwarding rate factor, and K I indicates the integrity
factor.
S1 S2 S3 S4 a) Direct trust: The direct trust (Das & Islam, 2012) is also ter-
med as local trust and it presents the trust value that an agent cal-
culates from the familiarities while interacting with the target
Fig. 2. Solution encoding. agent.
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
6 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx
 z
K d ðk; k þ 1Þ ¼ funzy ðk; k þ 1Þ
y Nzy ðk; k
 z
where, K d represents the direct trust for yth transaction and zth
y ð20Þ
time interval, fun represents the satisfaction measure, y indicates
transactions, z is the time interval, k represents the evaluation
hop and the k þ 1 specifies the hop to be evaluated.
The satisfaction measure is used to compute the satisfaction
degree of an agent that has about the specified service. Thus, the
satisfaction measure keeps the record of the satisfaction level using
exponential averaging update function which is given by,
funzy ðk; k þ 1Þ ¼ g  funv þ ð1  gÞ  funzy1 ðk; k þ 1Þ
where, funv denote the satisfaction value of recent transaction, and
funzy1 ðk; k þ 1Þ denote the satisfaction value of y  1 transaction at
zth time interval, g indicates the weight.
8 ing rate factor (Zhu, 2018) is given by,
>
< 0; if trnasaction is fully unsatisfactory
funv ¼ 1; if trnasaction is fully satisfactory
>
: ðK F Þ ðk; k þ 1Þ ¼
2 ð0; 1Þ; otherwise
The weight g varies based on accumulated deviation Z zy ðk; k þ 1Þ
and is given by,
czy ðk; k þ 1Þ
g¼Y þj
1 þ Z zy ðk; k þ 1Þ
czy ðk; k þ 1Þ ¼ jfunzy1 ðk; k þ 1Þ  funv j
Z zy ðk; k þ 1Þ ¼ j  czy ðk; k þ 1Þ þ ð1  jÞ  Z zy1 ðk; k þ 1Þ
where, Y denote the threshold and poses fixed value and is set to
0.25, j indicates the user defined constant factor, czy ðk; k þ 1Þ repre-
sents the recent error, and Z zy ðk; k þ 1Þ is the accumulated deviation.
At first, the weight g is set to 1 and changes according to Eq. (15).
b) Indirect trust: Indirect trust (Das & Islam, 2012) is calculated
from the experience gained by other hops. Each hop uses the expe-
rience of other hops to provide effectual decisions for each transac-
tion. To attain indirect trust, each hop request other hops to
provide the recommendation about the other hop. The resultant
hop collects the suggestions from other hops alongside feedback
credibility of the recommended hops. Thus, the indirect trust of
th th
k hop with respect to ðk þ 1Þ hop is given by,
8P
>
< a2Vfkg
z
Hz ðk;aÞðK d Þy ða;kþ1Þ
z P y ; if
ðK i Þy ðk; k þ 1Þ ¼ Hzy ðk;aÞ
>
:
a2Vfkg
0; If jv  fkgj > 0
where, V represents the set of agents interacted with k þ 1, a denote
a hop, which interacts with other hops for making the prediction
about keeping trust, feedback creditability is denoted as Hzy . The
feedback credibility is utilized for computing the accuracy of the
feedback information that the recommended hop provided to the
estimator. Thus, the feedback creditability is formulated as,
( lnðN zy ðk;kþ1ÞÞ
1 ; if Nzy ðk; k þ 1Þ > u
Hzy ðk; k þ 1Þ ¼ lnu
0; Otherwise
where, Nzy denote the similarity. The similarity measure is described
as to determine till what extent the two hops are similar. Here, the
similarity is computed by finding the personalized difference based
on satisfaction rating with respect to the interacted agents and then
utilized the difference rating for describing the similarity. Thus, the
similarity of two hops k and ðk þ 1Þ is formulated as,
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
8 z
ð12Þ < Nz ðk; k þ 1Þ þ 1Ny1 ðk;kþ1Þ ; if Rzy ðk; k þ 1Þ < ‘
y1 x
þ 1Þ ¼
: N zy1 ðk;kþ1Þ
Nzy1 ðk; k þ 1Þ  d
; otherwise
where, ‘ denote the similarity deviation constant, Erepresents the
set of agents, x and d represents reward and punishment factor,
and Rzy ðk; k þ 1Þ denote personalized difference and is given by,
vffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
u P ðfunz ðk; aÞ  funz ðk þ 1; aÞÞ2
u y y
ta2Eðk;kþ1Þ
Rzy ðk; k þ 1Þ ¼ ð21Þ
jEðk; k þ 1Þj
ð13Þ
c) Forwarding rate factor: The nodes in WSN have less energy
that is dispersed while sensing and transferring the data. Thus, it
becomes possible for analyzing and judging if the node is assailed
or not by evaluating the forwarding nodes data. Thus, the forward-
ð14Þ z Az ðk; k þ 1Þ
ð22Þ
Bz ðk; k þ 1Þ
where, Az ðk; k þ 1Þ represents the count of feedback packets,
Bz ðk; k þ 1Þ denote the count of packets to forward, k is the evalua-
tion hop, and k þ 1 represent the hop to be evaluated.
d) Integrity factor: Whenever the data packet is transmitted to
ð15Þ
the neighbouring node, the source node examines if the data
packet is interfered or not and detects if the data packet is trans-
mitted with specific time, and assures the integrity and correctness
ð16Þ
of the data. The integrity factor (Zhu, 2018) is formulated as,
ð17Þ U z ðk; k þ 1Þ
K I ðk; k þ 1Þ ¼ ð23Þ
Ez ðk; k þ 1Þ
where, U z ðk; k þ !Þ is the number of completely forwarded packets
and Ez ðk; k þ 1Þ denote the number of packets to forward.
3.2.3. Proposed Taylor C-SSA algorithm for optimal hop selection
This section elaborates the proposed Taylor C-SSA, which is the
integration of Taylor series (Mangai et al., 2014) and C-SSA inher-
iting the advantage of both Taylor series and C-SSA algorithms. The
Taylor series is used to predict the linear part and describes the
historical stored values. The advantage of Taylor series is simpler
and easiest method to compute the solutions, even under the pres-
ence of the complex functions. The main advantages include that
the Taylor series ensures the accurate estimation of the common
functions and attains convergence easily. Moreover, the C-SSA is
jV  fkgj ¼ 0
designed by integrating the CSO (Chu et al., 2006) and SSA
(Mirjalili et al., 2017) algorithm and acquires the qualities of both
ð18Þ the algorithms and inherits a proper tradeoff between exploration
and exploitation phases, to attain best solution. The algorithm is
simpler to execute, and contains a single control parameter, which
is updated adaptively. The C-SSA exhibits the advantages of both
the algorithms that exhibits a proper balance between the
exploitation and exploration phases, and obtain the global optimal
solution. The C-SSA is easy to implement and possess a single con-
trol parameter that updates adaptively. Thus, the main aim of the
hybrid algorithm is to resolve the issues associated with the stan-
dard SSA algorithm through the integration of CSO. The proposed
ð19Þ
algorithm is capable of obtaining the global optimal solutions for
the unimodal, multimodal, and composite data.
Thus, the goal of the proposed Taylor C-SSA algorithm is to solve
the limitations of C-SSA algorithm by integrating the Taylor series
so that Taylor-C-SSA becomes capable to obtain global optimal
solution for composite data. The integration of the two techniques
assists to decide an optimal solution and enhances the conver-
gence and provides an optimal solution to attain effective multihop
 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx 7

routing. The steps that are carried out on the proposed Taylor C- The velocity update using the Taylor series is done by substitut-
SSA algorithm are discussed below: ing the Eq. (28) in Eq. (26) that is given below.
2 3
i. Initialization touþ1  1:3591tou1 þ 1:359tou2 
1 6 7
tuþ1 ¼
o
4 0:6795tou3 þ 0:2259tou4  0:555tou5 5
0:5 3 o 5 o ð29Þ
The algorithm is started with the initialization phase in which þ0:0104tu6  1:38e tu7 þ 9:92e tu8
o

the population of Salp is initialized and is represented as, þ #1  k1 ðC 

C ou Þ
C ¼ fC 1 ; C 2 ; . . . ; C o ; . . . C u g ð24Þ
2 3
1:3591tou1  1:359tou2 þ 0:6795tou3 
where, C o represents the position of oth Salp, and u is the position of 1 o
1 6 7
uth Salp. touþ1 ¼ t  4 0:2259tou4 þ 0:555tou5  0:0104tou6 þ 5
0:5 uþ1 0:5
1:38e3 tou7  9:92e5 tou8
ii. Evaluation of fitness function þ #1  k1 ðC   C ou Þ
ð30Þ
The next step is to evaluate the multiobjective fitness function
for attaining the best solution. The multi-objective fitness is gener- 2 3
1:3591tou1  1:359tou2 þ 0:6795tou3 
ated by utilizing seven objectives, namely distance, delay, inter- 1 6 7
cluster distance, intra-cluster distance, link lifetime, energy, and touþ1 ¼ 4 0:2259tou4 þ 0:555tou5  0:0104tou6 þ 5
0:5 3 o 5 o ð31Þ
trust as is expressed in equation (3). The fitness of each solution 1:38e tu7  9:92e tu8
contained in the population is evaluated based on the derived fit- þ #1  k1 ðC   C ou Þ
ness function. The solution providing best fitness value is consid-
ered as the optimal solution. Rearranging the above equation, the resultant equation can be
written as,
iii. Computation of the new solutions 2 3
2:7182tou1  2:718tou2 þ 1:359tou3 
In this step, the solutions are updated based on the proposed touþ1 ¼ 6 7
4 0:4518tou4 þ 0:111tou5  0:0208tou6 þ 5
ð32Þ
algorithm. CSO algorithm possesses higher search-ability and pro- 0:00276tu7  0:0001984tu8
o o

vides proper tradeoff between the exploitation and exploration þ #1  k1 ðC   C ou Þ

phases, to obtain the global optimal solution. Thus, the standard
equation of CSO is used for obtaining the better solution. Thus, 2 3
2:7182tou1  2:718tou2 þ 1:359tou3 
touþ1  #1  k1 ðC   C ou Þ ¼ 6 7
the update position of the CSO (Chu, et al., 2006) algorithm is uti-
lized based on position and the velocity of the cat at the current 4 0:4518tou4 þ 0:111tou5  0:0208tou6 þ 5
iteration. Once the prey is determined, the velocity of the cat is 0:00276tou7  0:0001984tou8
changed accordingly to catch the prey. Hence, the update position ð33Þ
of the cat o is given by,
From above equation, the velocity of the cat in current iteration
C ouþ1 ¼ C ou þ touþ1 ð25Þ can be written as,
2 3
2:7182tou1  2:718tou2 þ 1:359tou3 
where, C ou represents the position of the cat o at current iteration u,
and touþ1 is the velocity of the cat oin ðu þ 1Þth iteration.
tou ¼ 6 7
4 0:4518tou4 þ 0:111tou5  0:0208tou6 þ 5 ð34Þ
After determining the position of the prey, it decides to move 0:00276tu7  0:0001984tu8
o o

and thus, the velocity of the cat is changed and the updated veloc-
ity touþ1 is represented as,
touþ1 ¼ tou þ #1  k1 ðC   C ou Þ

where, # is a random number, k1 denote constant, C represents the
best solution, and tou represent the velocity of cat o in uth position, C ou
represents the cat’s position in current iteration.
The C-SSA algorithm assures better accuracy and the effective-
ness for multihop routing. The update in C-SSA is derived by com-
ð26Þ bining the update rule of CSO (Chu et al., 2006) and SSA (Mirjalili
et al., 2017). Additionally, the C-SSA provides a proper balance
between the exploitation and exploration phases, to generate the
global optimal solution According to C-SSA algorithm, the update
equation is given by,
The velocity of the cat is to be changed according to Taylor ser-  
1  #1  k1 tou þ #1  k1  C 
ies (Mangai et al., 2014) to improve the accuracy of estimation and C ouþ1 ¼  C o1  ð35Þ
in addition to attain the convergence. Moreover, the Taylor series is 1  2 #1  k 1 u
1  #1  k1
simple and easy to compute under complex functions. Thus, the The final Taylor C-SSA is obtained after substituting Eq. (34) in
resultant velocity equation obtained by applying Taylor series is Eq. (35), and is represented by,
given by,
1  # 1  k1
C ouþ1 ¼
1  2 #1  k1
to
uþ1 ¼ 0:5t þ 1:3591t
o
u
o
u1  1:359t o
u2 þ 0:6795t o
u3 2 2 3 3
2:7182tou1  2:718tou2 þ 1:359tou3 
 0:2259tou4 þ 0:555tou5  0:0104tou6 6 6 7 7
6 4 0:4518tu4 þ 0:111tu5  0:0208tu6 þ 5 þ #1  k1  C 7
o o o
6 7
þ 1:38e3 tou7  9:92e5 tou8 ð27Þ 6 o1 0:00276tou7  0:0001984tou8 7
6
6C u 
7
7
6 1  #1  k1 7
6 7
Thus, the velocity of the cat in current iteration is given by, 4 5
2 o 3
tuþ1  1:3591tou1 þ 1:359tou2  ð36Þ
1 6 7
tou ¼ 4 0:6795tou3 þ 0:2259tou4  0:555tou5 5 ð28Þ
0:5 3 o 5 o where, # is a random number, k1 denote constant, C represents the 
þ0:0104tu6  1:38e tu7 þ 9:92e tu8
o

best solution, and tou represent the velocity of cat o in uth position.
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
8 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx

4. Results and discussion 4.4. Simulation results

In this section, the analysis of proposed method based on alive
nodes, energy, delay, and throughput is carried out with respect to
other existing methods.
4.1. Experimental setup
The proposed method is implemented in MATLAB having Win-
dows 10 OS, 2.16 GHz processor and 2 GB RAM. The simulation
parameters are provided in Table 1.
This section illustrates the simulation results of proposed mul-
tihop routing approach using 50 and 100 nodes. The simulation of
proposed Taylor C-SSA is executed in WSN model with 50 and 100
nodes as depicted in Fig. 3. The WSN model with 50 nodes and 2
hops during the transmission is depicted in Fig. 3a. Similarly, the
WSN model with 50 nodes and 3 hops is depicted in Fig. 3b. Here,

4.2. Performance metrics

The performance metrics are employed for analyzing the per-

formance of the methods that are used for secured multihop rout-
ing. The metrics utilized for the analysis includes alive nodes,
energy, throughput, and delay.

4.2.1. Energy
The transmission of the data between the nodes in the WSN
consumes the energy. Thus, the node having highest energy is cho-
sen for the evaluation.
(a)
4.2.2. Delay
The delay is computed based on the number of nodes. If the
number of nodes increases, then the delay is high. The delay should
be less to achieve effective routing. The delay is computed from the
time taken by application request or information to give a
response.

4.2.3. Alive nodes

Alive nodes are the nodes used for initiating the communication
in a WSN.

4.2.4. Throughput (b)

The throughput is defined as the number of data packets
obtained in a specific time and then the packet delivery is
acknowledged.

Throughput ¼ Nr =T
where, N r is the total number of nodes obtained and T is the simu-
lation time.

4.3. Comparative methods

The performance of the proposed method can be evaluated by

comparing the performance achieved by the existing methods.
Thus, the comparative methods employed for the analysis include (c)
C-SSA, Grid clustering (Huang et al., 2017), Geo clustering (Akila &
Venkatesan, 2018), FABC-EACO clustering (Kumar et al., 2017), and
proposed Taylor C-SSA.

Table 1
Simulation Parameters.

Parameters Values
simulator matlab
area 100  100 m
no.of nodes 50 and 100
transmission range 40 m
simulation time 2000 rounds
receiver energy consumption 5  10^8 J (d)
transmitter energy consumption 5  10^8 J
initial energy 0.5 J
Fig. 3. Simulation results a) Using 50 nodes with 2 hops b) Using 50 nodes with 3
traffic type CBR
hop c) Using 100 nodes with 2 hops d) Using 100 nodes with 3 hops.
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx 9

the nodes indicated by green, red, blue and yellow circles are the
sensor nodes, which transmit the message, whereas the triangular
shaped node represents the cluster head, which is responsible for
transmitting the data packets from one node to another node. Like-
wise, the network with 100 nodes using 2 hops is depicted in
Fig. 3c and the network with 100 nodes using 3 hops is depicted
in Fig. 3d respectively.

4.5. Comparative analysis

The comparative analysis of the performance achieved by the

Taylor C-SSA-based routing with the existing approaches in terms
of delay, alive nodes, energy, and throughput using 50 nodes and
100 nodes with 2 and 3 hops is illustrated. The existing methods
used for the analysis are C-SSA, Grid clustering, Geo clustering,
FABC-EACO clustering.
(a)
4.5.1. Analysis based on 50 nodes and 2 hops
Fig. 4 shows the comparative analysis using 50 nodes with two
hops based on alive nodes, energy, delay, and throughput. The
analysis of the existing C-SSA, Grid clustering, Geo clustering,
FABC-EACO clustering, and proposed Taylor C-SSA method (Set
A) based on alive nodes is depicted in Fig. 4a. Initially, 50 alive
nodes are considered by the Set A, when the number of rounds is
1. On the other hand, when the number of rounds is 2000, then
the alive nodes measured by Set A are 24, 21, 13, 5, and 25 respec-
tively. Fig. 4b depicts the comparative analysis of the Set A based
on delay parameter. When the number of rounds is 1, the corre-
sponding delay values measured by Set A are 0.011, 0, 0, 0, and
0.0126 respectively. Similarly, when the number of rounds is
2000, the corresponding delay values measured by Set A are
0.316, 0.524, 0.501, 0.481, and 0.291 respectively. Fig. 4c shows
the comparative analysis based on energy for the Set A. When (b)
the number of rounds is 1, the corresponding energy values mea-
sured by Set A are 0.549, 0.548, 0.548, 0.549, and 0.549 respec-
tively. Likewise, when the number of rounds is 2000, the
corresponding energy values measured by Set A are 0.055, 0.044,
0.044, 0.009, and 0.131 respectively. Fig. 4d shows the comparative
analysis based on throughput for Set A. Initially, the throughput
value of the Set A is 1, when the number of rounds is 1. However,
when the number of rounds is 2000, the throughput value is 0.1 for
Set A.

4.5.2. Analysis based on 50 nodes and for 3 hops

The comparative analysis using 50 nodes for three hops based
on alive nodes, energy, delay, and throughput is depicted in
Fig. 5. The analysis in terms of alive nodes is depicted in Fig. 5a. Ini-
tially, 50 nodes are considered for the evaluation. When the num- (c)
ber of rounds is 2000, then the alive nodes computed by Set A is
reduced to 9, 7, 4, 1, and 10, respectively. Fig. 5b depicts the com-
parative analysis of the methods based on delay parameter. When
the number of rounds is 2000, the corresponding delay values
measured by Set A are 0.505, 0.607, 0.521, 0.520, and 0.475, respec-
tively. The comparative analysis based on energy for the method is
depicted in Fig. 5c. When the number of rounds is 2000, the corre-
sponding energy values measured by Set A are 0.152, 0.142, 0.108,
0.0526, and 0.188, respectively. Fig. 5d depicts the comparative
analysis based on throughput for Set A. When the number of
rounds is 2000, the throughput value is subsequently reduced to
0.1 for Set A.

4.5.3. Analysis based on 100 nodes and 2 hops:

Fig. 6 illustrates the comparative analysis using 100 nodes with
(d)
two hops based on alive nodes, energy, delay, and throughput. The
analysis in terms of alive nodes is depicted in Fig. 6a. At first, 100 Fig. 4. Comparative analysis using 50 nodes with two hops based on a) Alive nodes
nodes are considered for the evaluation when the number of b) Delay c) Energy d) Throughput.
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
10 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx

rounds is 1, whereas when the number of rounds is increased to

2000 then the number of alive nodes measured by Set A is reduced
to 39, 0, 12, 25, and 42 respectively. The comparative analysis of
the methods in terms of delay parameter is depicted in Fig. 6b.
For 2000 rounds, the corresponding delay values measured by
Set A are 0.508, 0.688, 0.858, 0.691, and 0.488 respectively.
Fig. 6c shows the comparative analysis in terms of energy param-
eter for the method is depicted. When the number of rounds is
2000, the corresponding energy values measured by Set A are
0.119, 0, 0.003, 0.0654, and 0.129 respectively. Fig. 6d depicts the
comparative analysis based on throughput for Set A. Initially, the
throughput value is 1 for Set A. Likewise, when the number of
rounds is 2000, the throughput value is subsequently reduced to
0.1 for Set A.

(a) 4.5.4. Analysis based on 100 nodes and for 3 hops

The comparative analysis using 100 nodes with three hops based
on alive nodes, energy, delay, and throughput is depicted in Fig. 7.
The analysis in terms of alive nodes is depicted in Fig. 7a. Initially,

(b) (a)

(b)

(c)

(c)

(d) (d)
Fig. 5. Comparative analysis using 50 nodes with three hops based on a) Alive Fig. 6. Comparative analysis using 100 nodes with two hops based on a) Alive
nodes b) Delay c) Energy d) Throughput. nodes b) Delay c) Energy d) Throughput.
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx 11

analysis based on energy for the method is depicted in Fig. 7c. When
the number of rounds is 2000, the corresponding energy values
measured by Set A are 0.081, 0, 0.005, 0.041, and 0.090 respectively.
Fig. 7d depicts the comparative analysis based on throughput for
Set A. When the number of rounds is 2000, the throughput value
is subsequently reduced to 0.1 for Set A.

5. Discussion

This section illustrates the comparative result of methodologies

(a)
in terms of energy, delay, throughput, and alive nodes. Table 2
depicts the comparative results obtained using a network consist-
ing 50 and 100 nodes with two and three hops based on the eval-
uation metrics at the maximum rounds.
The comparative analysis of the methodologies is conducted by
taking the best results from the network with 50 and 100 nodes.
The energy values computed by the proposed Taylor C-SSA is high-
est with value 0.129, whereas the existing methods, like C-SSA,
Grid clustering, Geo clustering, FABC-EACO clustering are 0.119,
0, 0.003, and 0.065 respectively. The delay values must be bare
(b) minimum value in order to get improved performance. Here, the
proposed Taylor C-SSA shows minimal value with 0.291, whereas
the existing C-SSA, Grid clustering, Geo clustering, FABC-EACO
clustering are 0.316, 0.524, 0.501, 0.481 respectively. The maxi-
mum throughput is achieved by Taylor C-SSA with value 0.1. The
maximum alive node is acquired by the proposed Taylor C-SSA
with 42 alive nodes. Therefore, it can be concluded from the above
comparison result, that the proposed Taylor C-SSA technique out-
performs the existing approaches with improved performance.
In the proposed work, the CHs are selected using the LEACH
(c) protocol, which minimizes the traffic in the network. Then, the
proposed hybrid optimization algorithm selects the optimal paths
based on the energy constraints, such as energy, delay, inter-
cluster distance, intra-cluster distance, Link-Lifetime, distance,
and trust model. The proposed Taylor C-SSA is easy to implement
and possess a single control parameter that updates adaptively.
The proposed algorithm is capable of obtaining the global optimal
solutions for the unimodal, multimodal, and composite data. The
Taylor series is used to predict the linear part and describes the
historical stored values. The advantage of Taylor series is simpler
and easiest method to compute the solutions, even under the pres-
(d) ence of the complex functions. The main advantages include that
Fig. 7. Comparative analysis using 100 nodes with three hops based on a) Alive
the Taylor series ensures the accurate estimation of the common
nodes b) Delay c) Energy d) Throughput. functions and attains convergence easily.

100 alive nodes are considered by the Set A for the evaluation when
the number of round is 1. But, when the number of rounds is 2000,
then the alive nodes computed by Set A are reduced to 30, 0, 1, 15,
and 31 respectively. Fig. 7b depicts the comparative analysis of the
methods based on delay parameter. When the number of rounds is
2000, the corresponding delay values measured by Set A are 0.485,
0.621, 0.889, 0.687, and 0.465 respectively. The comparative
6. Conclusion
This paper focuses on a security aware multi-hop routing proto-
col and considers security as an important paradigm for perform-
ing the multihop routing. The protocol is designed by considering
a trust model, which incorporates several trust factors such as
direct trust, indirect trust, data forwarding rate, and integrity fac-
tor. The process undergoes two stages for attaining effective mul-

Table 2
Performance Comparison.

Metrics Nodes C-SSA Grid clustering Geo clustering FABC-EACO clustering Proposed Taylor C-SSA
Energy 50 0.152 0.142 0.108 0.052 0.188
100 0.119 0 0.003 0.065 0.129
Delay 50 0.316 0.524 0.501 0.481 0.291
100 0.485 0.621 0.889 0.687 0.465
Throughput 50 0.1 0.1 0.1 0.1 0.1
100 0.1 0.1 0.1 0.1 0.1
Alive nodes 50 24 21 13 5 25
100 39 0 12 25 42

Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
12 A. Vinitha et al. / Journal of King Saud University – Computer and Information Sciences xxx (xxxx) xxx
tihop routing. First stage is CH selection, and second stage is data
transmission. In CH selection, the optimal node is selected as CH
using the LEACH protocol and then the data transmission is per-
formed from one node to another node based on different hops
which is selected optimally using the proposed Taylor C-SSA based
multiobjective fitness function. The proposed Taylor C-SSA algo-
rithm is obtained by integrating the Taylor series in Cat Salp
Swarm Algorithm (C-SSA). The proposed algorithm shows better
convergence and the hybrid optimization activates on the basis
of following constraints, namely energy, delay, inter-cluster dis-
tance, intra-cluster distance, Link-Lifetime, delay, and trust. The
proposed Taylor C-SSA algorithm shows best performance based
on energy, alive nodes, delay, and throughput with values 0.129,
42, 0.291, and 0.1 respectively. In future, we will develop a tech-
nique for multi-hop routing with the aim of obtaining the high
performance.
Declaration of Competing Interest
The authors declare that they have no known competing finan-
cial interests or personal relationships that could have appeared
to influence the work reported in this paper.
References
Abdulla, A.E., Nishiyama, H., Yang, J., Ansari, N., Kato, N., 2012. HYMN: a novel
hybrid multi-hop routing algorithm to improve the longevity of WSNs. IEEE
Trans. Wireless Commun. 11 (7), 2531–2541.
Akila, I.S., Venkatesan, R., 2018. An energy balanced geo-cluster head set based
multi-hop routing for wireless sensor networks. Cluster Comput.
Akkaya, K., Younis, M., 2003. A survey on routing protocols for wireless sensor
networks. Comput. Sci. Electric. Eng. Ad Hoc Netw. 3, 325–349.
Babu, S.S., Raha, A., Naskar, M.K., 2011. Trustworthy route formation algorithm for
WSNs. Int. J. Comput. Appl. 27 (5), 0975–8887.
Cengiz, K., Dag, T., 2018. Energy aware multi-hop routing protocol for WSNs. IEEE
Access 6, 2622–2633.
Chen, Z., Shen, H., 2018. A grid-based reliable multi-hop routing protocol for
energy-efficient wireless sensor networks, 14(3).
Chu, S.C., Tsai, P.W., Pan, J.S., 2006. Cat swarm optimization. In: Proceedings of
Pacific Rim International Conference on Artificial Intelligence. Springer, pp.
854–858.
Das, A., Islam, M.M., 2012. SecuredTrust: a dynamic trust computation model for
secured communication in multiagent systems. IEEE Trans. Dependable Secure
Comput. 9 (2), 261–274.
Dennis, B., Muthukrishnan, S., 2014. AGFS: Adaptive Genetic Fuzzy System for
medical data classification. Appl. Soft Comput. J 25, 242–252.
Draves, R., Padhye, J., Zill, B., 2004. Comparison of routing metrics for multi-hop
wireless. Proceedings of ACM SIGCOMM.
Fawzy, A.E., Shokair, M., Saad, W., 2018. Balanced and energy-efficient multi-hop
techniques for routing in wireless sensor networks, 7, 33–43
Heinzelman, W.B., 1995. 2000. Application-Specific Protocol Architectures for
Wireless Networks. Citeseer.
Huang, J., Hong, Y., Zhao, Z., Yuan, Y., 2017. An energy-efficient multi-hop routing
protocol based on grid clustering for wireless sensor networks. Cluster Comput.
Huang, W.W., Peng, Y.L., Wen, J., Yu, M., 2009. Energy-efficient multi-hop
hierarchical routing protocol for wireless sensor networks. In: Proceedings of
International Conference on Networks Security, Wireless Communications and
Trusted Computing, pp. 469–472.
Hussain, S., Islam, O., 2007. An energy efficient spanning tree based multi-hop
routing in wireless sensor networks. Wireless Commun. Networking, 4383–
4388.
Huynh, T., Tran, C., 2016. Delay-constrained energy-efficient cluster-based multi-
hop routing in wireless sensor. Networks 18 (4), 580–588.
Please cite this article as: A. Vinitha, M. S. S. Rukmini and Dhirajsunehra, Secure and energy aware multi-hop routing protocol in WSN using Taylor-based
hybrid optimization algorithm, Journal of King Saud University –
Computer and Information Sciences, https://doi.org/10.1016/j.jksuci.2019.11.009
Jain, N., Trivedi, P., 2012. An adaptive sectoring and cluster head selection based
multi-hop routing algorithm for WSN. In: Proceedings of International
Conference on Engineering, pp. 1–6.
Jakobsen, M.K., Madsen, J., Hansen, M.R., 2010. DEHAR: A distributed energy
harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor
networks. Mobile and Multimedia Network, pp. 1–9.
Johnson, D.B., Maltz, D.A., Broch, J., 2001. DSR: the dynamic source routing protocol
for multihop wireless ad hoc networks. Ad Hoc Networking.
kulkarni, Y.R., Murugan, T.S., 2019. Hybrid weed-particle swarm optimization
algorithm and CMixture for data publishing. Multimedia Res. 2 (3), 33–42.
Kumar, R., Kumar, D., Kumar, D., 2017. Exponential ant colony optimization and
fractional artificial bee colony to multi-path data transmission in wireless
sensor networks. IET Commun 11 (4), 522–530.
Laouid, A., Dahmani, A., Bounceur, A., Euler, R., Lalem, F., Tari, A., 2017. A distributed
multi-path routing algorithm to balance energy consumption in wireless sensor
networks. Ad Hoc Networks.
Maheswari, U., 2018. A survey on recent techniques for energy efficient routing in
WSN. Int. J. Sens. Sens. Networks 6 (1), 8.
Mangai, S.A., Sankar, B.R., Alagarsamy, K., 2014. Taylor series prediction of time
series data with error propagated by artificial neural network. Int. J. Comput.
Appl. 89 (1).
Masdari, M., Bazarchi, S.M., Bidaki, M., 2013. Analysis of secure LEACH-based
clustering protocols in wireless sensor networks. J. Netw. Comput. Appl 36 (4),
1243–1260.
Mirjalili, S., Gandomi, A.H., Mirjalili, S.Z., Saremi, S., Faris, H., Mirjalili, S.M., 2017.
Salp Swarm Algorithm: a bio-inspired optimizer for engineering design
problems. Adv. Eng. Softw 114, 163–191.
Mohan, R., Ananthula, V.R., 2019. Reputation-based secure routing protocol in
mobile ad-hoc network using Jaya Cuckoo optimization. Int. J. Modeling, Simul.,
Sci. Comput. 10 (3).
Mohan, R., Reddy, A.V., 2018. T-Whale: trust and whale optimization model for
secure routing in mobile Ad-Hoc network. Int. J. Artificial Life Res. (IJALR) 8 (2),
67–79.
Pantazis, N.A., Nikolidakis, S.A., Vergados, D.D., 2013. Energy-efficient routing
protocols in wireless sensor networks: a survey. IEEE Commun. Surv. Tutorials
15 (2), 551–591.
Perkins, C.E., Bhagwat, P., 1994. Highly dynamic destination sequenced distance-
vector routing (dsdv) for mobile computers. Proceedings of ACM SIGCOMM.
Perkins, C.E., Royer, E.M., 1999. Ad hoc on-demand distance vector routing.
Proceedings of the Workshop on Mobile Computing Systems and Applications.
Purkait, R., Tripathi, S., 2017. Energy aware fuzzy based multi-hop routing protocol
using unequal clustering. Wireless Pers. Commun. 94 (3), 809–833.
Riad, A.M., El-Minir, H.K., El-hoseny, M., 2013. Secure routing in wireless sensor
networks: a state of the art. Int. J. Comput. Appl. 67 (7).
Rozner, E., Seshadri, J., Mehta, Y.A., Qiu, L., 2009. SOAR: Simple opportunistic
adaptive routing protocol for wireless mesh networks. IEEE Trans. Mob.
Comput. 8 (12), 1622.
Sajwan, M., Gosain, D., Sharma, A.K., 2018. Hybrid energy-efficient multi-path
routing for wireless sensor networks. Comput. Electr. Eng. 67, 96–113.
Selvi, M., Velvizhy, P., Ganapathy, S., Nehemiah, H.K., Kannan, A., 2017. A rule based
delay constrained energy efficient routing technique for wireless sensor
networks. Cluster Comput., 1–10
Sert, S.A., Alchihabi, A., Yazici, A., 2018. A two-tier distributed fuzzy logic based
protocol for efficient data aggregation in Multihop wireless sensor networks.
IEEE Trans. Fuzzy Syst. 26 (6), 3615–3629.
Wang, J., Kim, J.-U., Shu, L., Niu, Y., Lee, S., 2010. A distance-based energy aware
routing algorithm for wireless sensor networks. Sensors 10 (10), 9493–9511.
Zahariadis, T., Leligou, H., Karkazis, P., Trakadas, P., Papaefstathiou, I., Vangelatos, C.,
Besson, L., 2011. Design and implementation of a trust-aware routing protocol
for Largewsns. Int. J. Network Security Appl. 2 (3).
Zahedi, A., Parma, F., 2018. An energy-aware trust-based routing algorithm using
gravitational search approach in wireless sensor networks. Peer-to-Peer
Networking Appl., 1–10
Zhan, G., Shi, W., Deng, J., 2012. Design and implementation of TARF: a trust-aware
routing framework for WSNs. IEEE Trans. Dependable Secure Comput. 9 (2),
184–197.
Zhu, J., 2018. Wireless sensor network technology based on security trust
evaluation model. Int. J. Online Eng. (iJOE) 14 (4), 211–226.