<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Comprehensive Analysis of Efficiency and Security Challenges in Sensor Network Routing</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nadiia Dovzhenko</string-name>
          <email>nadezhdadovzhenko@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleg Barabash</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nataliia Ausheva</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yevhen Ivanichenko</string-name>
          <email>y.ivanichenko@kubg.edu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergiy Obushnyi</string-name>
          <email>s.obushnyi@kubg.edu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Borys Grinchenko Kyiv University</institution>
          ,
          <addr-line>18/2 Bulvarno-Kudriavska str., Kyiv, 04053</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute</institution>
          ,”
          <addr-line>37 Peremogy ave., Kyiv, 03056</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>275</fpage>
      <lpage>280</lpage>
      <abstract>
        <p>The use of new wireless technologies not only enhances the economic development of countries worldwide but also improves the quality of life for ordinary citizens. This improvement is particularly noticeable in the realm of wireless IoT/IIoT technologies. Sensor networks have also reached a stage of rapid development. Today, there is no doubt about the advantages of utilizing hundreds of sensors. The widespread connection of sensors allows us to address a wide range of issues, from monitoring the environment (forest fires, assessing climate shifts, soil pollution, and carbon dioxide levels) to enhancing law enforcement by strengthening protection against potential terrorist threats. It also helps improve traffic management and road congestion in urban areas, as well as healthcare and more. Simultaneously, the use of sensors addresses a series of issues related to information security. Today, data confidentiality and security are pivotal concerns in the context of IoT and sensor networks. To ensure an adequate level of protection for sensor network ecosystems, it is essential not only to analyze risks but also to influence the development and enhancement of approaches.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Network</kwd>
        <kwd>sensor</kwd>
        <kwd>nodes</kwd>
        <kwd>protection</kwd>
        <kwd>security</kwd>
        <kwd>attacks</kwd>
        <kwd>functional stability</kwd>
        <kwd>flooding</kwd>
        <kwd>method</kwd>
        <kwd>routing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The use of new wireless technologies not only
enhances the economic development of
countries worldwide but also improves the
quality of life for ordinary citizens. This
improvement is particularly noticeable in the
realm of wireless IoT/IIoT technologies.
Sensor networks have also reached a stage of
rapid development [1].</p>
      <p>Today, there is no doubt about the
advantages of utilizing hundreds of sensors.
The widespread connection of sensors allows
us to address a wide range of issues, from
monitoring the environment (forest fires,
assessing climate shifts, soil pollution, and
carbon dioxide levels) to enhancing law
enforcement by strengthening protection
against potential terrorist threats. It also helps
improve traffic management and road
congestion in urban areas, as well as
healthcare and more [2–3].</p>
      <p>Simultaneously, the use of sensors addresses
a series of issues related to information security.
Today, data confidentiality and security are
pivotal concerns in the context of IoT and sensor
networks. To ensure an adequate level of
protection for sensor network ecosystems, it is
essential not only to analyze risks but also to
influence the development and enhancement of
approaches [4].</p>
    </sec>
    <sec id="sec-2">
      <title>2. Main Part</title>
      <p>Traditionally, components of sensor networks
have been considered for implementation in
high-performance radiation and nuclear threat
detection systems, such as sensors for
reconnaissance and surveillance systems,
radio communication control systems, medical
applications, seismic monitoring, and more.
Sensor network nodes can monitor events in
the surrounding environment, even in places
where human presence is dangerous or
unlikely, while also exchanging information
with neighboring nodes.</p>
      <p>
        Often, these nodes perform certain
standard computations based on the acquired
information. This has been brought about by
the convergence of networks, wireless
communications, and the rapid advancement
of information technologies. Special attention
should also be given to the hardware of
sensors, the decreasing costs of processors,
sensor miniaturization, and the low power
requirements of radio module components. All
of these processes and features have placed
sensor networks on the cusp of a potential
development era [
        <xref ref-type="bibr" rid="ref2">5</xref>
        ].
      </p>
      <p>However, the question of safeguarding
sensitive, confidential data exchanged
between sensor network nodes is becoming
increasingly critical.</p>
      <p>Sensor network nodes collect and initially
process data arrays. The next step is to
transmit the data to control nodes, main hubs,
or a server using wired or wireless
connections. At this stage, the primary task for
a sensor network component is to select an
optimal route for transmitting processed data.</p>
      <p>When it comes to sensors sensitive to the
