<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">28088</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.028088</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Statistical Analysis with Dingo Optimizer Enabled Routing for Wireless Sensor Networks</article-title>
<alt-title alt-title-type="left-running-head">Statistical Analysis with Dingo Optimizer Enabled Routing for Wireless Sensor Networks</alt-title>
<alt-title alt-title-type="right-running-head">Statistical Analysis with Dingo Optimizer Enabled Routing for Wireless Sensor Networks</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alghamdi</surname><given-names>Abdulaziz S.</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref><email>ashalghamedu@kau.edu.sa</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Alharbi</surname><given-names>Randa</given-names>
</name><xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Alsuhibany</surname><given-names>Suliman A.</given-names>
</name><xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Abdel-Khalek</surname><given-names>Sayed</given-names>
</name><xref ref-type="aff" rid="aff-4">4</xref>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Mathematics, College of Science &#x0026; Arts, King Abdulaziz University</institution>, <addr-line>Rabigh, 21911</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department Statistics, College of Science, University of Tabuk</institution>, <addr-line>Tabuk</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science, College of Computer, Qassim University</institution>, <addr-line>Buraydah, 51452</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Mathematics and Statistics, College of Science, Taif University</institution>, <addr-line>Taif, 21944</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Mathematics Department, Faculty of Science, Sohag University</institution>, <addr-line>Sohag, 82524</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Abdulaziz S. Alghamdi. Email: <email>ashalghamedu@kau.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-06-14"><day>14</day>
<month>06</month>
<year>2022</year></pub-date>
<volume>73</volume>
<issue>2</issue>
<fpage>2865</fpage>
<lpage>2878</lpage>
<history>
<date date-type="received">
<day>02</day>
<month>2</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>3</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Alghamdi et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Alghamdi et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_28088.pdf"></self-uri>
<abstract>
<p>Security is a vital parameter to conserve energy in wireless sensor networks (WSN). Trust management in the WSN is a crucial process as trust is utilized when collaboration is important for accomplishing trustworthy data transmission. But the available routing techniques do not involve security in the design of routing techniques. This study develops a novel statistical analysis with dingo optimizer enabled reliable routing scheme (SADO-RRS) for WSN. The proposed SADO-RRS technique aims to detect the existence of attacks and optimal routes in WSN. In addition, the presented SADO-RRS technique derives a new statistics based linear discriminant analysis (LDA) for attack detection, Moreover, a trust based dingo optimizer (TBDO) algorithm is applied for optimal route selection in the WSN and accomplishes secure data transmission in WSN. Besides, the TBDO algorithm involves the derivation of the fitness function involving different input variables of WSN. For demonstrating the enhanced outcomes of the SADO-RRS technique, a wide range of simulations was carried out and the outcomes demonstrated the enhanced outcomes of the SADO-RRS technique.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Statistical analysis</kwd>
<kwd>reliability</kwd>
<kwd>routing</kwd>
<kwd>wireless sensor networks</kwd>
<kwd>linear discriminant analysis</kwd>
<kwd>dingo optimizer</kwd>
<kwd>security</kwd>
</kwd-group>
</article-meta>
</front>

