# Swarm Intelligence with Adaptive Neuro-Fuzzy Inference System-Based Routing Protocol for Clustered Wireless Sensor Networks

Authors: Feras Mohammed A-Matarneh; Bassam A. Y. Alqaralleh; Fahad Aldhaban; Esam A. AlQaralleh; Anil Kumar; Deepak Gupta; Gyanendra Prasad Joshi
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Wireless sensor network (WSN) comprises numerous compact-sized sensor nodes which are linked to one another. Lifetime maximization of WSN is considered a challenging problem in the design of WSN since its energy-limited capacity of the inbuilt batteries exists in the sensor nodes. Earlier works have focused on the design of clustering and routing techniques to accomplish energy efficiency and thereby result in an increased lifetime of the network. The multihop route selection process can be treated as an NP-hard problem and can be solved by the use of computational intelligence techniques such as fuzzy logic and swarm intelligence (SI) algorithms. With this motivation, this article aims to focus on the design of swarm intelligence with an adaptive neuro-fuzzy inference system-based routing (SI-ANFISR) protocol for clustered WSN. The proposed SI-ANFISR technique aims to determine the cluster heads (CHs) and optimal routes for multihop communication in the network. To accomplish this, the SI-ANFISR technique primarily employs a weighted clustering algorithm to elect CHs and construct clusters. Besides, the SI-ANFISR technique involves the design of an ANFIS model for the selection process, which make use of three input parameters, namely, residual energy, node degree, and node history. In order to optimally adjust the membership function (MF) of the ANFIS model, the squirrel search algorithm (SSA) is utilized. None of the earlier works have used ANFIS with SSA for the routing process. The design of SSA to tune the MFs of the ANFIS model for optimal routing process in WSN shows the novelty of the study. The experimental validation of the SI-ANFISR technique takes place, and the results are inspected under different aspects. The simulation results highlighted the significant performance of the SI-ANFISR technique compared to the recent techniques with a maximum throughput of 43838 kbps and residual energy of 0.4800J, respectively.


---

## Body

## 1. Introduction

Typically, wireless sensor networks (WSNs) consist of many different entities and are taken into account as the mainstream of sensing in harsh and remote environment locations wherein human interference is impossible. WSN is the self-organizing network domain and thus it comprises several nodes cost-effectively that have the capacity for data processing and wireless communication [1]. WSN is the adaptable lower-cost emerging solution specifically utilized for monitoring the environments [2]. It consists of many smaller devices called sensors with less storage capacity, less computation complexity, and constrained battery power are dispersed in the geographical region for sensing the network state to collect and communicate information [3]. The sensors are distributed in various environments to implement the application, including home automation, industrial, smart grids, habitat monitoring, and military surveillance. Different limitations are enforced on the sensors regarding memory, storage capability, processing power, and energy resources [4]. Figure 1 illustrates the framework of WSN.Figure 1
WSN structure.The key challenge in WSNs is to expand the lifespan of the network when primary nodes are not able to transfer the information to the sink nodes [5]. In the application of collecting information, all the nodes take responsibility for sensing the data packet to sink nodes. The procedure of gathering information reduces data traffic and stores energy by incorporating several received data packets into individual packets [6]. Therefore, various applications are developed to extend the lifetime of the network. The efficacy of energy is the most important issue in WSNs since sensors are activated by the battery. Consequently, the use of energy can be handled to prolong the lifetime of the system [7]. Clustering is an approach that could alleviate the energy utilization of the sensors by constructing them in an improved method. Considering the constrained battery of sensors, preserving energy is highly significant, or else, the sensors could decrease quickly and that reduces the lifetime and stability period of WSNs [8]. If at all possible, clustering could offer benefits like fault tolerance, scalability, reduced routing delay, data fusion, increased connectivity, stabilized topology, and load balancing.Several clustering models are introduced and designed in the WSN that depend on the employed model categorized as deterministic and probabilistic systems [9]. The routing methods are significant in WSNs as they offer lesser latency, Quality of Service (QoS), data throughput, and energy consumption. Since WSN is application-specific, several methods are presented to address the problem created when routing data packets. Several computational intelligence (CI) methods including GA, Particle Swarm Optimization (PSO), and neural network (NN), are extensively employed in WSN for several challenges. In general, fuzzy logic (FL) is employed for solving uncertainty in the network. By utilizing FL, a method is enhanced without needing whole data. There are three essential portions comprised of fuzzy decision block (FDB), defuzzifier, and fuzzifier block. FDB is composed of fuzzy inference and rule base system. Fuzzifier blocks convert the crisp input into the suitable fuzzy linguistic parameter. According to the rule base, FDB blocks map the input linguistic variable to the output linguistic variables [10]. At last, defuzzifier blocks convert the fuzzy output into the crisp output through an appropriate defuzzification model.This study introduces swarm intelligence with an adaptive neuro-fuzzy inference system-based routing (SI-ANFISR) protocol for clustered WSN. The proposed SI-ANFISR technique initially organizes the clusters using the weighted clustering algorithm. Moreover, the SI-ANFISR technique involves the design of the ANFIS model with three input parameters, namely, residual energy (RE), node degree (ND), and node history (NS) to compute the optimal routes to the destination. In order to optimally adjust the membership function (MF) of the ANFIS model, the squirrel search algorithm (SSA) is utilized. The performance analysis of the SI-ANFISR technique takes place and the results are inspected under different aspects.