data they receive (e.g., streaming audio/video
in UAV applications), the choice of data
transmission route becomes critical in terms of
network connectivity. Specific criteria need to
be considered. For instance, previously chosen
optimal routes may be inefficient for streaming
audio/video or might become overloaded
when participating in data transfer among
other nodes.</p>
      <p>
        Connectivity is closely related to the
concepts of resilience and fault tolerance for
both individual components and the entire
sensor network. It refers to the network’s
ability to adapt to new changes, configurations,
and scaling. Therefore, there is a need not only
to predict the traffic transmitted between
sensor network nodes but also to address
routing issues. This aspect is often of interest
to malicious actors as it is one of the vulnerable
points [
        <xref ref-type="bibr" rid="ref3">6</xref>
        ].
      </p>
      <p>For sensor networks that operate based on
self-organizing algorithms, there are
significant information security risks. These
risks can be realized through various means,
such as Denial of Service (DoS) attacks
targeting the disruption of legitimate routing
algorithms and information transmission.</p>
      <p>DoS attacks pose a serious threat to sensor
network components, primarily targeting the
communication channel with malicious traffic.
These attacks can be categorized into two
types: attacks disrupting routing algorithms
and attacks aimed at exhausting the resources
of network nodes.</p>
      <p>The first type of attack results in the routing
protocol behaving incorrectly, failing to
perform its functions, and negatively
impacting neighboring nodes. This impact is
challenging to assess until there are collisions
or substantial data loss. It may go unnoticed
until the wireless segment of the network
stops responding to requests.</p>
      <p>The second type of attack is based on a
different principle. It involves gradually
increasing the consumption of resources, both
at individual nodes and within the entire
network segment. This can also lead to a rapid
increase in bandwidth and negatively affect the
energy potential of the nodes.</p>
      <p>Examples of such attacks include:
• Hello Flood Attack. In this attack, a node
starts broadcasting broadcast requests
(or any similar essential information)
with a certain power level, notifying all
surrounding nodes of its presence.
According to the concept of a sensor
network, other neighboring nodes begin
to participate in relaying messages,
including adding a new node that
transmits a powerful signal. The
connectivity algorithm triggers, and
once the new node starts receiving data
packets from neighboring nodes, the
transmission stops. Nodes continue
transmitting packets with service
information, inquiring about the success
of the transmission. However, the
network segment essentially becomes
dysfunctional.
• Falsification, Modification, or Illegitimate
Message Duplication. The main idea is to
introduce altered messages into a
specific network segment by a rogue
node, disrupting the routing process and
eventually rendering the entire network
segment inoperative.
• Routing Loop Attack. Routing loops are a
well-known concept in networks.
However, the appearance of this attack
in wireless networks is problematic as it
not only leads to data loss but also
disconnects entire network segments. A
malicious node creates a situation where
the internal resources of the sensor
begin to deplete, and data packets are no
longer transmitted to neighboring nodes
as required by the routing algorithm.
Instead, they are transmitted among
multiple adjacent nodes, rapidly
impacting bandwidth and critically
affecting the network’s resilience and
fault tolerance.
• Wormhole Attack. In this attack, a
malicious node intercepts packets at any
point in a network segment and redirects
them to another rogue node located in a
different network segment. Packet
transmission occurs through several
nodes, causing their gradual congestion.
Additionally, the transmission process is
organized bidirectionally. Therefore, all
nodes participating in transmission will
perceive malicious nodes as neighbors,
expending their resources on illegitimate
traffic, which affects the network’s
reliability and resilience.
• Detour Attack. A malicious node
attempts to reroute legitimate traffic
packets between legitimate nodes along
a specific route, often an unoptimized
path through the most unfavorable
segments of the network, leading to
increased packet hops and causing data
loss and delays due to increased
processing time. The malicious node
may also add virtual nodes to the
primary route, making the verified,
optimal route redundant.
(1)
These attacks pose significant challenges in
terms of ensuring the security and stability of
sensor networks.</p>
      <p>
        To detect anomalies among nodes in a
sensor network that would lead to the
localization of not only harmful traffic but also
malicious nodes, it’s essential to identify a set
of indicators that receive significant attention.
These indicators include packet transmission
delay, overhead costs of routing algorithms,
and the network’s lifetime [
        <xref ref-type="bibr" rid="ref4">7</xref>
        ].
      </p>
      <p>Packet Transmission Delay. The delay in