<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In recent times, WSN has extended the application range from early deployment for battlefield intelligence surveillance to fields like meteorological weather forecasting, emergency response support, factory automation security application, and so on. WSN consists of inexpensive and small sensors without a current architecture [<xref ref-type="bibr" rid="ref-1">1</xref>]. They are frequently utilized for sensing, processing, transmitting, and receiving data from the region they are positioned beforehand it is transported to a base station. A conventional WSN contains several sensors that are classified based on the environment and the structure (topology) where they are deployed. Basically, WSN is classified based on the deployment of the sensors in the environment [<xref ref-type="bibr" rid="ref-2">2</xref>]. This node is of equivalent capacity, while others have different capacities, based on the infrastructure. The three major kinds type WSN architecture are hierarchical, flat-based (tree), and cluster-based. Moreover, the environment where the sensors are positioned in a WSN is classified into five groups, such as mobile WSN, underground WSN, terrestrial WSN, underwater WSN, and multimedia WSN system [<xref ref-type="bibr" rid="ref-3">3</xref>]. The sensors in a WSN are frequently deployed in inaccessible, remote, and harsh regions and are frequently represented by resource constraints including limited storage, limited power, short communication range, and limited bandwidth [<xref ref-type="bibr" rid="ref-4">4</xref>]. They are integrated with the susceptibility of the wireless medium (that is open and shared) have generated sensors vulnerable to distinct security attacks namely the denial of service (DoS) [<xref ref-type="bibr" rid="ref-5">5</xref>]. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the WSN structure.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>WSN structure</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-1.png"/>
</fig>
<p>Even though conventional security approaches like authentication and cryptography could offer security at certain level, they alone could not handle compromised node attacks [<xref ref-type="bibr" rid="ref-6">6</xref>]. When the nodes are compromised, it launches attacks based on commands from the outside that could control or cripple the entire WSN system. For instance, malicious node could attract the information from another node via distinct method, and when it begins to receive the information, it could randomly receive or drop all information that considerably reduces the routing system efficiency [<xref ref-type="bibr" rid="ref-7">7</xref>]. To handle this type of node is to detect and monitor them. While there are no centralized authorities in WSN, nodes must detect and monitor malicious nodes in a distributed way. Several solutions are presented for securing WSN [<xref ref-type="bibr" rid="ref-8">8</xref>], together with routing. Since routing executes data distribution to BS, it is major protocol for WSN. Therefore, secured routing is strong against packet drop and disruption, and alteration act on routing process is vital [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. To protect routing, particularly against compromised nodes, several solutions have been introduced. One of these solutions is trust establishment, utilized in several study areas. Trust establishment identifies untrustworthy and trustworthy nodes by estimating them according to past performance or behavior. It prevents untrustworthy nodes and only chooses trustworthy in routing process [<xref ref-type="bibr" rid="ref-11">11</xref>]. As trust method is efficient and simple in compromised node detection, a considerable study is performed for enhancing cooperation and improving security in the networks.</p>
<p>Rathee et al. [<xref ref-type="bibr" rid="ref-12">12</xref>], proposed an ACO based QoS aware energy balancing secured routing (QEBSR) approach for WSN. Improved heuristics to calculate the end-to-end delay of communication and the trust factor of the node on the routing path are presented. The presented method has been related to 2 current approaches: energy efficient routing with node compromised resistance and distributed energy balanced routing. Haseeb et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] developed an energy-effective and secured routing method (ESR) for avoiding intrusion from IoT based WSN to improve the data trustworthiness and network period. First, the presented method makes distinct energy-effective clusters based on the intrinsic qualify of nodes. Next, according to the (k,n) threshold-based Shamir secret sharing system, the security and reliability of the sensory data amongst the BS and CH are accomplished.</p>
<p>Haseeb et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] presented an intrusion prevention architecture for mobile IoT devices using the incorporation of WSN for providing data security with enhanced network delivery ratio. The presented method is comprised of two sub-elements. First, autonomously organized and non-overlapping clusters are created and sustained the clusters stability according to the uncertainty principle. Next, end-to-end secured and multihop routing path is designed according to the blockchain architecture. In Selvi et al. [<xref ref-type="bibr" rid="ref-15">15</xref>], a secured routing method named energy aware trust based secured routing approach is presented whereby the trust score assessment is utilized for identifying the malevolent user efficiently in WSN and spatio-temporal constraint is utilized with DT approach to choosing optimal path.</p>
<p>This study develops a novel statistical analysis with dingo optimizer enabled reliable routing scheme (SADO-RRS) for WSN. The proposed SADO-RRS technique aims to detect the existence of attacks and optimal routes in WSN. In addition, the presented SADO-RRS technique derives a new statistics based linear discriminant analysis (LDA) for attack detection, Moreover, a trust based dingo optimizer (TBDO) algorithm is applied for optimal route selection in the WSN and accomplishes secure data transmission in WSN. Besides, the TBDO algorithm involves the derivation of the fitness function involving different input variables of WSN. In order to demonstrate the enhanced outcomes of the SADO-RRS technique, a wide range of simulations was carried out.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>The Proposed Model</title>
<p>In this study, a novel SADO-RRS technique has been developed for reliable routing in WSN. The proposed SADO-RRS technique determines the presence of attacks and optimal routes in WSN. In addition, the presented SADO-RRS technique derives a new statistics based LDA for attack detection. Furthermore, a TBDO algorithm is applied for optimal route selection in the WSN and accomplishes secure data transmission in WSN.</p>
<sec id="s2_1">
<label>2.1</label>
<title>LDA Based Attack Detection</title>
<p>Primarily, the LDA model is applied for the detection of intrusions in the network. The discriminant analysis concentrates on the connection amongst several independent variables and definite dependence variables by creating multiple independent variables. This kind of multivariate investigation defines the extents of the sum of composite variables discriminate amongst more than two existing sets of subjects and also could develop the classifier model to predict the group membership of novel observation. During this case, a linear discriminant function (LDF) which passed with the means of 2 groups (centroids) are utilized for discriminating subjects amongst 2 centroids. If there are further centroids, the amount of centroid minus one purpose has been required for classifying an observation amongst them. In order to all centroids, LDA considers as the explanatory variable that is usually distributed with equivalent covariance matrices. To all cases, the evaluated co-efficient to independent variables are multiplied by case&#x2019;s score on that variables.</p>
<p>The LDF has been demonstrated as:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>L</mml:mi><mml:mi>D</mml:mi><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>b</mml:mi><mml:mi>X</mml:mi><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> implies the value of <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> co-efficient, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> stands for the value of <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> cases of <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> predictors. The LDF is also be expressed in standardization procedure that permits relating variables to measure on various scales. The co-efficient with huge absolute values reflect superior discriminate capability to its equivalent variable [<xref ref-type="bibr" rid="ref-16">16</xref>]. In the <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>L</mml:mi><mml:mi>D</mml:mi><mml:mi>F</mml:mi></mml:math></inline-formula> score is evaluate forecasted probability and forecasted centroid membership to all cases on the dependent variable. This technique was dependent upon the rationale which it can be further possible that independent as well as dependent variables have been compared to the amongst-centroids sum of square are superior comparative to within-centroid sum of squares. Likewise, the ratio of amongst-centroids divided by entire amount of squares (eta-squared statistic or solved variabilities) or of within-centroid divided by entire amount of squares (Wilks&#x2019; lambda statistic or unsolved variabilities) has been utilized for assessing the connection. As noted, the ratio of amongst-centroid divided by within-centroid amount of squares are analogue to ratio of variances that is <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>F</mml:mi></mml:math></inline-formula> statistic, testing which controls the possibilities which the detected connection is because of chances.</p>
<p>The rule by that the discriminant co-efficient (or weights) were chosen is that maximizing the distance amongst 2 centroid means (centroids) <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mover><mml:mi>y</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mover><mml:mi>y</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></inline-formula>. The fisher is initially proposed to alter the multivariate observation <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>x</mml:mi></mml:math></inline-formula> for univariate observation <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>y</mml:mi></mml:math></inline-formula> just as <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>y</mml:mi></mml:math></inline-formula>&#x2019;s resulting from centroids 1 and 2 are the maximal distance amongst them. Therefore, the linear group <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>y</mml:mi><mml:mo>=</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msup><mml:mi>a</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mi>x</mml:mi></mml:math></inline-formula> is the one which maximizes the ratio (squared distance amongst instance means)/(instance variance <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>y</mml:mi></mml:math></inline-formula>). The vector of co-efficient is provided as the eigenvectors of matrix <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mo>&#x2217;</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>, whereas <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>B</mml:mi><mml:mo>=</mml:mo></mml:math></inline-formula> <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> implies the amongst-centroid matrix and <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>S</mml:mi></mml:math></inline-formula> refers the evaluation of <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi mathvariant="normal">&#x03A3;</mml:mi></mml:math></inline-formula>. Extremely important features of this composite amount of squares are that it is enclosed the variabilities and the co-variabilities of all the variables. The discriminant co-efficient is computed from unstandardized or standardized procedure however it can be irrelatively of procedure, minimum informative than individuals from regression. Considering that there are 2 centroids, <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> refers the means of all the centroids, and <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>S</mml:mi></mml:math></inline-formula> implies the pooled covariance matrix, the distribution rule dependent upon Fisher&#x2019;s discriminant function is subsequent:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="0.2em"/><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="0.2em"/><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mover><mml:mi>x</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>TBDO Based Routing Technique</title>
<p>The dingoes are sufficient able for finding the place of prey. Afterward trace the place, the pack after that alpha surrounds the prey. For modeling dingo&#x2019;s social hierarchy, it can be considered that the present optimum agent&#x2019;s method is an objective or purpose prey that is same as the optimum as the quest region is not recognized a priori [<xref ref-type="bibr" rid="ref-17">17</xref>]. Meanwhile, another quest agency is until seek for refreshing its approaches on the following feasible method. This performance of dingoes is demonstrated as the subsequent mathematical <xref ref-type="disp-formula" rid="eqn-3">Eqs. (3)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-7">(7)</xref>. Besides, a brief explanation of nomenclatures is utilized from the formula.</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>d</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>a</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mover><mml:mi>b</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>a</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>b</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mover><mml:mi>b</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>3</mml:mn><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>The place of neighborhood dingoes is signified utilizing a 2D place vector. Based on the place of prey <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>Q</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, a dingo is upgraded their place at the location of <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>Q</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Every feasible place is marked from the diagram nearby the optimum agents, regarding the present place as altering the value of <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> vectors. For instance, by setting <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, dingo is attained at <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>Q</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. It also signifies utilizing 3D space. It can be obviously demonstrated that arbitrary vectors a1 and a2 allow dingoes for entering someplace amongst the points. <xref ref-type="disp-formula" rid="eqn-3">Eqs. (3)</xref> and <xref ref-type="disp-formula" rid="eqn-4">(4)</xref> support dingoes for changing their places inside the quest region nearby the prey from several arbitrary places. For reaching a search space with <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>N</mml:mi></mml:math></inline-formula> dimensional, similar formulas are utilized and the dingo will move in hypercube about the optimum outcome done to this point.</p>
<p>Conversely, during the searching space based on the model, agent does not usually have computation of place of the prey (optimally). Scheming the dingoes hunting plan mathematical, it is considered that each pack member containing alpha, beta, and others are optimum skill on the potential place of prey. The alpha dingo continuously commands the hunting. But, at times beta and other dingo&#x2019;s can also be participating from hunting. Therefore, it is assumed the 1<sup>st</sup> two optimum values attained so far. According to place of optimum searching agents, other dingoes are also required for updating their place. Due to the discussion, <xref ref-type="disp-formula" rid="eqn-8">Eqs. (8)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-16">(16)</xref> are demonstrated this issue. In addition, a brief explanation of the nomenclatures utilized in the formula.</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>B</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>For calculating the intensity of all the dingoes, subsequent formulas are being utilized:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mi>E</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>100</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mi>E</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>100</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mi>E</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>100</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>The place upgrade from the <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mn>2</mml:mn><mml:mi>D</mml:mi></mml:math></inline-formula> searching space. It is easily visualization the place upgrade of alpha, beta, and other dingoes. It is also assumed that dingoes (alpha, beta, and others) upgrade their places arbitrarily and compute the place of prey from the searching space.</p>
<p>When there is no place upgrade, it refers the dingo done the hunting by attacking the prey. In order to mathematical formulate the approach, the value of <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:mover><mml:mi>b</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> has reduced linearly. The point stated that the change range of <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is also reduced by <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:mover><mml:mi>b</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>. It is also be recognized as <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> that is an arbitrary value from the <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn><mml:mi>b</mml:mi><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mi>b</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> interval where <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>b</mml:mi></mml:math></inline-formula> has been decreased in three to zero under the iterations. If the arbitrary values of <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are in one and one, a searching agent next place possibly from someplace amongst their present and the prey place. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> illustrates the flowchart of DO technique [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Flowchart of DO technique</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-2.png"/>
</fig>
<p>The presented surrounding technique does certainly reveal exploration to any extent; but, for accentuating exploration, DOX needs further operation. The DOX supports their quest agent from changing its place dependent upon the locating of, <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula>, others, and the targeted prey. Even, with this operator, the DOX is inactivating local solutions.</p>
<p>The dingoes hunt the prey frequently based on the pack&#x2019;s place. It is continuously travel forwarded to hunt and strike predators. So, <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>B</mml:mi></mml:math></inline-formula> has been utilized to arbitrary values where once the value has lesser than <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, it refers the prey has moving outside the searching agent, however when the value has superior to 1, it signifies the pack techniques the prey. This intervention supports the DOX for scanning the target generally. For determining that prey is optimum suitable that 1 assumes dingoes avoided the predator. Another element of DOX which creates exploration possible is <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>A</mml:mi></mml:math></inline-formula>. In <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>, the vector <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>A</mml:mi></mml:math></inline-formula> is create some arbitrary number amongst zero and three, to an arbitrary prey weight. The DOX implies the stochastic function, considered as vector <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> preceded than <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> for explaining the effect of gap expressed in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.</p>
<p>It is optimum to search and avoidance of neighboring optimal. According to a dingo&#x2019;s place, it can be arbitrarily agreed on prey value and create it essential for meeting dingo rigidly/beyond. Purposely, it is utilized <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>A</mml:mi></mml:math></inline-formula> for providing stochastic exploration value in the primary to last iterations. This technique has effective from protect the solution at local optimum. At last, the DOX ends themselves when it meets the end condition.</p>
<p>The presented approach develops a FF utilizing 3 input parameters such as trust level, distance to neighbors, and energy to optimum route selective.</p>
<p><bold>Distance to neighbors</bold>: It is suitable to select route with lesser distance amongst neighbouring nodes. In the intra-cluster communication procedure, sensor node utilization power to data broadcast. When the neighbour node distance has been moderated, then the power of intra-cluster broadcast is also minimized.</p>
<p>Objective 1: Minimizing</p>
<p><disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:mn>1</mml:mn><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><bold>Trust factor (TF)</bold>: Initially, every node is declared that TF is one. The value of TF has been reduced by anomalous prediction method if the node processes the abnormal task and nodes are named as malicious nodes.</p>
<p>Objective 2: Maximizing</p>
<p><disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:mn>1</mml:mn><mml:mi>m</mml:mi></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><bold>Energy:</bold> When the node intake minimal power utilized as sensing, process, and transmission process also with maximal RE has gathered of minimal energy ratio. So, the low as energy ratio, the CH selective develop more possible.</p>
<p>Objective 3: Minimizing
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>In the proposed technique, it could be vital to decrease the linear group of main functions. So, the potential energy function of presented approach was implemented as:</p>
<p><disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:mrow><mml:mi mathvariant="italic">M</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">z</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mspace width="0.2em"/><mml:mrow><mml:mi mathvariant="italic">P</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow><mml:mspace width="0.2em"/><mml:mrow><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">y</mml:mi></mml:mrow><mml:mspace width="0.2em"/><mml:mrow><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></disp-formula>where <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:mspace width="0.2em"/><mml:mi>A</mml:mi><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mspace width="0.4em"/><mml:mn>0</mml:mn><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>1.</mml:mn></mml:math></inline-formula></p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Experimental Validation</title>
<p>This section inspects the performance validation of the SADO-RRS technique with existing techniques. The results are inspected interms of distinct aspects.</p>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> provides detailed intrusion detection results of the SADO-RRS technique with recent methods. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> inspects the <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of the SADO-RRS technique with compared methods. The figure reported that the SVM model has resulted in least <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.6758. Followed by, the SOM and ANN-IDS models have obtained slightly enhanced <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 0.7432 and 0.7948 respectively. In line with, the DMN-NB, GAN, and DELM techniques have accomplished moderately closer <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 0.8021, 0.8531, and 0.8964 respectively. However, the SADO-RRS model has attained maximum <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9313.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Result analysis of SADO-RRS technique with recent approaches interms of various measures</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Precision</th>
<th>Recall</th>
<th>Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td>SVM</td>
<td>0.6758</td>
<td>0.7111</td>
<td>0.6950</td>
</tr>
<tr>
<td>SOM</td>
<td>0.7432</td>
<td>0.7732</td>
<td>0.7550</td>
</tr>
<tr>
<td>ANN-IDS</td>
<td>0.7948</td>
<td>0.8313</td>
<td>0.8120</td>
</tr>
<tr>
<td>DMN-NB</td>
<td>0.8021</td>
<td>0.8283</td>
<td>0.8150</td>
</tr>
<tr>
<td>GANs</td>
<td>0.8531</td>
<td>0.8830</td>
<td>0.8650</td>
</tr>
<tr>
<td>DELM</td>
<td>0.8964</td>
<td>0.9310</td>
<td>0.9123</td>
</tr>
<tr>
<td>SADO-RRS</td>
<td>0.9313</td>
<td>0.9546</td>
<td>0.9437</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title><inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of SADO-RRS technique with recent methods</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-3.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> examines the <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of the SADO-RRS technique with compared methods. The figure exposed that the SVM model has resulted to least <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.7111. Then, the SOM and ANN-IDS systems have obtained slightly enhanced <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 0.7732 and 0.8313 correspondingly. Likewise, the DMN-NB, GAN, and DELM techniques have accomplished moderately closer <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 0.8283, 0.8830, and 0.9310 correspondingly. But, the SADO-RRS method has attained higher <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9546.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title><inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of SADO-RRS technique with recent methods</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-4.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> demonstrates the <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of the SADO-RRS technique with compared methods. The figure outperformed that the SVM methodology has resulted in minimal <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.6950. Afterward, the SOM and ANN-IDS techniques have obtained somewhat increased <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 0.7550 and 0.8120 correspondingly. Besides, the DMN-NB, GAN, and DELM techniques have accomplished moderately closer <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 0.8150, 0.8650, and 0.9123 correspondingly. At last, the SADO-RRS model has attained superior <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 0.9437.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title><inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of SADO-RRS technique with recent methods</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-5.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="fig" rid="fig-6">Fig. 6</xref> illustrate the network lifetime (NLFT) examination of the SADO-RRS technique with existing ones under distinct number of compromised nodes. The results indicated that the SADO-RRS technique has resulted in increased NLFT over the other methods under all compromised nodes. For instance, with 5% of compromised nodes, the SADO-RRS technique has offered higher NLFT of 961 rounds whereas the DEBR, EENC, and QEBSR techniques have attained lower 793, 878, and 927 rounds respectively. Similarly, with 30% of compromised nodes, the SADO-RRS approach has obtainable maximal NLFT of 919 rounds whereas the DEBR, EENC, and QEBSR methodologies have attained lower 615, 766, and 868 rounds correspondingly.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Network lifetime analysis of SADO-RRS technique under distinct compromised nodes</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="5">Network lifetime (Rounds)</th>
</tr>
<tr>
<th>Compromised nodes (%)</th>
<th>DEBR</th>
<th>EENC</th>
<th>QEBSR</th>
<th>SADO-RRS</th>
</tr>
</thead>
<tbody>
<tr>
<td>5</td>
<td>793</td>
<td>878</td>
<td>927</td>
<td>961</td>
</tr>
<tr>
<td>10</td>
<td>749</td>
<td>858</td>
<td>912</td>
<td>958</td>
</tr>
<tr>
<td>20</td>
<td>697</td>
<td>810</td>
<td>880</td>
<td>932</td>
</tr>
<tr>
<td>30</td>
<td>615</td>
<td>766</td>
<td>868</td>
<td>919</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>NLFT analysis of SADO-RRS technique under distinct compromised nodes</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-6.png"/>
</fig>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-7">Fig. 7</xref> depict the NLFT examination of the SADO-RRS approach with existing ones under distinct number of nodes. The outcomes referred that the SADO-RRS methodology has resulted in increased NLFT over the other methods under all nodes. For instance, with 100 nodes, the SADO-RRS approach has accessible maximal NLFT of 1040 rounds whereas the DEBR, EENC, and QEBSR systems have obtained minimal 693, 827, and 888 rounds correspondingly. At the same time, with 400 nodes, the SADO-RRS approach has obtainable superior NLFT of 2439 rounds whereas the DEBR, EENC, and QEBSR methodologies have reached minimal 1976, 2098, and 2360 rounds correspondingly.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Network lifetime analysis of SADO-RRS technique under count of nodes</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="5">Network lifetime (Rounds)</th>
</tr>
<tr>
<th>No. of nodes</th>
<th>DEBR</th>
<th>EENC</th>
<th>QEBSR</th>
<th>SADO-RRS</th>
</tr>
</thead>
<tbody>
<tr>
<td>100</td>
<td>693</td>
<td>827</td>
<td>888</td>
<td>1040</td>
</tr>
<tr>
<td>200</td>
<td>1100</td>
<td>1228</td>
<td>1386</td>
<td>1599</td>
</tr>
<tr>
<td>400</td>
<td>1976</td>
<td>2098</td>
<td>2360</td>
<td>2439</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>NLFT analysis of SADO-RRS technique under count of nodes</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-7.png"/>
</fig>
<p><xref ref-type="table" rid="table-4">Tab. 4</xref> and <xref ref-type="fig" rid="fig-8">Fig. 8</xref> depict the PDR examination of the SADO-RRS technique with existing ones under distinct count of compromised nodes. The results referred that the SADO-RRS technique has resulted in maximum PDR over the other methods under all compromised nodes. For instance, with 5% of compromised nodes, the SADO-RRS system has offered increased PDR of 0.9670 rounds whereas the DEBR, EENC, and QEBSR systems have reached lesser of 0.9363, 0.9617, and 0.9649 rounds correspondingly. Also, with 30% of compromised nodes, the SADO-RRS approach has obtainable increased PDR of 0.9572 rounds whereas the DEBR, EENC, and QEBSR approaches have achieved reduced 0.9369, 0.9418, and 0.9480 rounds correspondingly.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>PDR analysis of SADO-RRS technique under distinct compromised nodes</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="5">Packet delivery ratio</th>
</tr>
<tr>
<th>Compromised nodes (%)</th>
<th>DEBR</th>
<th>EENC</th>
<th>QEBSR</th>
<th>SADO-RRS</th>
</tr>
</thead>
<tbody>
<tr>
<td>5</td>
<td>0.9363</td>
<td>0.9617</td>
<td>0.9649</td>
<td>0.9670</td>
</tr>
<tr>
<td>10</td>
<td>0.9418</td>
<td>0.9599</td>
<td>0.9607</td>
<td>0.9653</td>
</tr>
<tr>
<td>20</td>
<td>0.9457</td>
<td>0.9560</td>
<td>0.9580</td>
<td>0.9634</td>
</tr>
<tr>
<td>30</td>
<td>0.9369</td>
<td>0.9418</td>
<td>0.9480</td>
<td>0.9572</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>PDR analysis of SADO-RRS technique under distinct compromised nodes</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-8.png"/>
</fig>
<p>A detailed PLR examination of the SADO-RRS technique with recent models in <xref ref-type="table" rid="table-5">Tab. 5</xref> and <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. The outcomes indicated the betterment of the SADO-RRS technique over the other methods under distinct number of compromised nodes. For instance, with 5% of compromised nodes, the SADO-RRS technique has attained reduced PLR of 0.0330 whereas the DEBR, EENC, and QEBSR techniques have obtained least PLR of 0.0637, 0.0383, and 0.0351 respectively. Also, with 30% of compromised nodes, the SADO-RRS approach has reached lower PLR of 0.0428 whereas the DEBR, EENC, and QEBSR approaches have attained minimal PLR of 0.0631, 0.0582, and 0.0520 correspondingly.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>PLR analysis of SADO-RRS technique under distinct compromised nodes</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="5">Packet loss rate</th>
</tr>
<tr>
<th>Compromised nodes (%)</th>
<th>DEBR</th>
<th>EENC</th>
<th>QEBSR</th>
<th>SADO-RRS</th>
</tr>
</thead>
<tbody>
<tr>
<td>5</td>
<td>0.0637</td>
<td>0.0383</td>
<td>0.0351</td>
<td>0.0330</td>
</tr>
<tr>
<td>10</td>
<td>0.0582</td>
<td>0.0401</td>
<td>0.0393</td>
<td>0.0347</td>
</tr>
<tr>
<td>20</td>
<td>0.0543</td>
<td>0.0440</td>
<td>0.0420</td>
<td>0.0366</td>
</tr>
<tr>
<td>30</td>
<td>0.0631</td>
<td>0.0582</td>
<td>0.0520</td>
<td>0.0428</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>PLR analysis of SADO-RRS technique under distinct compromised nodes</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_28088-fig-9.png"/>
</fig>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>In this study, a novel SADO-RRS technique has been developed for reliable routing in WSN. The proposed SADO-RRS technique determines the presence of attacks and optimal routes in WSN. In addition, the presented SADO-RRS technique derives a new statistics based LDA for attack detection. The presented approach develops a FF utilizing 3 input parameters such as trust level, distance to neighbors, and energy to optimum route selective. In the proposed technique, it could be vital to decrease the linear group of main functions. The experimental result analysis of the SADO-RRS technique highlighted the enhanced outcomes. In future, data aggregation approaches can be integrated into the SADO-RRS technique for enhanced performance in WSN.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> This project was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, Saudi Arabia under Grant No. (KEP-81&#x2013;130-42). The authors, therefore acknowledge with thanks DSR technical and financial support.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Alwan</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Agarwal</surname></string-name></person-group>, &#x201C;<article-title>Multi-objective Reliable multipath routing for wireless sensor networks</article-title>,&#x201D; in <conf-name>2010 IEEE Globecom Workshops</conf-name>, <publisher-loc>Miami, FL, USA</publisher-loc>, pp. <fpage>1227</fpage>&#x2013;<lpage>1231</lpage>, <year>2010</year>. </mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Tariq</surname></string-name>, <string-name><given-names>Y. P.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>J. H.</given-names> <surname>Kim</surname></string-name>, <string-name><given-names>Y. J.</given-names> <surname>Park</surname></string-name> and <string-name><given-names>E. H.</given-names> <surname>Jung</surname></string-name></person-group>, &#x201C;<article-title>Energy efficient and reliable routing scheme for wireless sensor networks</article-title>,&#x201D; in <conf-name>2009 Int. Conf. on Communication Software and Networks</conf-name>, <publisher-loc>Chengdu, China</publisher-loc>, pp. <fpage>181</fpage>&#x2013;<lpage>185</lpage>, <year>2009</year>. </mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W. F.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X. M.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Jha</surname></string-name></person-group>, &#x201C;<article-title>A robust 3-D medical watermarking based on wavelet transform for data protection</article-title>,&#x201D; <source>Computer Systems Science &#x0026; Engineering</source>, vol. <volume>41</volume>, no. <issue>3</issue>, pp. <fpage>1043</fpage>&#x2013;<lpage>1056</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X. M.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Jha</surname></string-name></person-group>, &#x201C;<article-title>Robust reversible audio watermarking scheme for telemedicine and privacy protection</article-title>,&#x201D; <source>Computers Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>2</issue>, pp. <fpage>3035</fpage>&#x2013;<lpage>3050</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. H.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Y. F.</given-names> <surname>Chung</surname></string-name></person-group>, &#x201C;<article-title>Secure user authentication scheme for wireless healthcare sensor networks</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>59</volume>, no. <issue>2</issue>, pp. <fpage>250</fpage>&#x2013;<lpage>261</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Okdem</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Karaboga</surname></string-name></person-group>, &#x201C;<article-title>Routing in wireless sensor networks using ant colony optimization</article-title>,&#x201D; in <conf-name>First NASA/ESA Conf. on Adaptive Hardware and Systems (AHS&#x0027;06)</conf-name>, <publisher-loc>Istanbul, Turkey</publisher-loc>, pp. <fpage>401</fpage>&#x2013;<lpage>404</lpage>, <year>2006</year>. </mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Daabaj</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Dixon</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Koziniec</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Cole</surname></string-name></person-group>, &#x201C;<article-title>Reliable routing scheme for indoor sensor networks</article-title>,&#x201D; in <conf-name>21st Annual IEEE Int. Symp. on Personal, Indoor and Mobile Radio Communications</conf-name>, <publisher-loc>Istanbul, Turkey</publisher-loc>, pp. <fpage>1614</fpage>&#x2013;<lpage>1619</lpage>, <year>2010</year>. </mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Srinivasan</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Kannan</surname></string-name></person-group>, &#x201C;<article-title>Energy harvesting based efficient routing scheme for wireless sensor network</article-title>,&#x201D; <source>Wireless Personal Communications</source>, vol. <volume>101</volume>, no. <issue>3</issue>, pp. <fpage>1457</fpage>&#x2013;<lpage>1468</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Zabin</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Misra</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Woungang</surname></string-name>, <string-name><given-names>H. F.</given-names> <surname>Rashvand</surname></string-name>, <string-name><given-names>N.-W.</given-names> <surname>Ma</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>REEP: Data-centric, energy-efficient and reliable routing protocol for wireless sensor networks</article-title>,&#x201D; <source>IET Communications</source>, vol. <volume>2</volume>, no. <issue>8</issue>, pp. <fpage>995</fpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Zhao</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Differentiated data aggregation routing scheme for energy conserving and delay sensitive wireless sensor networks</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>18</volume>, no. <issue>7</issue>, pp. <fpage>2349</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Banerjee</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Chanak</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Rahaman</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Samanta</surname></string-name></person-group>, &#x201C;<article-title>Effective fault detection and routing scheme for wireless sensor networks</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>40</volume>, no. <issue>2</issue>, pp. <fpage>291</fpage>&#x2013;<lpage>306</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Rathee</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>A. H.</given-names> <surname>Gandomi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Dilip</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Balusamy</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Ant colony optimization based quality of service aware energy balancing secure routing algorithm for wireless sensor networks</article-title>,&#x201D; <source>IEEE Transactions on Engineering Management</source>, vol. <volume>68</volume>, no. <issue>1</issue>, pp. <fpage>170</fpage>&#x2013;<lpage>182</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Haseeb</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Almogren</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>I. U.</given-names> <surname>Din</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Jan</surname></string-name></person-group>, &#x201C;<article-title>An energy-efficient and secure routing protocol for intrusion avoidance in iot-based WSN</article-title>,&#x201D; <source>Energies</source>, vol. <volume>12</volume>, no. <issue>21</issue>, pp. <fpage>4174</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Haseeb</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Almogren</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Ud Din</surname></string-name></person-group>, &#x201C;<article-title>Intrusion prevention framework for secure routing in wsn-based mobile internet of things</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>185496</fpage>&#x2013;<lpage>185505</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Selvi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Thangaramya</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ganapathy</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Kulothungan</surname></string-name>, <string-name><given-names>H. K.</given-names> <surname>Nehemiah</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>An energy aware trust based secure routing algorithm for effective communication in wireless sensor networks</article-title>,&#x201D; <source>Wireless Personal Communications</source>, vol. <volume>105</volume>, no. <issue>4</issue>, pp. <fpage>1475</fpage>&#x2013;<lpage>1490</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Antonogeorgos</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Panagiotakos</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Priftis</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Tzonou</surname></string-name></person-group>, &#x201C;<article-title>Logistic regression and linear discriminant analyses in evaluating factors associated with asthma prevalence among 10- to 12-years-old children: Divergence and similarity of the two statistical methods</article-title>,&#x201D; <source>International Journal of Pediatrics</source>, vol. <volume>2009</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. K.</given-names> <surname>Bairwa</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Joshi</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Singh</surname></string-name></person-group>, &#x201C;<article-title>Dingo optimizer: A nature-inspired metaheuristic approach for engineering problems</article-title>,&#x201D; <source>Mathematical Problems in Engineering</source>, vol. <volume>2021</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>12</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. H. A.</given-names> <surname>Covarrubias</surname></string-name>, <string-name><given-names>H. P.</given-names> <surname>V&#x00E1;zquez</surname></string-name>, <string-name><given-names>A. F. P.</given-names> <surname>Delgado</surname></string-name> and <string-name><given-names>P. M. G.</given-names> <surname>Vite</surname></string-name></person-group>, &#x201C;<article-title>An improved dingo optimization algorithm applied to SHE-PWM modulation strategy</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>12</volume>, no. <issue>3</issue>, pp. <fpage>992</fpage>, <year>2022</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