## 2. Literature Review

Patil and Parveen [11] presented an Adoptive Compressed Sensing (ACS) to resolve problems of hybrid CS. The presented model chooses an ideal size of the cluster and considers the relationship among the several nodes and measurement M. Furthermore, the data collection method uses the traditional Fourier transform to attain better stability with lower computation difficulty. Lastly, an adoptive data recovery approach to clustered WSN is utilized for enhancing the orthogonal matching pursuits.Kavitha [12] developed a cryptographic-based cluster model to preserve information security through the Optimum Privacy-Multihop Dynamic Clustering Routing Protocol (OP-MDCRP) which enhances energy effectual routing and data privacy for the heterogeneous system that exploits multihop transmission and clustering to decrease the power utilization of sensors and expands the WSN lifetime. According to the region, the source node is combined to create a cluster in the arbitrary system. Also, the method offers higher data security through small key size and Elliptic Curve Integrated Encryption-Key Provisioning Method (ECIES-KPM). Norouzi Shad et al. [13] proposed an Intelligent Decision Support System (IDSS)-based cluster routing method called GA-PSO-SVM, for the IoT perception layer using an SVM-related approach for estimating the location of the node and a hybrid GA-PSO-based method for cluster optimization.Koyuncu et al. [14] introduced an arithmetical method of Deterministic Energy-Efficient Clustering (DEC)-related multiple tier random possibility protocols for agricultural WSN to improve the lifespan of WSN nodes and comparison of the current DEC method. In the presented method, the election of CH is performed on the basis of the location of the sensors and the energy drain pattern that increases the sensors' lifetime. Rodríguez et al. [15] proposed an energy-effective clustering routing method for WSN-related Yellow Saddle Goatfish Algorithm (YSGA). The method is proposed for intensifying the system lifespan by minimizing power utilization. The networks consider BSs and a collection of CH models. The overall amount of CHs and the optimal selection of CH can be described by the YSGA method, whereas sensors are allocated to its adjacent CH.Ghaddar et al. [16] presented R-MUCH as a clustering routing method. It is a multiple hop form of the MUCH (Multiple Criteria Cluster Head Delegation-Related Fuzzy Logic) model. CH transmits the information in a multihop manner to the sink by selecting the path which contains the minimum cost in terms of power utilization. R-MUCH is selected for all the CHs. Huamei et al. [17] designed an energy-effective nonuniform cluster routing method for enhancing node energy efficacy and balancing the power utilization in WSN. In addition, a nonuniform cluster network is introduced for reducing the possibility of energy hole existences and improving the CHs selection technique to propose a better-shuffled frog leaping model.Rodríguez et al. [18] introduced a strong clustering routing method for WSN. The system employs the Locust Search (LS-II) technique for identifying the optimum CHs and determining the amount of CHs. When the CHs are identified, the other sensors are allocated to the adjacent CHs. Brahim et al. [19] suggested that an energy-effective clustering method is very effective when compared to routing methods and provides good coverage of the networks when compared to LEACH. The approach integrates the MCL method for clustering creation, and a novel CHs selection method depends on residual energy and location of sensor nodes.


## 3. System Model