packet transmission depends on time delays,
the number of hops between nodes, and the
actual length of the path between the sender
and receiver. By significantly reducing the
delay in packet transmission between nodes,
the overall end-to-end delay is also reduced,
decreasing the likelihood of implementing
malicious nodes or traffic.</p>
      <p>While traditional packet transmission
approaches in networks choose an optimal
route, possibly minimizing delay, it is
worthwhile to reduce the transmission delay
by sending packets to the first available node
among neighbors. This improves the overall
routing metric and is calculated using the
formula:</p>
      <p>=</p>
      <p>+ ⋯ +   
where  is node,   is sender,   is sender’s
frequency,   is receiver node’s frequency.</p>
      <p>Essentially, after the activation of a sender
node with a certain standard frequency, it has
equal rights (probability) to choose a
neighboring node to establish a
communication session.</p>
      <p>This ensures that the set of possible
neighboring elements for connection is strictly
regulated to plan routes more carefully and
avoid packet wandering, reducing the
performance impact due to redirection delays.</p>
      <p>
        Too few alternative neighboring nodes can
lead to shorter paths and an increase in
redirection delays (deterministic routing),
resulting in security gaps and vulnerabilities [
        <xref ref-type="bibr" rid="ref5">8</xref>
        ].
      </p>
      <p>Overhead Costs of Routing Algorithms. In
conventional networks, the costs associated
with routing usually don’t affect the network’s
resilience and fault tolerance, making it less of
a problem. However, when calculating the
number of nodes in a wireless sensor network,
connectivity, and optimal route algorithms, the</p>
      <p>This approach is referred to as the node’s
working cycle and is calculated as follows:
where T is duration,  is node’s activity period.</p>
      <p>The activity period can be calculated by
inverting the activity frequency с:</p>
      <p>
        For example, assuming a node is active for 5
ms every 200 ms (T = 5 ms, a = 200 ms, c = 5
Hz), this results in a working cycle OC = 0.025
(Fig. 1, Table 1).
issue of overhead
costs
becomes
more
significant. As nodes form a certain routing
structure, considerations about the energy
efficiency of network components [
        <xref ref-type="bibr" rid="ref6">9</xref>
        ], the
bandwidth
between
them
[
        <xref ref-type="bibr" rid="ref7">10</xref>
        ], and
the
features of further amortization during scaling
are projected from the design stage.
      </p>
      <p>Unfortunately, it’s challenging to predict all
real-world conditions and negative factors in
practice. Even if nodes physically do not
change
their
location,
the
topology
continuously changes due to variations in
connection
quality,
connections,
sensor
influence, and interference.</p>
      <p>If a specific network segment undergoes
regular changes due to these characteristics,
network components require constant updates
of routing algorithms.</p>
      <p>Overhead costs include memory bytes for
storing received or initial data processing and
defining the node’s wakeup frequency. With
slow</p>
      <p>route updates or disregarding these
features, nodes and their nearest neighbors
can eventually come under the scrutiny of
malicious actors or hackers, and their routes
will be compromised.</p>
      <p>Network Lifetime. This metric is defined as
the time for the complete energy consumption
cycle of the first network node.</p>
      <p>It is considered an important metric for
real-time deployment and essentially depends
on the battery capacity of the nodes and the
average energy consumption of a node that will
consume resources primarily.</p>
      <p>
        To achieve this, it is beneficial to reduce the
level of maximum energy consumption among
all
sensor
network
nodes
by
partially
transitioning them to sleep mode and active
mode accordingly [
        <xref ref-type="bibr" rid="ref8">11</xref>
        ].
      </p>
      <p>Nodes</p>
      <p>within the receiver’s range can
transmit messages without any delay, thus
saving energy resources.</p>
      <p>To</p>
      <p>
        maintain a stable and high level of
energy efficiency in wireless sensor networks,
it’s necessary to consider an approach in which
time intervals can be avoided or replaced
during continuous updates of data about
neighboring nodes, as required by routing
protocols [
        <xref ref-type="bibr" rid="ref9">12</xref>
        ].
      </p>
      <p>For instance, to choose the best route for
