<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="review-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Bohr. Scit.</journal-id>
<journal-title>BOHR International Journal of Smart Computing and Information Technology</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Bohr. Scit.</abbrev-journal-title>
<issn pub-type="epub">2583-2026</issn>
<publisher>
<publisher-name>BOHR</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.54646/bijscit.2022.21</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Review</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Fuzzy clustering and energy resourceful routing protocol (FCER<sup>2</sup>P) for smart dust</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Rajesh</surname> <given-names>D.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Rajanna</surname> <given-names>G. S.</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>PDF Scholar, Srinivas University, Mangalore</institution>, <addr-line>Karnataka</addr-line>, <country>India</country></aff>
<aff id="aff2"><sup>2</sup><institution>Professor, Srinivas University, Mangalore</institution>, <addr-line>Karnataka</addr-line>, <country>India</country></aff>
<author-notes>
<corresp id="c001">&#x002A;Correspondence: D. Rajesh, <email>rajeshd936@gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>06</day>
<month>02</month>
<year>2022</year>
</pub-date>
<volume>3</volume>
<issue>1</issue>
<fpage>1</fpage>
<lpage>8</lpage>
<history>
<date date-type="received">
<day>05</day>
<month>01</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>26</day>
<month>01</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2022 Rajesh and Rajanna.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Rajesh and Rajanna</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Sensor nodes in smart dust are used to track and identify data that is being transferred to a sink. The accessibility of node energy poses a significant challenge for smart dust and may have an impact on the long-term viability of the network. As a result, constructing smart dust must take into account the need for algorithms and techniques that enable the most use of scarce resources, especially energy resources. For instance, routing algorithms are distinctive algorithms because they have a clear and direct connection with network longevity and energy. The offered routing techniques use clustering each round and single-hop data delivery to the sink. A Fuzzy Clustering and Energy Resourceful Routing Protocol (FCER<sup>2</sup>P) that reduces smart dust energy consumption and lengthens lifespan of the network is proposed in this research. Using a specified threshold, FCER<sup>2</sup>P proposes a new cluster-based fuzzy routing mechanism that can make use of clustering and multiple hop routing capabilities simultaneously. This research is innovative in that it adjusts multi-hop connectivity by anticipating the optimum intermediate node for aggregating and the sink, eliminates clustering each round while taking a fixed threshold into account, and eliminates clustering per round altogether. When choosing the intermediary node to employ, some fuzzy parameters, including residual energy, the number of neighbors, and the distance to the sink, are taken into account.</p>
</abstract>
<kwd-group>
<kwd>energy utilization</kwd>
<kwd>Fuzzy Clustering</kwd>
<kwd>Routing Protocol</kwd>
<kwd>smart dust</kwd>
</kwd-group>
<counts>
<fig-count count="11"/>
<table-count count="0"/>
<equation-count count="6"/>
<ref-count count="18"/>
<page-count count="8"/>
<word-count count="4374"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="intro">
<title>1. Introduction</title>
<p>Multiple with minimal processing capacity are widely used in smart dust, which collects atmospheric data and communicates with base stations (BS). In recent times, improvements in embedded system design have reduced the size, mass, and price of sensors while boosting processing speed and delivering more precise data. Smart dust is best employed for observing and tracking a variety of applications, as exposed in <xref ref-type="fig" rid="F1">Figure 1</xref>. As network nodes have minimum energy, data transfer consumes the majority of energy in smart dust. Therefore, it is essential to create a structure that uses the smallest amount of energy possible when sending information to the BS. One strategy to use less energy is to design network topology with a hierarchical system. These network nodes are arranged in a hierarchy with multiple levels, with nodes in each layer sharing the same properties. Clustering is one method for creating the hierarchical system. To guarantee that all sensors are gathering information from their physical surroundings, network elements are subdivided into different clusters (<xref ref-type="bibr" rid="B1">1</xref>). Since smart dust are typically dynamic, energy consumption may decrease as that of the network&#x2019;s lifespan increases by choosing the most effective method for transferring packets from node to sink.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption><p>Smart dust application.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g001.tif"/>
</fig>
<p>In smart dust, there really are three distinct routing techniques, namely, flat, hierarchical, and based on geography. Smart dust structure is seen in <xref ref-type="fig" rid="F2">Figure 2</xref>. The rotation and flooding algorithms, in which every network node has the same function, use flatter routing. This method allows nodes to interact with one another by gathering environmental data (<xref ref-type="bibr" rid="B2">2</xref>). A much more flexible hierarchy routing is an additional technique of data transmission to the BS. Since they have the most resources and are in charge of collecting and combining the data obtained from the nodes, headers are frequently used in hierarchical routing (<xref ref-type="bibr" rid="B3">3</xref>). According on how the network is set up, it is then assembled and sent in one or more hops to the BS for treatment before being received by the user. The cost of transmitting data to the sink rises as the length here between nodes as well as the sink widens. Energy can be saved, and the lifespan of the header node increased when hierarchical routing is used with the right intermediate node. Similar to what is being said, utilizing multi-hop broadcasts increases connection, range, and stability. There have been many methods for determining this header node, but determining a header node using a fuzzy system lowers the computation time. The primary goal of the proposed A Fuzzy Clustering and Energy Resourceful Routing Protocol (FCER<sup>2</sup>P) is to develop an easy-to-implement energy-efficient routing mechanism that utilizes clustering with a pre-determined threshold. In the FCER<sup>2</sup>P, many hops and choosing the best intermediate node are accomplished. The intermediate node is selected from the listed header locations based on the &#x201C;Remoteness to BS&#x201D; and &#x201C;outstanding node energy&#x201D; concept in order. The suggested FCER<sup>2</sup>P clustering are dependent on the assertive header node, which differs from other widely used techniques in that clustering is not performed each round. Certain clustering algorithms choose their headers at random, which reduces the possibility of using the effective concentration as a cluster head (CH). A header sensor node is picked based on optimal fuzzy attribute parameters in the suggested FCER<sup>2</sup>P. The present node has indeed been recognized; hence, no additional nodes are chosen in the next rounds. This approach results in a negligible amount of conflicts and the transmission of control messages.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption><p>Smart dust hierarchical structure.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g002.tif"/>
</fig>
<p>Existing fuzzy-based clustering methods for smart dust are reviewed in the remaining parts of the article, which are described in Section 2. The planned FCER<sup>2</sup>P system is covered in detail in Section 3. Section 4 discusses the simulation findings and comparability of the suggested FCER<sup>2</sup>P with the evaluation findings. The results and upcoming research are shown in Sections 5 and 6.</p>
</sec>
<sec id="S2">
<title>2. Related work</title>
<p>The clustering methodology Multi-Objective Fuzzy Clustering Algorithm (MOFCA) (<xref ref-type="bibr" rid="B4">4</xref>) is built on a fuzzy inference system, and it uses fuzzy variables such as &#x201C;remaining energy,&#x201D; &#x201C;range to BS,&#x201D; and &#x201C;intensity of every node.&#x201D; This technique uses an energy-based competition perimeter to select the CH. This technique was designed to address the &#x201C;energetic hole&#x201D; and &#x201C;hot region&#x201D; issues. Using the parameters such as Half Nodes Active (HNA), Foremost Node Dead (FND), and Overall Available Energy, this method calculates the lifespan of WSNs (TRE). Depending on its location from the BS, the CHS diameter calculation is determined using the residual power from the nodes. When employing effective procedures to handle WSN environments, the intensity variables are used as input variables for the fuzzy logic that has been built. To evaluate the MOFCA optimization technique with extra clustered methodologies, including Low Energy Adaptive Clustering Hierarchy (LEACH) (<xref ref-type="bibr" rid="B5">5</xref>), CH Election utilizing Fuzzy logic (CHEF) (<xref ref-type="bibr" rid="B6">6</xref>), Energy-Efficient Unequal Clustering (EEUC) (<xref ref-type="bibr" rid="B7">7</xref>), and Energy-Aware Unequal Clustering with Fuzzy (EAUCF) (<xref ref-type="bibr" rid="B8">8</xref>), a comparison analysis has been performed as a component of an innovative assessment process. In instance 1, the nodes are distributed almost uniformly using MOFCA. Depending on its location, BS of an area of interest (AOI), broadcast form, and BS placement are affected. Scenario 2 demonstrates that, with the exception of LEACH (<xref ref-type="bibr" rid="B9">9</xref>) and CHEF (<xref ref-type="bibr" rid="B10">10</xref>) implementations, multi-hop networking does have a maximum competitive radius. The BS is the AOI&#x2019;s center, and the nodes are arranged nearly uniformly. In instances 3 and 4, nodes are deliberately generated in a non-uniform dispersion. Though, with the latter installation, the BS is outside of the AOI. Nodes in situation 4 have their x and y positions changed by about 5 m, allowing for a broadband network.</p>
<p>The MOFCA methodology (<xref ref-type="bibr" rid="B11">11</xref>) performs better compared to the other three techniques, with an effectiveness that is 57% higher than LEACH (<xref ref-type="bibr" rid="B5">5</xref>), according to the FND measurement results. The execution effectiveness of CHEF (<xref ref-type="bibr" rid="B12">12</xref>), EEUC (<xref ref-type="bibr" rid="B7">7</xref>), and EAUCF (<xref ref-type="bibr" rid="B13">13</xref>) is 29, 10, and 8% less than MOFCA. The deployment of WSNs and emissions reduction are more adjustable if transmission lines are installed. In the studies, the MOFCA computation efficiency (<xref ref-type="bibr" rid="B4">4</xref>) was logically preferable when contrasted to other cases. This technique&#x2019;s use of asymmetrical clustering, which produces balancing energy usage, is just one of its advantages. One issue with the method is the implementation of clustering in that round. A fuzzy system-based clustering technique called EAUCF has indeed been suggested to prolong a network&#x2019;s lifetime. This methodology partially uses the techniques to improve node selection while also using a fuzzy system to rotate the CH on a recurring basis, which improves performance over previous methods. In real networks, this approach increases a network&#x2019;s lifespan, however, in node mobility, it has no effect. One of the shortcomings of the method is the complexity of the procedure due to the requirement to approximate the sizes of both clusters prior to clustering. Such a method also has the drawback of selecting a CH node without taking &#x201C;node density&#x201D; into consideration, which could lead to the CH being a node with few neighbors. Consistency is one benefit of this method. A methodology that uses the fuzzy system to determine the CH&#x2019;s contentment is Energy-Efficient Fuzzy Logic-Based Clustering Technique for Hierarchical Routing Protocols in WSNs (FL-EEC/D) (<xref ref-type="bibr" rid="B14">14</xref>). Furthermore, it equalizes energy use among clusters and resolves the hot zone problem. The multi-hop communication system that relies on Fibonacci sequences is used to address this. The fuzzy logical interpretation is used by Fuzzy Logic for Multi-hop WSNs (FLCAMN) methodology (<xref ref-type="bibr" rid="B15">15</xref>) to choose the right CHs. The networking life is examined by FND and Half Nodes Dead (HND) measurements. a comparison based on various algorithms, including LEACH (<xref ref-type="bibr" rid="B5">5</xref>), Energy-Aware Multi-Hop Multi-Path Hierarchical Routing Protocol for WSNs (EAMMH), and Distributed Fuzzy Logic Algorithm (DFLC) (<xref ref-type="bibr" rid="B16">16</xref>). At the 91st phase, the FLCMN-based FND outscored LEACH (<xref ref-type="bibr" rid="B5">5</xref>), EAMMH (<xref ref-type="bibr" rid="B12">12</xref>), DFLC (<xref ref-type="bibr" rid="B11">11</xref>), and FLCMN (<xref ref-type="bibr" rid="B10">10</xref>) by using average remaining energy as its input variable. This illustrates how well nodes&#x2019; leftover energy is used in conjunction with that of their nearby nodes. As seen in <xref ref-type="fig" rid="F3">Figure 3</xref>, FLCMN utilizes leftover energy from the broadcaster&#x2019;s WSNs to eventually prolong its lifespan (<xref ref-type="bibr" rid="B17">17</xref>).</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption><p>Network life of cluster approaches.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g003.tif"/>
</fig>
<p>A fuzzy scheme hierarchical proposed technique is Fuzzy Logic-Based Energy Efficient Clustering Hierarchy (FLECH) (<xref ref-type="bibr" rid="B18">18</xref>). Throughout this technique, &#x201C;remaining energy,&#x201D; &#x201C;focusing rate,&#x201D; and &#x201C;length to the BS&#x201D; are used to select the cluster. In various cases, the effectiveness of FLECH is compared to that of the segmentation-based visual processing algorithm (SVPA) (<xref ref-type="bibr" rid="B15">15</xref>), the disseminated scheduling scheme, and QoS-limited routing scheme for wireless sensor networks (DSQLRA) (<xref ref-type="bibr" rid="B2">2</xref>). The FLECH method performed better than other techniques in the simulation by consuming less energy and extending longevity through round data collection in the network. This strategy has the advantage of selecting the CH in a deterministic and weighted manner. This method&#x2019;s potential for clustering in every round is one of its drawbacks.</p>
</sec>
<sec id="S3">
<title>3. Proposed methodology</title>
<sec id="S3.SS1">
<title>3.1. Fuzzy system</title>
<p>In terms of cluster analysis, choosing a central role is among the most crucial choices you will have to make. Selecting the best smart dust node to act as a smart dust CH can significantly reduce energy consumption while extending the system&#x2019;s lifetime. The CH node has been chosen using a variety of strategies up to this moment, includes probability selection, unambiguous selection, simulated annealing, and the use of fuzzy logic inside the selection method. Fuzzy systems reduce the computation uncertainties and complexity in WSNs (<xref ref-type="bibr" rid="B12">12</xref>). Fuzzy logic is a form of cross-logic where every other statement&#x2019;s proper value can range from zero to one. A fuzzy scheme continuously converts a dataset into a fuzzy non-linear transformation. Every logical input variable is transformed into a group of fuzzy values using the application &#x201C;fuzzy builder.&#x201D; Every fuzzy result is converted into a real corresponding value in the defuzzer section. This component analyzes fuzzy values and carries out procedures in accordance with rules. This method includes the steps of creating a classification for input variables, using fuzzy expressions, and producing a final output, among many other things.</p>
</sec>
<sec id="S3.SS2">
<title>3.2. System model</title>
<p>The suggested FCER<sup>2</sup>P is predicated on the following hypotheses:</p>
<list list-type="simple">
<list-item>
<label>1.</label>
<p>All nodes have a similar beginning energy, and they all have a homogeneous mixture.</p>
</list-item>
<list-item>
<label>2.</label>
<p>The placement of nodes in a network is randomly selected.</p>
</list-item>
<list-item>
<label>3.</label>
<p>The very same time is assumed to be shared by all participating nodes.</p>
</list-item>
<list-item>
<label>4.</label>
<p>Every BS and node are static.</p>
</list-item>
<list-item>
<label>5.</label>
<p>The Euclid algorithm is used to determine the range.</p>
</list-item>
<list-item>
<label>6.</label>
<p>This header data is delivered to BS in numerous hops and, under unusual circumstances, in a single hop.</p>
</list-item>
<list-item>
<label>7.</label>
<p>The neighbours of a node are nodes located at a radius of R from that node.</p>
</list-item>
</list>
<p>The energy usage prototypical for sending &#x201C;1&#x201D;-bit information packets between transmitter and receiver spaced &#x201C;d&#x201D; apart from one another is as follows:</p>
<disp-formula id="S3.E1">
<label>(1)</label>
<mml:math id="M1">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">{</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>l</mml:mi>
</mml:mpadded>
<mml:mo>&#x002A;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mpadded>
<mml:mo rspace="5.8pt">+</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>l</mml:mi>
</mml:mpadded>
<mml:mo rspace="5.8pt">&#x002A;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x002A;</mml:mo>
<mml:mi>d</mml:mi>
<mml:mmultiscripts>
<mml:mi>i</mml:mi>
<mml:mprescripts/>
<mml:none/>
<mml:mn>2</mml:mn>
</mml:mmultiscripts>
<mml:mpadded width="+3.3pt">
<mml:mi>f</mml:mi>
</mml:mpadded>
<mml:mpadded width="+3.3pt">
<mml:mi>d</mml:mi>
</mml:mpadded>
<mml:mo>&lt;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>d</mml:mi>
</mml:mpadded>
<mml:mmultiscripts>
<mml:mo>,</mml:mo>
<mml:mprescripts/>
<mml:mn>0</mml:mn>
<mml:none/>
</mml:mmultiscripts>
<mml:mpadded width="+3.3pt">
<mml:mi>l</mml:mi>
</mml:mpadded>
<mml:mo rspace="5.8pt">&#x002A;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mpadded>
<mml:mo>+</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula id="S3.Ex1">
<mml:math id="M2">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo rspace="5.8pt">&#x002A;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo rspace="5.8pt">&#x002A;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>d</mml:mi>
</mml:mpadded>
<mml:mmultiscripts>
<mml:mi>i</mml:mi>
<mml:mprescripts/>
<mml:none/>
<mml:mn>4</mml:mn>
</mml:mmultiscripts>
<mml:mpadded width="+3.3pt">
<mml:mi>f</mml:mi>
</mml:mpadded>
<mml:mpadded width="+3.3pt">
<mml:mi>d</mml:mi>
</mml:mpadded>
<mml:mo>&lt;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>d</mml:mi>
</mml:mpadded>
<mml:msub>
<mml:mi/>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The cost of d<sub>0</sub> is premeditated as follows:</p>
<disp-formula id="S3.E2">
<label>(2)</label>
<mml:math id="M3">
<mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mn>0</mml:mn>
</mml:mpadded>
</mml:mrow>
<mml:mo rspace="5.8pt">=</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mpadded width="+3.3pt">
<mml:mi>e</mml:mi>
</mml:mpadded>
<mml:mo>&#x2062;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>f</mml:mi>
</mml:mpadded>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>e</mml:mi>
</mml:mpadded>
</mml:mrow>
<mml:mo>&#x2062;</mml:mo>
<mml:mpadded width="+3.3pt">
<mml:mi>m</mml:mi>
</mml:mpadded>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
</disp-formula>
<p>E<sub><italic>elec</italic></sub> is the quantity of energy used by the pivot during communication for every bit of data sent and received. The parameter yields energy usage for outdoor transmitting, while the variable yields energy usage for multi-hop communication. The indicator, which would be computed using the equation below, obtains the energy needed by the receiver to obtain data.</p>
<disp-formula id="S3.E3">
<label>(3)</label>
<mml:math id="M4">
<mml:mrow>
<mml:mpadded width="+3.3pt">
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mpadded>
<mml:mo rspace="5.8pt">=</mml:mo>
<mml:mrow>
<mml:mpadded width="+3.3pt">
<mml:mi>l</mml:mi>
</mml:mpadded>
<mml:mo rspace="5.8pt">&#x002A;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The steps in the proposed FCER<sup>2</sup>P methodology are shown in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption><p>FCER<sup>2</sup>P protocol.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g004.tif"/>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption><p>Membership function of remaining energy input variables.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption><p>Membership function of neighbor&#x2018;s quantity input values.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g006.tif"/>
</fig>
</sec>
<sec id="S3.SS3">
<title>3.3. Proposed FCER<sup>2</sup>P</title>
<p>There are two components to the planned FCER<sup>2</sup>P.</p>
<p>Clustering, the use of the fuzzy system for energy-efficient routing.</p>
<p>By using a pre-determined threshold, different types of clustering, and providing a mutual mechanism for sending packet to BS, it minimizes the clusters in smart dust to improve the performance of smart dust. We will examine the proposed FCER<sup>2</sup>P and its operation in the remaining sections of this study. The suggested FCER<sup>2</sup>P has the following properties in general:</p>
<list list-type="simple">
<list-item>
<label>1.</label>
<p>During each round, fuzzy system-based distributed clustering, uneven clustering, and no categorization are used to cut down on power usage and the quantity of control signals sent out.</p>
</list-item>
<list-item>
<label>2.</label>
<p>To determine the optimal node related on leftover energy and wherever it ought to be located directly in clustering, every cluster has a unique set of fuzzy input variables.</p>
</list-item>
<list-item>
<label>3.</label>
<p>Setting a preset cutoff for overall maximum power has been studied as a way to decrease the regularity of header nodes re-clustering.</p>
</list-item>
<list-item>
<label>4.</label>
<p>With such a multi-hop approach, the algorithms choose the best route for communications to go from every header node toward the BS.</p>
</list-item>
</list>
<p>Reduced energy consumption within the sensor network is among the most crucial things to take into account when comparing clustering methods. By consuming less energy, the network&#x2019;s efficiency can be increased. Hence, every node&#x2019;s neighbors count is thought of as an additional fuzzy variable in clustering because the clustering intensity rises as the number of nearby nodes increases. The network&#x2019;s energy usage stays constant when the dispersion inside the cluster&#x2019;s node is symmetrical. The very first cluster is therefore analyzed in cycles 1, 4, and 7, before entire cluster is generated and managed, with leftover energy and neighbor&#x2019;s quantity of every node being observed as fuzzy input variables.</p>
<p>The first cluster&#x2019;s fuzzy system receives input from every node&#x2019;s energy and size of the network. Every node in just this cluster has a chance that ranges from 0 to 1, according to the fuzzy rules connected to it, as shown in <bold>Table 1</bold> and <xref ref-type="fig" rid="F10">Figure 10</xref>. The significance level is also broadcasted by every node over the range of its message after it has been calculated, and the recipient compared it with the values it has obtained from its neighbors.</p>
<p>The CH is indeed the node with the highest priority in its neighborhood range, and to make sure that everyone is aware of its presence, it communicates its condition to each other node within its signal radial distance. Delivering a member connection request, the receiving node contacts the CH node, and if the obtained signal is robust, the receiving node is chosen as a cluster participant. A smart dust node accepts the membership application with the smallest ID number whenever it receives two or more CH notifications. The readers may be curious as to how the primary clustering would indeed be chosen if there were other equally likely candidates, given that clustering is part of the suggested FCER<sup>2</sup>P contents. or &#x201C;Is it feasible that the decisions differ in similar scenarios given that every node chooses autonomously?&#x201D; Take into account that this option is likely when responding to these inquiries. There is no restriction on the node combinations in which an eligible smart dust node broadcasts smart dust CH communication to a neighboring smart dust node if multiple nodes in the vicinity possess the same likelihood of being competitors for CH. The recipient of this message accepts a qualifying node with such a low ID. The node only with a lower allocated ID is selected as the CH out of the aggregate of 107 potential nodes for every node that has the same chance, per the evaluation. To conserve energy, routing methods for WSNs are being developed. Efficiency can be enhanced and the lifespan of the network increased by launching an ideal routing plan and applying the right number of hops dependent on length among nodes as well as BS. Data delivery to the BS is accomplished in this study using a multi-hop approach. This node combines the incoming data in the suggested FCER<sup>2</sup>P by concluding clustering during every round as well as transmitting sensory contextual information to CH. Through the CH node, it sends information in multi-hop toward the BS. Each CH node is picked from the list of CHs based on the ability requirements. The &#x201C;remoteness to BS (D)&#x201D; and &#x201C;outstanding energy (E)&#x201D; of the smart dust node are combined to provide the performance metric (M). These following standards must be met in order to choose a smart dust CH node:</p>
<disp-formula id="S3.E4">
<label>(4)</label>
<mml:math id="M5">
<mml:mrow>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>H</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo rspace="5.8pt" stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo rspace="5.8pt">=</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>H</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mi>E</mml:mi>
</mml:mrow>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>H</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption><p>The output variable&#x2019;s threshold values for a probability in the cluster.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g007.tif"/>
</fig>
<p>The competitiveness radius (R), which must be determined in order to select a head node from the present CHs, is as follows:</p>
<disp-formula id="S3.E5">
<label>(5)</label>
<mml:math id="M6">
<mml:mrow>
<mml:mpadded width="+3.3pt">
<mml:mi>R</mml:mi>
</mml:mpadded>
<mml:mo rspace="5.8pt">=</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mi>H</mml:mi>
<mml:mo>&#x2062;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>For instance, the smart dust CH with the greatest suitability metric is considered CH(i) if CH(j) smart dust nodes and CH(k) smart dust nodes are located inside the competing radius (R) to also be considered CH(i) (i). This technique uses single or multiple routing to transfer information to the BS. Let us say that there are no other CH nodes within the CH node&#x2019;s competition radius (R) that have an appropriate proficiency measure (M) (i). In that situation, the single-hop method informs the BS. The suggested FCER<sup>2</sup>P is depicted as a multi-hop in <xref ref-type="fig" rid="F8">Figure 8</xref>.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption><p>Proposed multi-hop FCER<sup>2</sup>P.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g008.tif"/>
</fig>
</sec>
</sec>
<sec id="S4">
<title>4. Results and discussion</title>
<p>To see if the proposed approach is more scalable in respect of node quantity, node density, and BS placement, it is contrasted to the DSQLRA (<xref ref-type="bibr" rid="B2">2</xref>) and SVPA (<xref ref-type="bibr" rid="B15">15</xref>) methodologies in the same scenarios. The strategies were assessed using the MATLAB program according to the network lifetime measure, which includes the FND, HND, and LND variables in addition to the amount of energy consumed per cycle as well as the quantity of lifeless smart dust nodes every cycle. The work space in this experiment measures 100 &#x00D7; 100 m<sup>2</sup>. All through the ecosystem, 300 smart dust nodes with just an energy difference of 0.5 joules are dispersed arbitrarily. Using only a star topology, the position of BS is beyond the workplace, and the length from the node to BS is 130 miles longer. The outcomes of comparing methods in terms of network lifespan are shown in <xref ref-type="fig" rid="F9">Figure 9</xref>. In respect of FND, HND, and LND, the suggested FCER<sup>2</sup>P performs better than alternative techniques.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption><p>Duration of the network.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g009.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="F10">Figures 10</xref>, <xref ref-type="fig" rid="F11">11</xref>, it seems that sending multi-hop data from each CH toward the BS, as well as reducing the amount of clustering instances, lowers the amount of control alerts given, while maintaining a balanced energy usage and plummeting quantity of lifeless nodes per cycle. Additionally, compared to other algorithms, the effectiveness of the suggested approach is more reliable. Because they use the CH as well as are clustered with different cluster sizes, the DSQLRA and SVPA techniques were chosen and compared to FCER<sup>2</sup>P. In other terms, we made an effort to compare FCER<sup>2</sup>P in a completely fair manner to several new and reliable techniques. The prevention of grouping in every round and the utilization of a cutting-edge routing protocol are among FCER<sup>2</sup>P standout features. The lifetime of the network variables was assessed by taking into account the variety of nodes as well as the position of a BS in the middle of the working environment in order to successfully evaluate FCER<sup>2</sup>P to other approaches. In comparison to other approaches, the results show that FCER<sup>2</sup>P performs the best in terms of lengthening the lifespan of the network. The suggested FCER<sup>2</sup>P has a lifespan of the network of 687, which is a 65% enhancement over the better network lifespan of 417 achieved by other techniques.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption><p>Amount of dead nodes in every cycle.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g010.tif"/>
</fig>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption><p>The quantity of remaining energy in every cycle.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="bijscit-2022-21-g011.tif"/>
</fig>
</sec>
<sec id="S5" sec-type="conclusion">
<title>5. Conclusion</title>
<p>This research concentration is on extending the lifespan of WSNs and energy conservation. Moreover, it aims to minimize the transmission of control signals. In a MATLAB simulation, we applied our suggested clustering-related routing strategy with a preset cutoff and multi-hop propagation. Fuzzy Clustering and Energy Resourceful Routing Protocol (FCER<sup>2</sup>P) applications were tested to determine how well they scaled in terms of smart dust node count, network magnitude, and BS place. The investigation shows that the suggested FCER<sup>2</sup>P technique optimizes the FND, HND, and LND factors; minimizes the number of control packets broadcast; and uses less energy. With a pre-defined threshold, various clustering strategies, multi-hop routing with the right intermediate node, as well as other parameters, the network&#x2019;s lifespan is extended due to the absence of clustering in every round. Network efficiency is enhanced by employing the CH node&#x2019;s peak energy in combination with a pre-determined threshold.</p>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1"><label>1.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gopi</surname> <given-names>B</given-names></name> <name><surname>Logeshwaran</surname> <given-names>J</given-names></name> <name><surname>Kiruthiga</surname> <given-names>T</given-names></name></person-group>. <article-title>An innovation in the development of a mobile radio model for a dual-band transceiver in wireless cellular communication.</article-title> <source><italic>BOHR Int J Comput Intell Commun Netw.</italic></source> (<year>2022</year>) <volume>1</volume>:<fpage>20</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B2"><label>2.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ren</surname> <given-names>P</given-names></name> <name><surname>Zhang</surname> <given-names>R</given-names></name> <name><surname>Luo</surname> <given-names>S</given-names></name></person-group>. <article-title>Multipath route optimization with multiple QoS constraints based on intuitionistic fuzzy set theory.</article-title> <source><italic>Wireless Commun Mobile Comput.</italic></source> (<year>2023</year>) <volume>2023</volume>:<issue>6318433</issue>.</citation></ref>
<ref id="B3"><label>3.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xia</surname> <given-names>D</given-names></name> <name><surname>Jiang</surname> <given-names>C</given-names></name> <name><surname>Wan</surname> <given-names>J</given-names></name> <name><surname>Jin</surname> <given-names>J</given-names></name> <name><surname>Leung</surname> <given-names>VC</given-names></name> <name><surname>Mart&#x00ED;nez-Garc&#x00ED;a</surname> <given-names>M</given-names></name></person-group>. <article-title>Heterogeneous network access and fusion in smart factory: a survey.</article-title> <source><italic>ACM Comput Surv.</italic></source> (<year>2022</year>).</citation></ref>
<ref id="B4"><label>4.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>Q</given-names></name></person-group>. <article-title>Evaluation and research on the logistics efficiency of agricultural products with intuitionistic fuzzy information.</article-title> <source><italic>Int J Knowl Based Intell Eng Syst.</italic></source> (<year>2022</year>) <volume>26</volume>:<fpage>47</fpage>&#x2013;<lpage>52</lpage>.</citation></ref>
<ref id="B5"><label>5.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Srinivasu</surname> <given-names>PN</given-names></name> <name><surname>Ijaz</surname> <given-names>MF</given-names></name> <name><surname>Shafi</surname> <given-names>J</given-names></name> <name><surname>Wozniak</surname> <given-names>M</given-names></name> <name><surname>Sujatha</surname> <given-names>R</given-names></name></person-group>. <article-title>6G driven fast computational networking framework for healthcare applications.</article-title> <source><italic>IEEE Access.</italic></source> (<year>2022</year>) <volume>10</volume>:<fpage>94235</fpage>&#x2013;<lpage>48</lpage>.</citation></ref>
<ref id="B6"><label>6.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>L</given-names></name> <name><surname>Liu</surname> <given-names>Q</given-names></name></person-group>. <article-title>Research on intelligent access of space-AirGround integrated network.</article-title> In: <source><italic>Proceedings of the International Conference on Signal and Information Processing, Networking and Computers.</italic></source> <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2022</year>). <fpage>p. 66</fpage>&#x2013;<lpage>79</lpage>.</citation></ref>
<ref id="B7"><label>7.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gupta</surname> <given-names>N</given-names></name> <name><surname>Maashi</surname> <given-names>MS</given-names></name> <name><surname>Tanwar</surname> <given-names>S</given-names></name> <name><surname>Badotra</surname> <given-names>S</given-names></name> <name><surname>Aljebreen</surname> <given-names>M</given-names></name> <name><surname>Bharany</surname> <given-names>S</given-names></name></person-group>. <article-title>A comparative study of software defined networking controllers using mininet.</article-title> <source><italic>Electronics.</italic></source> (<year>2022</year>) <volume>11</volume>:<issue>2715</issue>.</citation></ref>
<ref id="B8"><label>8.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alipour</surname> <given-names>MA</given-names></name> <name><surname>Ghasemshirazi</surname> <given-names>S</given-names></name> <name><surname>Shirvani</surname> <given-names>G</given-names></name></person-group>. <article-title>Enabling a zero trust architecture in a 5G-enabled smart grid.</article-title> <source><italic>arXiv</italic></source> [<comment>Preprint</comment>]. (<year>2022)</year>. <volume>arXiv</volume>: <issue>2210.01739</issue>.</citation></ref>
<ref id="B9"><label>9.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>Y</given-names></name> <name><surname>Liu</surname> <given-names>J</given-names></name> <name><surname>Huang</surname> <given-names>H</given-names></name> <name><surname>Zhang</surname> <given-names>X</given-names></name> <name><surname>Lei</surname> <given-names>B</given-names></name> <name><surname>Peng</surname> <given-names>J</given-names></name><etal/></person-group> <article-title>Computing power network: a survey.</article-title> <source><italic>arXiv</italic></source> [<comment>Preprint</comment>]. (<year>2022</year>). <volume>arXiv</volume>: <issue>2210.06080.</issue></citation></ref>
<ref id="B10"><label>10.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ramesh</surname> <given-names>G</given-names></name> <name><surname>Logeshwaran</surname> <given-names>J</given-names></name> <name><surname>Aravindarajan</surname> <given-names>V</given-names></name></person-group> <collab>Feny Thachil.</collab> <article-title>Eliminate the interference in 5G ultra-wide band communication antennas in cloud computing networks.</article-title> <source><italic>ICTACT J Microelectron.</italic></source> (<year>2022</year>) <volume>8</volume>:<fpage>1338</fpage>&#x2013;<lpage>44</lpage>.</citation></ref>
<ref id="B11"><label>11.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X</given-names></name></person-group>. <article-title>Design and implementation of heterogeneous data exchange platform based on web technology.</article-title> In: <source><italic>Proceedings of the International Conference on Intelligent Systems, Communications, and Computer Networks (ISCCN 2022)</italic></source>, <publisher-loc>Chengdu</publisher-loc> (<year>2022</year>).</citation></ref>
<ref id="B12"><label>12.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>William</surname> <given-names>P</given-names></name> <name><surname>Yogeesh</surname> <given-names>N</given-names></name> <name><surname>Vimala</surname> <given-names>S</given-names></name> <name><surname>Gite</surname> <given-names>P</given-names></name></person-group>. <article-title>Blockchain technology for data privacy using contract mechanism for 5G networks.</article-title> In: <source><italic>Proceedings of the 2022 3rd International Conference on Intelligent Engineering and Management (ICIEM)</italic></source>, <publisher-loc>London</publisher-loc> (2022). <fpage>p. 461</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B13"><label>13.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Logeshwaran</surname> <given-names>J</given-names></name></person-group>. <article-title>The control and communication management for ultra dense cloud system using fast Fourier algorithm.</article-title> <source><italic>ICTACT J Data Sci Mach Learn.</italic></source> (<year>2022</year>) <volume>3</volume>:<fpage>281</fpage>&#x2013;<lpage>4</lpage>.</citation></ref>
<ref id="B14"><label>14.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siddiqui</surname> <given-names>MUA</given-names></name> <name><surname>Qamar</surname> <given-names>F</given-names></name> <name><surname>Tayyab</surname> <given-names>M</given-names></name> <name><surname>Hindia</surname> <given-names>MN</given-names></name> <name><surname>Nguyen</surname> <given-names>QN</given-names></name> <name><surname>Hassan</surname> <given-names>R</given-names></name></person-group>. <article-title>Mobility management issues and solutions in 5G-and-beyond networks: a comprehensive review.</article-title> <source><italic>Electronics.</italic></source> (<year>2022</year>) <volume>11</volume>: <issue>1366</issue>.</citation></ref>
<ref id="B15"><label>15.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Logeshwaran</surname> <given-names>J</given-names></name> <name><surname>Ramkumar</surname> <given-names>M</given-names></name> <name><surname>Kiruthiga</surname> <given-names>T</given-names></name> <name><surname>Sharan Pravin</surname> <given-names>R</given-names></name></person-group>. <article-title>SVPA &#x2013; The segmentation based visual processing algorithm (SVPA) for illustration enhancements in digital video processing (DVP).</article-title> <source><italic>ICTACT J Image Video Process.</italic></source> (<year>2022</year>) <volume>12</volume>:<fpage>2669</fpage>&#x2013;<lpage>73</lpage>.</citation></ref>
<ref id="B16"><label>16.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>William</surname> <given-names>P</given-names></name> <name><surname>Choubey</surname> <given-names>S</given-names></name> <name><surname>Ramkumar</surname> <given-names>M</given-names></name> <name><surname>Verma</surname> <given-names>A</given-names></name> <name><surname>Vengatesan</surname> <given-names>K</given-names></name> <name><surname>Choubey</surname> <given-names>A</given-names></name></person-group>. <article-title>Implementation of 5G network architecture with interoperability in heterogeneous wireless environment using radio spectrum.</article-title> In: <source><italic>Proceedings of the 2022 International Conference on Electronics and Renewable Systems (ICEARS)</italic></source>, <publisher-loc>Tuticorin</publisher-loc> (2022). <fpage>p. 786</fpage>&#x2013;<lpage>91</lpage>.</citation></ref>
<ref id="B17"><label>17.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Logeshwaran</surname> <given-names>J</given-names></name> <name><surname>Ramkumar</surname> <given-names>M</given-names></name> <name><surname>Kiruthiga</surname> <given-names>T</given-names></name> <name><surname>Sharanpravin</surname> <given-names>R</given-names></name></person-group>. <article-title>The role of integrated structured cabling system (ISCS) for reliable bandwidth optimization in high-speed communication network.</article-title> <source><italic>ICTACT J Commun Technol.</italic></source> (<year>2022</year>) <volume>13</volume>:<fpage>2635</fpage>&#x2013;<lpage>9</lpage>.</citation></ref>
<ref id="B18"><label>18.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vaniprabha</surname> <given-names>A</given-names></name> <name><surname>Logeshwaran</surname> <given-names>J</given-names></name> <name><surname>Kiruthiga</surname> <given-names>T</given-names></name></person-group> <collab>Krishna Bikram Shah</collab>. <article-title>Examination of the effects of long-term COVID-19 impacts on patients with neurological disabilities using a neuro machine learning model.</article-title> <source><italic>BOHR Int J Neurol Neurosci.</italic></source> (<year>2022</year>) <volume>1</volume>:<fpage>21</fpage>&#x2013;<lpage>8</lpage>.</citation></ref>
</ref-list>
</back>
</article>