It assumes that theN sensor is located randomly from network fields for monitoring the location and their physical feature periodically. All sensors have a neighboring sensor, and it broadcasts information to most neighboring sensors. It can be considered an immobile sensor with equivalent primary energy. The computation ability of all sensors was similar. The symmetric radio connections were regarded amongst some 2 neighboring sensors. The sink was placed inside the network regions. Consider the maximal broadcast of all the sensors is R. The adaptive broadcast was regraded by utilizing distance amongst some 2 neighboring sensors. The 1st-order radio method for analyzing the energy utilization of presented routing was explained. Assume 7mm is the size of the packet from bits. The energy required to broadcast m bits of a packet across d unit distance amongst a sender sensor and neighboring sensors is written as follows:(1)ETXm,d=m∗Eelect+m∗εfsp∗d2ifd<do,m∗Eelect+m∗εmpf∗d4ifd≥do.For receivingm bits of packet, the energy requirement was provided as follows:(2)ERXm=m∗ESelect,where ESelect refers to the statistics on the energy dissipate to transmit electron per bit. Many factors like acceptable bit‐rate, digital coding, and modulation affect the ESelect. The εfsp and εmpf stand for the requirement of energy from the free‐space path and multipath environment, correspondingly. If 2 neighboring sensors whose energy usage has been computed are separated with a distance lesser than or equivalent to lo=Efsp/Emp, the radio method executes (1), else (2), for calculating the energy required to transmit the data.


## 4. The Proposed Model

In this study, a new SI-ANFISR technique has been developed for computing the optimal set of multihop routes for intercluster communication in WSN. The proposed SI-ANFISR technique involves three major processes, namely, cluster construction, ANFIS-based route selection, and SSA-based MF selection. The ANFIS model has utilized multiple input parameters for route selection, and the SSA helps to optimally choose the MFs, which results in improved network lifetime. Figure2 illustrates the overall working process of the proposed SI-ANFISR technique.Figure 2
Working process of the SI-ANFISR technique.


### 4.1. Weighted Clustering Technique

In this study, the SI-ANFISR technique employs a weighted clustering technique involving three input parameters, namely, RE, ND, and NS. In the case of RE, the sensor nodes with maximum energy will be elected as CH. The MF of the RE includes high and low linguistic parameters. The RE defines the ratio of residual energy of nodei that is related to Eri and the overall energy of the network Et. It is essential to estimate the RE of all the nodes for every iteration. Consequently, a balanced energy depletion can be accomplished in the network.(3)Residual energy=∑i=1nEriEt.Next, the NSs are related to the iterations. The CHs are chosen with maximum iterations; in new iterations, the CHs are chosen with the low ability of the node.(4)Node histories=1−λHt−1n−λ2Ht−2n,…,λrHt−rn,where t indicates the present round and the earlier round is represented as t−1, and in r preceding rounds, t−r identifies the round number. λ can be defined using the coefficient values of the history nodes, and the element Ht−r is either 0 or 1. Finally, the ND of a chosen CH is as follows:(5)ND=TN,where the number of neighboring nodes is elected as CH, which can be defined by T. For every node, a weight value Pi is(6)Pi=w1∗REi+w2∗NDi+w3∗NSi,where w1, w2, and w3 denote the coefficient values. Hence,(7)w1+w2+w3=1.


### 4.2. Design of the ANFIS Model for the Routing Process

Once the clusters are constructed, the next stage is to derive optimal routes for intercluster communication using the ANFIS model. It receives the input parameters as RE, ND, and NS to compute optimal paths. The ANFIS is established by Jangthat mentions the combination of FL and ANN for creating the important processing equipment [20]. Indeed, 2 rules are generated to all inputs with a maximal value equivalent to 1 and minimal value equivalent to 0. It is a multilayer feed‐forward network (MLFN) in that all nodes obtain the particular function on the input signal.The square and circle node symbols are employed for characterizing distinct learning parameters. The parameter is altered for achieving the chosen input and output attributes based on the learning rule. The parameters energy, resource utilization, computation cost, makespan, and memory are utilized as input for the ANFIS technique. The resultant parameter is tuned by utilizing the BWO technique for obtaining better outcomes. The BWO technique employed during this artifact for supporting ANFIS adjusts the parameter of membership functions (MF). The fuzzy inference system has been considered that has 5 layers of adaptive network with 2 inputsa and b and only one output c. The node in jth place of lth layer has been demonstrated as Ol,j, and the function of the node from the same layer of an identical function family is demonstrated as follows.Layer 1: Layer 1 signifies the input layer, and all nodesj from Layer 1 imply the square node by node functions. Ol,j stands for the MF of Xj and defines the obtainable degree that persuades the quantifier Xj. Usually, the bell‐shaped MF was selected as input of MF by maximal equivalent to 1 and the minimal equivalent to 0.(8)O1,j=μXjaforj=1,2,μXja=11+a−zj/xj2yj,where xj,yj, and zj signifies the parameters, y stands for the positive value, and z implies the curve center.Layer 2: all the nodes under this layer signify the square node, obvious asΠ that generates the incoming signal and forwards the outcome product [21].(9)O2,j=wj=μXja×μYjbforj=1,2.Layer 3: all the nodes under this layer represent square nodes, noticeable as M. Thejth node estimates the ratio of jth rule firing strength to further of every rule to fire strength based on the formula. The outcome of this layer can be named as normalization firing strength.(10)O3,j=w¯=wjw1+w2forj=1,2.Layer 4: all the nodesj under this layer signify the square node by node function. The attribute under this layer is demonstrated as the following attribute:(11)O4,j=w¯jfj=w¯jpj+qj+rj,where pj, qj, and rj stand for the attribute.Layer 5: the single node from Layer 5 signifies the circle node, obvious asΣ that estimates the entire outcome in addition to every the incoming signal according to the following formula:(12)O5,j=∑jw¯jfj=∑j=1wjf∑j=1wj=output.