sending packets to nodes, an updated list of
routing metrics for neighboring components is
essential.
(2)
(3)
(4)
0.5
0.45
0.4
0.35
0.3
Having such a working cycle means that the
node is active for 2.5% of the time.</p>
      <p>Comparing it to a node that is active for 100
ms every second (T = 100 ms, a = 1000 ms,
c = 1 Hz, OC = 0.1), the first node’s lifetime is
four times longer than the latter’s, even though
it is active five times more often (Fig. 2).</p>
      <p>As this
example
demonstrates, energy
efficiency is a delicate balance between  and
0.45
0.4
parameters  = 1 and  =  , is defined as:
 ~  (1,  ).
 [ ] = 1+
 [ ] =  .
number of neighbors  , the expected duration
of the interaction phase can be calculated as
follows:</p>
      <p>The modeling of the amplification factor M
in comparison to unicast transmission is
calculated as:
 =
 [ ]
 [ ]
=</p>
      <p>1 +  
2
=</p>
      <p>2
1 + 
.</p>
      <p>Taking into account that the interaction
time in unicast transmission  [ ] equals 
/2,
with the presence of 100 nodes in a network
segment, the expected interaction and packet
transmission time will be 50 times less than
when using unicast transmission between
neighboring nodes.</p>
      <p>The results of the calculations using this
approach</p>
      <p>with varying numbers of nodes
ranging from 0 to 100 are shown in Fig. 3.</p>
      <p>N, nodes
proposed approach with varying numbers of
nodes ranging from 0 to 100 nodes
These calculations are approximate as they do
not consider possible collisions, which could
delay the detection of the first node.</p>
      <p>In the event of anomalies occurring, the
value of 
only
the
will rapidly fluctuate, allowing not
adjustment
of
data
packet
transmission
but also the localization
of
negative factors or the actions of a malicious
actor.</p>
      <sec id="sec-2-1">
        <title>Network</title>
      </sec>
      <sec id="sec-2-2">
        <title>Functioning under the</title>
      </sec>
      <sec id="sec-2-3">
        <title>Redistribution</title>
      </sec>
      <sec id="sec-2-4">
        <title>Condition of Requests between</title>
      </sec>
      <sec id="sec-2-5">
        <title>Providing</title>
      </sec>
      <sec id="sec-2-6">
        <title>Nodes, in in:</title>
      </sec>
      <sec id="sec-2-7">
        <title>Cybersecurity</title>
      </sec>
      <sec id="sec-2-8">
        <title>Information and Telecommunication Systems vol. 3421 (2023) 278–283.</title>
        <p>V. Sokolov, et al., Method for Increasing
the Various Sources Data Consistency for
IoT Sensors, in: IEEE 9th International</p>
      </sec>
      <sec id="sec-2-9">
        <title>Conference</title>
      </sec>
      <sec id="sec-2-10">
        <title>Infocommunications, on</title>
      </sec>
      <sec id="sec-2-11">
        <title>Problems</title>
      </sec>
      <sec id="sec-2-12">
        <title>Science</title>
        <p>of
and
Technology (PICST) (2023) 522–526.
doi:10.1109/PICST57299.2022.10238518.
M. TajDini, et al., Wireless Sensors for</p>
      </sec>
      <sec id="sec-2-13">
        <title>Brain</title>
        <p>9(12),</p>
        <p>Activity—A Survey, Electronics
iss.</p>
        <p>2092
(2020)
1–26.
doi:10.3390/electronics9122092.</p>
      </sec>
      <sec id="sec-2-14">
        <title>S. Dovgiy,</title>
      </sec>
      <sec id="sec-2-15">
        <title>Architectures</title>
      </sec>
      <sec id="sec-2-16">
        <title>O. Kopiika, for the</title>
      </sec>
      <sec id="sec-2-17">
        <title>O. Kozlov,</title>
      </sec>
      <sec id="sec-2-18">
        <title>Information</title>
      </sec>
      <sec id="sec-2-19">
        <title>Systems,</title>
      </sec>
      <sec id="sec-2-20">
        <title>Network</title>
      </sec>
      <sec id="sec-2-21">
        <title>Providing</title>
      </sec>
      <sec id="sec-2-22">
        <title>Network</title>
      </sec>
      <sec id="sec-2-23">
        <title>Resources</title>
      </sec>
      <sec id="sec-2-24">
        <title>Services,</title>
      </sec>
      <sec id="sec-2-25">
        <title>Cybersecurity in</title>
      </sec>
      <sec id="sec-2-26">
        <title>Information</title>
        <p>and