### 4.3. SSA-Based Parameter Optimization

In order to optimally tune the MF of the ANFIS model, the SSA is used which thereby improves the overall performance of the ANFIS model. Initially, the SSA tries to randomly generate a population initialization that represents the location of the squirrel [22]. In the SSA, the position of all the squirrels is described by a d dimension vector. This process considers the position of n squirrels in a 2D matrix as follows:(13)FS=S11S12⋯⋯S1dS21S22⋯⋯S2d⋯⋯⋯⋯⋯⋯⋯⋯⋯⋯Sn1Sn2⋯⋯Snd.Here,Si is the ith flying squirrel, and Sij is its jth dimension.(14)Sij=Sl+Rand0,1∗Su−Sl.Here,Su and Sl are upper and lower limits of Si in jth parameter and Rand (0, 1) denotes a function to generate arbitrary values within 0,1. As well, the fitness of position for every Si is computed by the following matrix:(15)Fit=FS11S12S1dFS21S22S2d⋯⋯⋯FSn1,⋯Sn2⋯Snd,FS11,S12,…,S1dFS21,S22,…,S2d⋯⋯FSn1,Sn2,…,Snd.Here,F shows the fitness function. After calculating the fitness value of every Si, they are arranged in ascending order. The SSA categorizes the squirrel into three major classes. As well, to fulfill the energy requirement, some squirrels randomly move toward the hickory nut tree and others move towards the acorn nut tree, based on the existence of distinct predators. The flying squirrel is on acorn nut tree and moves toward the hickory tree which can be computed by the following equation:(16)Satt+1=Satt+dg∗Gc∗Shtt−SattR1≥Pdprandomotherwise.Here,t represents the existing iteration, dg denotes random gliding distance, Pdp indicates predator existence probability, R1 indicates an arbitrary value within [0, 1], and Sht shows the position of flying squirrels that reached the hickory tree. The balance between exploitation and exploration can be attained by the gliding constant Gc in the arithmetical model is formulated in the following equation [23]:(17)Satt+1=Sntt+dg∗Gc∗Satt−SnttR2≥Pdprandomotherwise.Now,R2 represents an arbitrary value in [0, 1]. As well, few squirrels on the normal tree might move to hickory nut trees for storing hickory nuts. This can be expressed by the following equation:(18)Satt+1=Satt+dg∗Gc∗Shtt−SattR3≥Pdrandomotherwise.LetR3 be an arbitrary value within [0, 1] as well as the predator probability Pdp is assumed as 0.1. Algorithm 1 shows the pseudocode of SSA.Algorithm 1: Pseudocode of SSA.
(1)
Start:(2)
Read input parameter of SSA(3)
Create random position forn number of squirrels(4)
Estimate fitness of all the squirrel positions(5)
Arrange the position of squirrel individual in ascending order on the basis of cost function value(6)
Allocate the squirrel individual on normal tree, hickory nut tree, and acorn nut tree(7)
Arbitrarily chooses squirrel individual from normal tree for shifting towards hickorynut trees and transmits the remaining squirrels to acorn nut trees(8)
While (End condition is false)(9)
Fort=1 to n1 (n1= Number of squirrel individuals i.e., gliding from acorn tree to hickory nut trees)(10)
ifrl≥Pdp(11)
Upgrade the location of squirrel individuals(12)
else(13)
Arbitrarily create the location of squirrel individuals within the searching area.(14)
end(15)
end(16)
Fort=1 to n2 (n2= Number of squirrel individuals i.e., gliding from normal tree to acorn tree)(17)
ifr2≥Pdp(18)
Upgrade the location of squirrel individuals(19)
else(20)
Arbitrarily create the location of squirrel individuals within the searching area.(21)
end(22)
end(23)
Fort=1 to n3 (n3= Number of squirrel individuals i.e., gliding from normal tree to hickory trees)(24)
ifr3≥Pdp(25)
Upgrade the location of squirrel individuals(26)
else(27)
Arbitrarily create the location of squirrel individuals within the searching area.(28)
end(29)
end(30)
Estimate seasonal constantSc(31)
ifSct≤Smin(32)
Randomly reposition the squirrel individual(33)
end(34)
AdjustSmin(35)
end(36)
Output the optimum solution as the squirrel location on hickory nut trees(37)
End


## 4.1. Weighted Clustering Technique

In this study, the SI-ANFISR technique employs a weighted clustering technique involving three input parameters, namely, RE, ND, and NS. In the case of RE, the sensor nodes with maximum energy will be elected as CH. The MF of the RE includes high and low linguistic parameters. The RE defines the ratio of residual energy of nodei that is related to Eri and the overall energy of the network Et. It is essential to estimate the RE of all the nodes for every iteration. Consequently, a balanced energy depletion can be accomplished in the network.(3)Residual energy=∑i=1nEriEt.Next, the NSs are related to the iterations. The CHs are chosen with maximum iterations; in new iterations, the CHs are chosen with the low ability of the node.(4)Node histories=1−λHt−1n−λ2Ht−2n,…,λrHt−rn,where t indicates the present round and the earlier round is represented as t−1, and in r preceding rounds, t−r identifies the round number. λ can be defined using the coefficient values of the history nodes, and the element Ht−r is either 0 or 1. Finally, the ND of a chosen CH is as follows:(5)ND=TN,where the number of neighboring nodes is elected as CH, which can be defined by T. For every node, a weight value Pi is(6)Pi=w1∗REi+w2∗NDi+w3∗NSi,where w1, w2, and w3 denote the coefficient values. Hence,(7)w1+w2+w3=1.


## 4.2. Design of the ANFIS Model for the Routing Process

Once the clusters are constructed, the next stage is to derive optimal routes for intercluster communication using the ANFIS model. It receives the input parameters as RE, ND, and NS to compute optimal paths. The ANFIS is established by Jangthat mentions the combination of FL and ANN for creating the important processing equipment [20]. Indeed, 2 rules are generated to all inputs with a maximal value equivalent to 1 and minimal value equivalent to 0. It is a multilayer feed‐forward network (MLFN) in that all nodes obtain the particular function on the input signal.The square and circle node symbols are employed for characterizing distinct learning parameters. The parameter is altered for achieving the chosen input and output attributes based on the learning rule. The parameters energy, resource utilization, computation cost, makespan, and memory are utilized as input for the ANFIS technique. The resultant parameter is tuned by utilizing the BWO technique for obtaining better outcomes. The BWO technique employed during this artifact for supporting ANFIS adjusts the parameter of membership functions (MF). The fuzzy inference system has been considered that has 5 layers of adaptive network with 2 inputsa and b and only one output c. The node in jth place of lth layer has been demonstrated as Ol,j, and the function of the node from the same layer of an identical function family is demonstrated as follows.Layer 1: Layer 1 signifies the input layer, and all nodesj from Layer 1 imply the square node by node functions. Ol,j stands for the MF of Xj and defines the obtainable degree that persuades the quantifier Xj. Usually, the bell‐shaped MF was selected as input of MF by maximal equivalent to 1 and the minimal equivalent to 0.(8)O1,j=μXjaforj=1,2,μXja=11+a−zj/xj2yj,where xj,yj, and zj signifies the parameters, y stands for the positive value, and z implies the curve center.Layer 2: all the nodes under this layer signify the square node, obvious asΠ that generates the incoming signal and forwards the outcome product [21].(9)O2,j=wj=μXja×μYjbforj=1,2.Layer 3: all the nodes under this layer represent square nodes, noticeable as M. Thejth node estimates the ratio of jth rule firing strength to further of every rule to fire strength based on the formula. The outcome of this layer can be named as normalization firing strength.(10)O3,j=w¯=wjw1+w2forj=1,2.Layer 4: all the nodesj under this layer signify the square node by node function. The attribute under this layer is demonstrated as the following attribute:(11)O4,j=w¯jfj=w¯jpj+qj+rj,where pj, qj, and rj stand for the attribute.Layer 5: the single node from Layer 5 signifies the circle node, obvious asΣ that estimates the entire outcome in addition to every the incoming signal according to the following formula:(12)O5,j=∑jw¯jfj=∑j=1wjf∑j=1wj=output.


## 4.3. SSA-Based Parameter Optimization