and
Telecommunication Systems II vol.3187</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>N.</given-names>
            <surname>Dovzhenko</surname>
          </string-name>
          , et al.,
          <source>Method of Sensor [2] [3]</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bondarchuk</surname>
          </string-name>
          , et al.,
          <article-title>The Research of Problems of the Information Algorithm Functioning in the Presence of Preserved Nodes in Wireless Sensor Networks</article-title>
          ,
          <source>Cybersecur. Educ. Sci. Tech</source>
          .
          <volume>4</volume>
          (
          <issue>4</issue>
          ) (
          <year>2019</year>
          )
          <fpage>54</fpage>
          -
          <lpage>61</lpage>
          . doi:
          <volume>10</volume>
          .28925/
          <fpage>2663</fpage>
          -
          <lpage>4023</lpage>
          .
          <year>2019</year>
          .
          <volume>4</volume>
          .5461.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Dovzhenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kyrychok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Brzhevska</surname>
          </string-name>
          ,
          <article-title>The Construction of the Data Routing System for Wireless Sensor Nework on the Basis of Flooding Concept, Modern Inf</article-title>
          .
          <source>Secur</source>
          .
          <volume>4</volume>
          (
          <issue>36</issue>
          ) (
          <year>2018</year>
          )
          <fpage>17</fpage>
          -
          <lpage>21</lpage>
          . doi:
          <volume>10</volume>
          .31673/
          <fpage>2409</fpage>
          -
          <lpage>7292</lpage>
          .
          <year>2018</year>
          .
          <volume>041216</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>I.</given-names>
            <surname>Kuzminykh</surname>
          </string-name>
          , et al.,
          <article-title>Investigation of the IoT Device Lifetime with Secure Data Transmission, Internet of Things, Smart Spaces, and Next Generation Networks and Systems</article-title>
          , vol.
          <volume>11660</volume>
          (
          <year>2019</year>
          )
          <fpage>16</fpage>
          -
          <lpage>27</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -30859-
          <issue>9</issue>
          _
          <fpage>2</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kasirajan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Larsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jagannathan</surname>
          </string-name>
          ,
          <article-title>A New Data Aggregation Scheme Via Adaptive Compression for Wireless Sensor Networks, ACM Transactions on Sensor Networks (TOSN) 9(1) (</article-title>
          <year>2012</year>
          ).
          <fpage>1</fpage>
          -
          <lpage>26</lpage>
          . doi:
          <volume>10</volume>
          .1145/2379799.2379804.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [9]
          <string-name>
            <surname>100</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Buriachok</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Sokolov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <article-title>Security Rating Metrics for Distributed Wireless Systems</article-title>
          ,
          <source>in: Workshop of the 8th International Conference on "Mathematics. Information Technologies. Education": Modern Machine Learning Technologies and Data Science</source>
          , vol.
          <volume>2386</volume>
          (
          <year>2019</year>
          )
          <fpage>222</fpage>
          -
          <lpage>233</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [10] 101
          <string-name>
            <given-names>Z.</given-names>
            <surname>Hu</surname>
          </string-name>
          , et al.,
          <source>Bandwidth Research of Wireless IoT Switches, in: IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering</source>
          (
          <year>2020</year>
          ). doi:
          <volume>10</volume>
          .1109/tcset49122.
          <year>2020</year>
          .
          <volume>2354922</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkman</surname>
          </string-name>
          , et al.,
          <article-title>The Intelligent Control System for Infocommunication Networks</article-title>
          ,
          <source>Int. J. Emerg. Trends Eng. Res</source>
          .
          <volume>8</volume>
          (
          <issue>5</issue>
          ) (
          <year>2020</year>
          )
          <fpage>1920</fpage>
          -
          <lpage>1925</lpage>
          . doi:
          <volume>10</volume>
          .30534/ijeter/2020/73852020.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L.</given-names>
            <surname>Globa</surname>
          </string-name>
          , et al.,
          <article-title>Approach to Uniform Platform Development for the Ecology Digital Environment of Ukraine, Prog</article-title>
          . Adv. Inf. Commun. Technol. Syst. (
          <year>2022</year>
          )
          <fpage>83</fpage>
          -
          <lpage>100</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>