In order to optimally tune the MF of the ANFIS model, the SSA is used which thereby improves the overall performance of the ANFIS model. Initially, the SSA tries to randomly generate a population initialization that represents the location of the squirrel [22]. In the SSA, the position of all the squirrels is described by a d dimension vector. This process considers the position of n squirrels in a 2D matrix as follows:(13)FS=S11S12⋯⋯S1dS21S22⋯⋯S2d⋯⋯⋯⋯⋯⋯⋯⋯⋯⋯Sn1Sn2⋯⋯Snd.Here,Si is the ith flying squirrel, and Sij is its jth dimension.(14)Sij=Sl+Rand0,1∗Su−Sl.Here,Su and Sl are upper and lower limits of Si in jth parameter and Rand (0, 1) denotes a function to generate arbitrary values within 0,1. As well, the fitness of position for every Si is computed by the following matrix:(15)Fit=FS11S12S1dFS21S22S2d⋯⋯⋯FSn1,⋯Sn2⋯Snd,FS11,S12,…,S1dFS21,S22,…,S2d⋯⋯FSn1,Sn2,…,Snd.Here,F shows the fitness function. After calculating the fitness value of every Si, they are arranged in ascending order. The SSA categorizes the squirrel into three major classes. As well, to fulfill the energy requirement, some squirrels randomly move toward the hickory nut tree and others move towards the acorn nut tree, based on the existence of distinct predators. The flying squirrel is on acorn nut tree and moves toward the hickory tree which can be computed by the following equation:(16)Satt+1=Satt+dg∗Gc∗Shtt−SattR1≥Pdprandomotherwise.Here,t represents the existing iteration, dg denotes random gliding distance, Pdp indicates predator existence probability, R1 indicates an arbitrary value within [0, 1], and Sht shows the position of flying squirrels that reached the hickory tree. The balance between exploitation and exploration can be attained by the gliding constant Gc in the arithmetical model is formulated in the following equation [23]:(17)Satt+1=Sntt+dg∗Gc∗Satt−SnttR2≥Pdprandomotherwise.Now,R2 represents an arbitrary value in [0, 1]. As well, few squirrels on the normal tree might move to hickory nut trees for storing hickory nuts. This can be expressed by the following equation:(18)Satt+1=Satt+dg∗Gc∗Shtt−SattR3≥Pdrandomotherwise.LetR3 be an arbitrary value within [0, 1] as well as the predator probability Pdp is assumed as 0.1. Algorithm 1 shows the pseudocode of SSA.Algorithm 1: Pseudocode of SSA.
(1)
Start:(2)
Read input parameter of SSA(3)
Create random position forn number of squirrels(4)
Estimate fitness of all the squirrel positions(5)
Arrange the position of squirrel individual in ascending order on the basis of cost function value(6)
Allocate the squirrel individual on normal tree, hickory nut tree, and acorn nut tree(7)
Arbitrarily chooses squirrel individual from normal tree for shifting towards hickorynut trees and transmits the remaining squirrels to acorn nut trees(8)
While (End condition is false)(9)
Fort=1 to n1 (n1= Number of squirrel individuals i.e., gliding from acorn tree to hickory nut trees)(10)
ifrl≥Pdp(11)
Upgrade the location of squirrel individuals(12)
else(13)
Arbitrarily create the location of squirrel individuals within the searching area.(14)
end(15)
end(16)
Fort=1 to n2 (n2= Number of squirrel individuals i.e., gliding from normal tree to acorn tree)(17)
ifr2≥Pdp(18)
Upgrade the location of squirrel individuals(19)
else(20)
Arbitrarily create the location of squirrel individuals within the searching area.(21)
end(22)
end(23)
Fort=1 to n3 (n3= Number of squirrel individuals i.e., gliding from normal tree to hickory trees)(24)
ifr3≥Pdp(25)
Upgrade the location of squirrel individuals(26)
else(27)
Arbitrarily create the location of squirrel individuals within the searching area.(28)
end(29)
end(30)
Estimate seasonal constantSc(31)
ifSct≤Smin(32)
Randomly reposition the squirrel individual(33)
end(34)
AdjustSmin(35)
end(36)
Output the optimum solution as the squirrel location on hickory nut trees(37)
End


## 5. Experimental Validation

The performance validation of the SI-ANFISR technique is simulated using the MATLAB tool. The results are examined under two scenarios: 200 nodes and 500 nodes. The node deployment of two scenarios is shown in Figure3 with BS at the center. A comparative analysis is made with existing methods such as exponentially-ant lion whale optimization algorithm (E-ALWO) [24], Energy-Efficient Scalable Routing Algorithm (EESRA) [25], multidimensional scaling map (MDS-MAP) [26], grey wolf optimization, and Routing Protocol for low power and Lossy networks (RPL) [27].Figure 3
Node deployment: (a) 200 nodes; (b) 500 nodes.
(a)(b)Table1 and Figure 4 offer a comparative study of the SI-ANFISR technique with other techniques under 200 nodes. On examining the results in terms of delay, it is apparent that the SI-ANFISR technique has gained minimal delay under all rounds. For instance, with 200 rounds, the SI-ANFISR technique has offered the least delay of 0.1633 s whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have obtained an increased delay of 0.1727 s, 0.2073 s, 0.2240 s, 0.2276 s, and 0.2356 s, respectively. Similarly, with 1000 rounds, the SI-ANFISR technique has provided decreased delay of 0.1862 s, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained an increased delay of 0.2135 s, 0.2549 s, 0.2662 s, 0.2702 s, and 0.2774 s, respectively.Table 1
Result analysis of the SI-ANFISR technique with existing methods under 200 nodes.
No. of roundsSI-ANFISRE-ALWORPLMDS-MAPEESRAGWODelay (sec)2000.16330.17270.20730.22400.22760.23564000.16840.17850.21420.22910.23420.24006000.17160.18400.21930.23420.23820.24408000.18150.18870.22650.24040.24580.255310000.18620.21350.25490.26620.27020.2774Residual energy (J)2000.44210.41380.24620.36990.36990.36744000.38280.33130.15470.26680.24100.23726000.30420.25780.10060.21010.11860.11738000.22300.17920.04770.13540.00260.024510000.19850.11220.00030.08250.00130.0026Throughput (kbps)2001012481205881729559984938400180221601811892147221189297716002839623798173152061616843150758003782632757337002674533229268631000438384289534054327573370030164Figure 4
Result analysis of the SI-ANFISR technique under 200 nodes.
(a)(b)(c)On inspecting the performance with respect to RE, the results notified the betterment of the SI-ANFISR technique with increased RE. For instance, with 200 rounds, the SI-ANFISR technique has reached a higher RE of 0.4421J, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained a lower RE of 0.4138J, 0.2462J, 0.3699J, 0.3699J, and 0.3674J, respectively. Similarly, with 1000 rounds, the SI-ANFISR system has attained a superior RE of 0.1985J, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO algorithms have obtained a minimum RE of 0.1122J, 0.0003J, 0.0825J, 0.0013J, and 0.0026J, correspondingly.On examining the performance with respect to throughput, the results notified the betterment of the SI-ANFISR technique with higher RE. For instance, with 200 rounds, the SI-ANFISR method has gained a superior throughput of 10124 kbps whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained a lower throughput of 8120 kbps, 5881 kbps, 7295 kbps, 5998 kbps, and 4938 kbps, correspondingly. Likewise, with 1000 rounds, the SI-ANFISR algorithm has reached higher throughput of 43838 kbps, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO systems have gained a minimum throughput of 42895 kbps, 34054 kbps, 32757 kbps, 33700 kbps, and 30164 kbps, correspondingly.Table2 and Figure 5 provide a comparative study of the SI-ANFISR algorithm with other methods under 500 nodes. On investigating the outcomes with respect to delay, it can be clear that the SI-ANFISR technique has gained minimal delay under all rounds. For instance, with 200 rounds, the SI-ANFISR algorithm has an obtainable worse delay of 0.1843 s, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have obtained an increased delay of 0.1997 s, 0.2304 s, 0.2486 s, 0.2595 s, and 0.2711 s, correspondingly. At the same time, with 1000 rounds, the SI-ANFISR technique has provided decreased delay of 0.2075 s whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO methods have reached a maximum delay of 0.2396 s, 0.2854 s, 0.2854 s, 0.2865 s, and 0.3053 s, correspondingly.Table 2
Result analysis of the SI-ANFISR technique with existing methods under 500 nodes.
No. of roundsSI-ANFISRE-ALWORPLMDS-MAPEESRAGWODelay (sec)2000.18430.19970.23040.24860.25950.27114000.19180.20640.24490.25710.25430.27396000.19900.22020.24660.25970.27260.28088000.20900.21340.25540.26650.27610.294110000.20750.23960.28540.28650.30530.3122Residual energy (J)2000.48000.45400.28950.41490.41270.40704000.42370.36170.19770.30880.27530.27026000.34080.29700.13250.24250.14890.15038000.26250.22580.07770.17650.04570.059610000.23400.14710.03400.11520.04090.0368Throughput (kbps)2001012481205881729559984938400180221601811892147221189297716002839623798173152061616843150758003782632757337002674533229268631000438384289534054327573370030164Figure 5
Result analysis of the SI-ANFISR technique under 500 nodes.
(a)(b)(c)On analyzing the performance with respect to RE, the results notified the betterment of the SI-ANFISR technique with increased RE. For instance, with 200 rounds, the SI-ANFISR algorithm has reached a maximum RE of 0.4800J whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained minimal RE of 0.4540J, 0.2895J, 0.4149J, 0.4127J, and 0.4070J, correspondingly. Afterward, with 1000 rounds, the SI-ANFISR system has reached a maximum RE of 0.2340J, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained reduced RE of 0.1471J, 0.0340J, 0.1152J, 0.0409J, and 0.0368J, correspondingly.Moreover, on examining the performance with respect to throughput, the results notified the betterment of the SI-ANFISR algorithm with increased RE. For instance, with 200 rounds, the SI-ANFISR technique has reached a superior throughput of 10124 kbps, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have achieved a lower throughput of 8120 kbps, 5881 kbps, 7295 kbps, 5998 kbps, and 4938 kbps, respectively. Followed by, with 1000 rounds, the SI-ANFISR technique has reached a higher throughput of 43838 kbps, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained a decreased throughput of 42895 kbps, 34054 kbps, 32757 kbps, 33700 kbps, and 30164 kbps, correspondingly.Next, the TPR analysis of the SI-ANFISR technique with existing techniques is made in Table3 and Figure 6. The results reported the betterment of the SI-ANFISR technique under all nodes. For instance, with 200 nodes, the SI-ANFISR technique has resulted in a higher TPR of 155512 bytes, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have attained a lower TPR of 131445, 103476, 64147, 34286, and 9328 bytes, respectively. In addition, with 500 nodes, the SI-ANFISR method has resulted in a higher TPR of 172002 bytes, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO methodologies have attained a reduced TPR of 151501, 117629, 86431, 57462, and 19133 bytes, correspondingly.Table 3
Analysis on total packets received of the SI-ANFISR technique with existing methods.
Total packets received by BS (byte)Methods200 nodes500 nodesSI-ANFISR155512172002E-ALWO131445151501RPL102476117629MDS-MAP6414786431EESRA3428657462GWO932819133Figure 6
TPR analysis of the SI-ANFISR technique with existing methods.Finally, a brief routing overhead (ROH) analysis of the SI-ANFISR technique with recent approaches is shown in Table4 and Figure 7 [24]. The results exhibited the improvement of the SI-ANFISR technique over the recent methods with a minimum amount of ROH under varying node counts. For instance, with 200 nodes, the SI-ANFISR technique has offered a lower ROH of 12%, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have provided a higher ROH of 20%, 36%, 45%, 58%, and 68%, respectively.Table 4
Routing overhead analysis of the SI-ANFISR technique with existing approaches.
Routing overhead (%)Methods200 nodes500 nodesSI-ANFISR1216E-ALWO2025RPL3638MDS-MAP4554EESRA5863GWO6872Figure 7
ROH analysis of the SI-ANFISR technique with existing methods.Similarly, with 500 nodes, the SI-ANFISR technique has accomplished a minimal ROH of 16%, whereas the E-ALWO, RPL, MDS-MAP, EESRA, and GWO techniques have resulted in a maximum ROCH of 25%, 38%, 54%, 63%, and 72%, respectively. After examining the results and discussion, it is verified that the SI-ANFISR technique has resulted in effective performance over the recent approaches.


## 6. Conclusion

In this study, a new SI-ANFISR technique has been developed for computing the optimal set of multihop routes for intercluster communication in WSN. The proposed SI-ANFISR technique involves three major processes, namely, cluster construction, ANFIS-based route selection, and SSA-based MF selection. The ANFIS model has utilized multiple input parameters for route selection, and the SSA helps to optimally choose the MFs, which results in improved network lifetime. The performance analysis of the SI-ANFISR technique takes place, and the results are inspected under different aspects. The simulation results highlighted the significant performance of the SI-ANFISR technique compared to the recent technique's maximum throughput of 43838 kbps and RE of 0.4800J, respectively. Therefore, the SI-ANFISR technique can be treated as an effective solution to increase the lifetime of the WSN. In the future, data compression approaches can be integrated into the clustering model to boost energy efficacy in WSN.



---

*Source: 7940895-2022-05-13.xml*