<?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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</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">60973</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.060973</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Quantum Inspired Adaptive Resource Management Algorithm for Scalable and Energy Efficient Fog Computing in Internet of Things (IoT)</article-title>
<alt-title alt-title-type="left-running-head">Quantum Inspired Adaptive Resource Management Algorithm for Scalable and Energy Efficient Fog Computing in Internet of Things (IoT)</alt-title>
<alt-title alt-title-type="right-running-head">Quantum Inspired Adaptive Resource Management Algorithm for Scalable and Energy Efficient Fog Computing in Internet of Things (IoT)</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Khan</surname><given-names>Sonia</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Younas</surname><given-names>Naqash</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>Alhussein</surname><given-names>Musaed</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>Khan</surname><given-names>Wahib Jamal</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-5" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Anwar</surname><given-names>Muhammad Shahid</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><email>shahidanwar786@gachon.ac.kr</email></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Aurangzeb</surname><given-names>Khursheed</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Youth Office Haripur, Directorate of Youth Affairs, Government of Khyber Pakhtunkhwa</institution>, <addr-line>Haripur, 22620</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Software Engineering, Dalian University of Technology, Ganjingzi District</institution>, <addr-line>Dalian, 116024</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Engineering, College of Computer and Information Sciences, King Saud University</institution>, <addr-line>Riyadh, 11543</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of AI and Software, Gachon University</institution>, <addr-line>Seongnam-si, 13120, Republic of Korea</addr-line></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Muhammad Shahid Anwar. Email: <email>shahidanwar786@gachon.ac.kr</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>03</day>
<month>03</month>
<year>2025</year></pub-date>
<volume>142</volume>
<issue>3</issue>
<fpage>2641</fpage>
<lpage>2660</lpage>
<history>
<date date-type="received">
<day>13</day>
<month>11</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>2</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_CMES_60973.pdf"></self-uri>
<abstract>
<p>Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks. However, existing methods often fail in dynamic and high-demand environments, leading to resource bottlenecks and increased energy consumption. This study aims to address these limitations by proposing the Quantum Inspired Adaptive Resource Management (QIARM) model, which introduces novel algorithms inspired by quantum principles for enhanced resource allocation. QIARM employs a quantum superposition-inspired technique for multi-state resource representation and an adaptive learning component to adjust resources in real time dynamically. In addition, an energy-aware scheduling module minimizes power consumption by selecting optimal configurations based on energy metrics. The simulation was carried out in a 360-minute environment with eight distinct scenarios. This study introduces a novel quantum-inspired resource management framework that achieves up to 98% task offload success and reduces energy consumption by 20%, addressing critical challenges of scalability and efficiency in dynamic fog computing environments.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Quantum computing</kwd>
<kwd>resource management</kwd>
<kwd>energy efficiency</kwd>
<kwd>fog computing</kwd>
<kwd>Internet of Things</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>King Saud University, Riyadh, Saudi Arabia</funding-source>
<award-id>RSPD2025R947</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The exponential growth of the Internet of Things (IoT) has revolutionized the digital domain, allowing interconnected devices to share and process data with unprecedented efficiency [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. Along with the growth in IoT devices, the demand for powerful and decentralized data processing solutions has led to the adoption of fog computing [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. Unlike traditional cloud computing [<xref ref-type="bibr" rid="ref-5">5</xref>], it operates at the edge of a network [<xref ref-type="bibr" rid="ref-6">6</xref>], providing localized processing, storage, and control services to reduce latency and therefore improve real-time response [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>]. This paradigm faces many challenges because, in general, fog nodes are resource-restricted compared to centralized cloud servers [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. Most existing methods suffer from a lack of scalability [<xref ref-type="bibr" rid="ref-11">11</xref>], as the dense volume and diversity of IoT devices can rapidly overwhelm processing resources [<xref ref-type="bibr" rid="ref-12">12</xref>]. In addition, most models include machine learning and deep learning algorithms that are computationally intensive and thus may impede real-time responsiveness [<xref ref-type="bibr" rid="ref-13">13</xref>,<xref ref-type="bibr" rid="ref-14">14</xref>]. Energy efficiency is another major concern because most existing models do not balance processing needs with power limitations of edge devices [<xref ref-type="bibr" rid="ref-15">15</xref>]. With these challenges, the need for innovation in resource management techniques that can dynamically adapt to real-time demand is felt without the expense of unnecessary computational and energy overhead [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>].</p>
<p>This work is motivated by the development of a framework for resource management to address the limitations found in existing approaches. Although useful, current methods often suffer from a general lack of flexibility and efficiency in providing scalable and sustainable IoT fog ecosystems [<xref ref-type="bibr" rid="ref-18">18</xref>]. This research aims to fill this gap by proposing a new quantum-inspired resource management algorithm [<xref ref-type="bibr" rid="ref-19">19</xref>], able to work within the limit of limited computing resources and energy availability. The central problem lies in achieving adaptive, energy-efficient resource allocation that aligns with the dynamic demands of real-time IoT applications [<xref ref-type="bibr" rid="ref-20">20</xref>]. Therefore, this study poses the following research question: How can a quantum-inspired adaptive resource management (QIARM) algorithm enhance scalability, energy efficiency, and adaptability in fog computing environments?</p>
<p>The proposed approach integrates principles from quantum computing, particularly quantum superposition, and entanglement for resource management in fog computing, as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The proposed algorithm incorporates a quantum-inspired data structure that enables the simultaneous representation of multiple states of resource allocation. By simulating superposition, QIARM parallelly explores possible allocations and is thus much faster in its decisions. In addition, it proposes an entanglement-inspired mechanism to enable effective resource coordination, which simultaneously synchronizes the resource status of distributed fog nodes to mitigate redundant allocation and latency issues. In addition to this, QIARM includes an adaptive learning part that adjusts the strategies for allocation at runtime, according to network dynamics, and strikes a proper trade-off between performance and energy efficiency. Then, the integrated energy-aware scheduling model will ensure minimum consumption of power by favoring low-energy resource states with no sacrifice of computational effectiveness. The main contributions of this research study can be summarized as follows:</p>
<p><list list-type="bullet">
<list-item>
<p>The proposed algorithm introduces a novel data structure inspired by quantum superposition that enables simultaneous consideration of multiple resource states.</p></list-item>
<list-item>
<p>A mechanism synchronizes allocation across the nodes and is very effective in terms of not allowing redundancy of resources, which in turn has a positive impact on the latency performance of a multi-node fog system. The approach also builds on an entanglement-inspired model for coordinating resource management across distributed fog nodes.</p></list-item>
<list-item>
<p>QIARM integrates a unique and energy-conscious scheduling component that continuously monitors resource demand and adapts allocation strategies to minimize power consumption. This feature is particularly beneficial for IoT-fog environments where energy resources are limited, providing sustainable operational efficiency.</p></list-item>
</list></p>

<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The overview of the proposed QIARM approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-1.tif"/>
</fig>
<p>The structure of this article can be summarized as follows: <xref ref-type="sec" rid="s2">Section 2</xref> reviews existing approaches to resource management to identify relevant research gaps. <xref ref-type="sec" rid="s3">Section 3</xref> introduces the Quantum Inspired Adaptive Resource Management (QIARM) approach, detailing its core components and methodology. <xref ref-type="sec" rid="s4">Section 4</xref> presents the experimental setup and simulation results to evaluate the QIARM performance. <xref ref-type="sec" rid="s6">Section 6</xref> provides a discussion of the results and their implications. Finally, <xref ref-type="sec" rid="s7">Section 7</xref> concludes the article.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>The rapid proliferation of IoT devices has significantly increased the demand for resource-efficient computing and real-time data processing capabilities. Fog computing, which allows computation at the edge of the network, has emerged as a solution to address latency and bandwidth constraints in IoT environments [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. Recent research has focused on developing efficient and adaptive resource management strategies to optimize performance and ensure responsiveness under varying conditions [<xref ref-type="bibr" rid="ref-23">23</xref>,<xref ref-type="bibr" rid="ref-24">24</xref>]. In fog computing environments, task offloading and resource allocation have become central to reducing delays and improving the quality of service for IoT applications [<xref ref-type="bibr" rid="ref-25">25</xref>,<xref ref-type="bibr" rid="ref-26">26</xref>]. Advanced resource management techniques have been proposed to address specific requirements, such as network splitting in 5G and 6G systems [<xref ref-type="bibr" rid="ref-27">27</xref>,<xref ref-type="bibr" rid="ref-28">28</xref>], retransmission strategies in the Long Range Wide Area Network (LoRaWAN) [<xref ref-type="bibr" rid="ref-29">29</xref>], and adaptive management of greenhouse environments [<xref ref-type="bibr" rid="ref-30">30</xref>].</p>
<p>Various approaches to resource management leverage machine learning and deep learning techniques to handle the complexities of IoT networks. For example, lightweight frameworks for distributed computing aim to balance computational load across IoT nodes, effectively managing resource constraints [<xref ref-type="bibr" rid="ref-31">31</xref>]. In addition to classifier systems, fog-cloud hybrid models have also been introduced to improve resource utilization by making intelligent decisions in distributed environments [<xref ref-type="bibr" rid="ref-32">32</xref>]. In Industrial IoT, dual-driven models have been presented based on reinforcement learning to improve sustainable computing [<xref ref-type="bibr" rid="ref-33">33</xref>]. Digital twin and blockchain-supported environments have also been suggested [<xref ref-type="bibr" rid="ref-34">34</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>]. Furthermore, reinforcement learning has been used to enable resource management for deep neural network inference and improve computational efficiency in IoT networks where real-time analytics plays a key role [<xref ref-type="bibr" rid="ref-36">36</xref>].</p>
<p>Novel adaptive frameworks in IoT are still emerging that will include predictive maintenance and prioritization of resources to improve the reliability of the service and reduce any interruption to it [<xref ref-type="bibr" rid="ref-37">37</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. This has been achieved in resource management on mobile edge computing using a priority mechanism to optimize resource allocation and achieve low latency for mobile users [<xref ref-type="bibr" rid="ref-26">26</xref>]. Pervasive edge computing models have also been popular, especially for applications that require very high data transmission rates, including VR streaming wirelessly in industrial IoT applications [<xref ref-type="bibr" rid="ref-39">39</xref>]. However, it has yet to be overcome concerning developing a scalable, adaptable, and energy-efficient resource management framework that can cope with the fluctuating demands of real-time IoT applications.</p>
<p>Another key limitation of existing resource management strategies is that they cannot respond appropriately to rapid changes in network load and availability, as reflected in predictive maintenance and priority-based models for mobile edge environments [<xref ref-type="bibr" rid="ref-26">26</xref>,<xref ref-type="bibr" rid="ref-37">37</xref>]. These models also do not consider any coordination mechanisms required by applications for sharing resources at different nodes, which is typical of latency-sensitive applications such as virtual reality streaming in industrial IoT [<xref ref-type="bibr" rid="ref-39">39</xref>]. The proposed QIARM approach aims to address challenges by introducing quantum-inspired resource representation and entanglement-like coordination mechanisms for runtime adjustments of resources. This allows QIARM to represent multiple states of allocation in superposition, leading to searching larger solution spaces while reducing computational overhead and deploying faster resource allocations. Furthermore, the energy-aware scheduling of QIARM optimizes energy consumption by adapting the allocation according to run-time conditions, which is not supported by state-of-the-art models. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> summarizes the key limitations in existing methods and underlines how the proposed approach is addressing these challenges.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Comparison of the existing approaches limitations, challenges, and QIARM solutions</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-2.tif"/>
</fig>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed QIARM Approach</title>
<p>Quantum-inspired adaptive Resource Management switches on quite a new conceptual framework toward optimized resource allocation in fog computing environments. Featuring quantum-inspired superposition and entanglement, QIARM dynamically coordinates the distributed resources over time to make it adaptive with low latency and energy efficiency. This allows for addressing scalability challenges and enables real-time responsiveness uniquely for IoT applications over resource-constrained networks.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Workflow of the Proposed QIARM Approach</title>
<p>The QIARM approach is designed for efficient and adaptive resource allocation in dynamic fog computing environments. Comprising three major phases, each is tailored for managing resources at different levels: initialization, real-time adaptation, and real-time adaptation forming a holistic and responsive framework. The workflow of the QIARM approach is represented in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, which depicts an end-to-end process to initialize, allocate, and dynamically adapt resources across fog nodes.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Workflow of the QIARM approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-3.tif"/>
</fig>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Initialization Phase</title>
<p>The Initialization Phase sets up the QIARM framework by defining and configuring the resource states across all fog nodes. This is achieved by providing quantum-inspired representations of resources, whereby each node initializes a state from the available computing, storage, and energy resources. Due to the superposition principles, multiple configurations of resources can be represented at once, forming a large set of possible states with no extra computation.</p>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Resource Allocation Phase</title>
<p>After initialization has taken place, the actual assignment of the resources is carried out by the resource allocation phase. The superposition and entanglement-inspired models enable consideration of resource states at nodes in a parallel process viewed to be emulating the simultaneous exploration of many options regarding the allocation of resources. Therefore, superposition allows the system to analyze in parallel several possible allocations to establish those configurations that will yield maximum efficiency. Entanglement-inspired mechanisms are used to coordinate resources across nodes, ensuring that distributed resources are indeed effectively synchronized.</p>
</sec>
<sec id="s3_1_3">
<label>3.1.3</label>
<title>Adaptive Adjustment Phase</title>
<p>The Adaptive Adjustment Phase introduces a continuous monitoring mechanism based on feedback that determines the adaptation in real-time concerning the resource requirements that are constantly changing. Monitoring in this phase will include tracking network conditions, usage patterns, and computational loads by adjusting resource allocation in real-time to receive real-time feedback. Upon detecting shifted demands, QIARM&#x2019;s adaptive learning module will reassess the state of the resources and reconfigure them to meet existing needs on the network.</p>
</sec>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>System Model</title>
<p>In the proposed QIARM system, the quantum-inspired approach is emphasized, uniquely aligning resource allocation strategies with real-time network conditions. In Algorithm 1, QIARM workflow is outlined, detailing the initialization of resource states, the entanglement-inspired resource allocation process, and the adaptive adjustments to maintain balanced load distribution across fog nodes in real-time.</p>
<fig id="fig-8">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-8.tif"/>
</fig>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Objective Function</title>
<p>The overarching goal of the proposed QIARM model is to optimize resource allocation by balancing latency, energy efficiency, and task offloading success rate. This is achieved by minimizing the objective function <italic>J</italic>, defined as:
<disp-formula id="ueqn-1"><mml:math id="mml-ueqn-1" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>J</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>E</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>S</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Here, <italic>L</italic>, <italic>E</italic>, and <italic>S</italic> represent latency (ms), energy consumption (kWh) and task success rate (%), respectively. The weighting factors <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula> allow prioritizing specific metrics, such that <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. These weights can be tuned according to the application requirements to emphasize particular objectives, such as energy efficiency for green IoT systems or low latency for real-time applications.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Fog Computing Environment</title>
<p>The fog computing environment consists of a set of <italic>N</italic> IoT devices, <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula>, each generating variable workloads, and a set of <italic>M</italic> fog nodes, <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula>, capable of executing tasks with limited resources. Each fog node <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mo stretchy="false">(</mml:mo><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>M</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> has computational capacity <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, memory capacity <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, and energy restriction <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>E</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>. To model resource types across fog nodes, let <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represent the resource vector for task <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>i</mml:mi></mml:math></inline-formula> at fog node <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>j</mml:mi></mml:math></inline-formula>, where
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>with <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denoting the computation, memory, and energy requirements, respectively, for each task <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>i</mml:mi></mml:math></inline-formula> at node <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>j</mml:mi></mml:math></inline-formula>. The interactions within the fog environment are captured through a quantum-inspired entanglement function, <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:mi>&#x1D4AC;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, that synchronizes resource management across nodes:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mi>&#x1D4AC;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is the scaling parameter that dictates the extent of entanglement concerning resource similarity between fog nodes. The function furthers the coordinated allocation through dynamic changes of weights with alterations to that encourage a distributed resource-sharing method that is efficient.</p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>Resource Demand and Availability Modeling</title>
<p>The demand and supply model is adaptive, where real-time demand fluctuations are captured using the probabilistic framework. Let <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denote the demand for resources from the IoT device <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msub><mml:mi>D</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> at the instant <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>t</mml:mi></mml:math></inline-formula> modeled as Poisson random variable with mean <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, where:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x223C;</mml:mo><mml:mrow><mml:mtext>Poisson</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>and <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> dynamically adjusts based on observed demand patterns. Resource availability for each fog node <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is represented by an availability function <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, formulated as:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is a time-dependent function representing the energy efficiency of node <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>j</mml:mi></mml:math></inline-formula> hence ensuring that dynamically updated availability is matched with energy constraints over time. Demand is matched with availability using the adaptive matching function <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mrow><mml:mi>&#x02133;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> assigning tasks from IoT devices to fog nodes considering resource constraints and availability probabilities:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mi>&#x02133;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi>&#x1D4AC;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> is an adaptation parameter that controls the sensitivity of task assignments based on real-time demand and availability.</p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Quantum-Inspired Algorithm Design</title>
<p>QIARM is proposed to improve resource management for fog computing environments by the principles of quantum mechanics. In the following, the proposed framework provides a representation based on the quantum superposition of resources, an entanglement-inspired mechanism for coordination among the nodes, an adaptive learning feature, and an energy-sensitive scheduling system.</p>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>Resource Representation via Quantum Superposition</title>
<p>In the QIARM model, resource allocation states are represented using a quantum superposition-inspired approach to enable parallel exploration of multiple configurations. Each fog node <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is assigned a quantum state vector <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, which encapsulates all possible allocations simultaneously, allowing for a probabilistic assessment of each configuration.</p>
<p>Define <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> as a superposition of the potential resource states <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula>, where each <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> corresponds to a different configuration of the allocation for node <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>j</mml:mi></mml:math></inline-formula>:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the amplitude of state <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> for node <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>j</mml:mi></mml:math></inline-formula>, representing the likelihood of selecting configuration <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>k</mml:mi></mml:math></inline-formula>. The values of <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are normalized such that:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>=</mml:mo><mml:mn>1.</mml:mn></mml:math></disp-formula></p>
<p>Each state <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> in <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> encodes a vector of resource parameters <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, where <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> is the computation capacity, <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>M</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> is the memory, and <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> is the energy required for configuration <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>k</mml:mi></mml:math></inline-formula>. We can consider any one of the resource parameters, say for node <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>j</mml:mi></mml:math></inline-formula>, by taking an expectation value weighted across all configurations:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:msub><mml:mi>C</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:msub><mml:mi>M</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>The quantum-inspired superposition technique enables the system to assess all resource states in parallel and picks up the best allocation from the measurement of <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>. The final measurement collapses <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> to <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:msup><mml:mi>k</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> that represents the best allocation with highest probability:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msup><mml:mi>k</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mi>arg</mml:mi><mml:mo>&#x2061;</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>This parallel exploration provides a novel and efficient method to handle resource allocation in fog nodes, where traditional sequential evaluations would be computationally prohibitive.</p>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Entanglement-Inspired Coordination Mechanism</title>
<p>QIARM follows the principles of quantum entanglement for synchronizing resource allocations across distributed fog nodes. This ensures efficiency in resource management in a nonredundant manner. Entanglement-inspired coordination dynamically models node interdependencies, promoting shared resource utilization and helping nodes balance resource allocation against dynamic demands in real-time.</p>
<p>Let <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> be the entanglement coefficient between two fog nodes, <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>. It measures the strength of their resource correlation. The higher the value is, the stronger the resource-sharing potential will be. Now, define <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> is a scaling factor, while <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> are the resource vectors for nodes <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, respectively, and the entanglement coefficient <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> decreases due to the increasing difference between resource vectors, thus reducing the intensity of coordination for diverging resource states.</p>
<p>For correlated allocation, define the vector of the shared resource, <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mtext>shared</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>, with components weighted by contributions of the entangled nodes:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>shared</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>The shared vector <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mtext>shared</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> is the aggregated resource state of entangled nodes; this, in effect, aligns resource availability within the fog environment. Each node, finally, uses <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mtext>shared</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> for its local computation to harmonize its resource distribution.</p>
<p>For task allocation, let us define a coordination function <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, which in real-time and based on mutually perceived availability and demand for each other, readjusts resource distribution between entangled nodes. The function may be expressed as:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are the availability functions of nodes <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, respectively, <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> their respective demands, <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula> is a sensitivity parameter modulating response to the real-time demand disparity. Finally, the resource allocation decision for each node incorporates both local as well as shared resources given by:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mrow><mml:mtext>final</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:munder><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>shared</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula></p>
</sec>
<sec id="s3_3_3">
<label>3.3.3</label>
<title>Adaptive Learning Component</title>
<p>The Adaptive Learning Component within QIARM continuously adjusts resource allocation based on evolving network conditions. This adaptive model operates in a feedback-driven loop, where each fog node dynamically refines its allocation strategy according to observed demand and availability fluctuations, thereby enhancing real-time optimization. In Algorithm 2, the Quantum-Inspired Algorithm Design for QIARM is outlined, detailing a structured approach for resource representation, entanglement-based coordination, adaptive learning, and energy-aware scheduling across fog nodes.</p>
<fig id="fig-9">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-9.tif"/>
</fig>
<p>Define <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> as the learning function for fog node <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> at time <inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:mi>t</mml:mi></mml:math></inline-formula>, which updates the resource allocation weights based on historical demand and allocation accuracy. The learning function is initialized as:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:mi>&#x03B7;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:mi>&#x03BE;</mml:mi></mml:math></inline-formula> are adjustment coefficients, <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the current demand for <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents its current availability. The terms <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">&#x27E9;</mml:mo></mml:math></inline-formula> are the mean demand and availability, respectively, for a measured period. To refine these allocations, an error function <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> may be calculated as a deviation between desired vs. actual resource allocation determined by:
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>|</mml:mo><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>desired</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>actual</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>|</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mtext>desired</mml:mtext></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mtext>actual</mml:mtext></mml:mrow></mml:msubsup></mml:math></inline-formula> are the desired and actual resource vectors for task <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:mi>i</mml:mi></mml:math></inline-formula> on node <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>. The learning part takes this error <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> to adapt the weights of future allocations to minimize mismatch in resources over time. Having gotten the error on resource allocation, the updated weights are computed by a learning rate <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> that decides the amount of update to stabilize the converging process:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>new</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>old</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>This adaptive update of weights incorporates into a continuous learning loop, whereby every node would iteratively adjust its strategy. To further infuse environmental dynamics, let an adaptation function <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:msub><mml:mrow><mml:mi>&#x1D49C;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> moderate <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> based on the rate of change of demand and availability:
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D49C;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BA;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>d</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:msub><mml:mi>d</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mi>d</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:mi>&#x03BA;</mml:mi></mml:math></inline-formula> is a scaling factor that changes the sensitivity of the adaptation function. It allows the learning component the capability to temporally be responsive to rapid changes and brings <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> into tune to prevent over- or under-allocation as conditions evolve.</p>
</sec>
<sec id="s3_3_4">
<label>3.3.4</label>
<title>Energy-Aware Resource Scheduling</title>
<p>The QIARM&#x2019;s Energy-Aware Resource Scheduling model because of fog computing introduces a mechanism that minimizes energy consumption while maintaining optimal performance for tasks. The idea involves incorporating an energy-based metric in the quantum-inspired framework to select configurations of resources that yield the lowest energy cost for the required level of performance. Energy cost function, <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:msub><mml:mrow><mml:mi>&#x2130;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, of fog node, <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, is defined as:
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:msub><mml:mrow><mml:mi>&#x2130;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> is the weight associated with each configuration <inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:mi>k</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the energy requirement of configuration <inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:mi>k</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:mi>t</mml:mi></mml:math></inline-formula>. These weights, <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>, are dynamic due to real-time demand and bias in those configurations where performance can be met with low energy consumption.</p>
<p>The energy-aware metric <inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is then computed for each fog node as a ratio of available energy to energy cost to guide the scheduling decision:
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x2130;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:msub><mml:mi>A</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the availability of resources at that time instant. The higher <inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, the more desirable the energy-efficient configuration will be, and it allows the scheduler to choose the node that minimizes power consumption while still being able to meet the task demand. To implement task heterogeneity, each incoming task <inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:mi>i</mml:mi></mml:math></inline-formula> is endowed with a priority function <inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:msub><mml:mrow><mml:mi>&#x1D4AB;</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, considering energy and urgency factors:
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D4AB;</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x2130;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>with <inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:msub><mml:mi mathvariant="bold-italic">&#x03B7;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is the urgency level of task <inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:mi>i</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:msub><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is a scaling factor balancing energy consumption and task priority. Tasks with higher values of <inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:msub><mml:mrow><mml:mi>&#x1D4AB;</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> will be scheduled first, ensuring urgent tasks get higher priority while keeping an energy-efficient allocation. The final selected configuration for each node <inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:msub><mml:mi>F</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is done based on the energy-minimizing schedule, which is updated iteratively as:
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:msubsup><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow><mml:mi>j</mml:mi><mml:mrow><mml:mrow><mml:mtext>optimal</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>arg</mml:mi><mml:mo>&#x2061;</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AB;</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>This energy-aware scheduling framework allows QIARM to dynamically adapt resource allocation with an energy-efficient perspective, selecting configurations to reduce overall power consumption.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Simulation and Results</title>
<p>The simulation setup for the QIARM approach was executed on a high-performance computing platform that had an Intel Core i9 processor, 64 GB RAM, and an NVIDIA RTX 3090 GPU. We have used MATLAB R2022b as an environment to simulate fog and a multitude of IoT nodes under various demand conditions. The simulation parameters are designed to represent real-time IoT scenarios to the task offloading rate and energy consumption, considering the network latency. <xref ref-type="table" rid="table-1">Table 1</xref> summarizes the parameters used in our experiments, where we compare QIARM with the state-of-the-art approaches: Fog Resource-Based Adaptive Task Offloading (FRATO) [<xref ref-type="bibr" rid="ref-25">25</xref>], Adaptive Resource Management for Network Slice Architectures in 5G and 6G Systems (ADAPTIVE6G) [<xref ref-type="bibr" rid="ref-27">27</xref>], Retransmission-Assisted Resource Management (R-ARM) &#x002A;&#x002A; [<xref ref-type="bibr" rid="ref-29">29</xref>] and IoT-Pi [<xref ref-type="bibr" rid="ref-31">31</xref>]. This section presents an overview of the experimental environment, and <xref ref-type="table" rid="table-1">Table 1</xref> describes the simulation parameters to evaluate the performance of QIARM compared to the state-of-the-art models.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Simulation parameters and descriptions</title>
</caption>
<table>
<colgroup>
<col/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Parameter</th>
<th align="center">Value</th>
<th align="center">Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>Processor</td>
<td>Intel Core i9</td>
<td>CPU used for running simulations</td>
</tr>
<tr>
<td>RAM</td>
<td>64 GB</td>
<td>Memory allocated for handling intensive simulations</td>
</tr>
<tr>
<td>GPU</td>
<td>NVIDIA RTX 3090</td>
<td>GPU utilized for accelerated computation</td>
</tr>
<tr>
<td>Simulator</td>
<td>MATLAB R2022b</td>
<td>Software platform for simulating QIARM and comparison models</td>
</tr>
<tr>
<td>Network latency</td>
<td>5-100 ms</td>
<td>Range of latency used to simulate real-time fog and IoT scenarios</td>
</tr>
<tr>
<td>Energy consumption</td>
<td>Varies by node</td>
<td>Total energy consumed per node per allocation cycle</td>
</tr>
<tr>
<td>Task offloading rate</td>
<td>0.1-1 task/s</td>
<td>Rate at which tasks are offloaded from IoT devices to fog nodes</td>
</tr>
<tr>
<td>Comparison models</td>
<td>FRATO, ADAPTIVE6G, R-ARM, IoT-Pi</td>
<td>State-of-the-art approaches used for benchmarking against QIARM</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s4_1">
<label>4.1</label>
<title>Latency Analysis</title>
<p>We conducted the latency analysis by comparing QIARM with four state-of-the-art models, namely FRATO [<xref ref-type="bibr" rid="ref-25">25</xref>], ADAPTIVE6G [<xref ref-type="bibr" rid="ref-27">27</xref>], R-ARM [<xref ref-type="bibr" rid="ref-29">29</xref>], and IoT-Pi [<xref ref-type="bibr" rid="ref-31">31</xref>]. Each model was simulated under unique network conditions between stable and oscillating states. All scenarios run for 360 min and capture all demands for resources from low to peak in both stable and oscillating network conditions. The scenarios included conditions such as low demand with stable 50% fog node utilization, moderate demand with fluctuating utilization, high demand with stable and fluctuating utilization, and peak demand with stable and fluctuating fog node loads. The average latency <italic>L</italic> represents the total time taken to complete the task, normalized across all completed tasks in dynamic fog environments.
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>completion</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>arrival</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mrow><mml:mtext>tasks</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mtext>completion</mml:mtext><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the task completion time, <inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mtext>arrival</mml:mtext><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the task arrival time, and <inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mtext>tasks</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> is the number of successfully offloaded tasks. In low-demand scenarios (1 and 4), QIARM exhibited significant latency advantages, as shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. For instance, in Scenario 1, QIARM maintained an average latency of 10 ms, outperforming FRATO&#x2019;s 15 ms, ADAPTIVE6G&#x2019;s 18 ms, R-ARM&#x2019;s 20 ms, and IoT-Pi&#x2019;s 22 ms. Scenario 2, with moderate demand, further demonstrated QIARM&#x2019;s efficiency as it achieved 12 ms latency, lower than FRATO at 17 ms, ADAPTIVE6G at 20 ms, R-ARM at 22 ms, and IoT-Pi at 24 ms. These results highlight QIARM&#x2019;s capability to manage resources effectively even in scenarios with consistent, lower demand.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Latency analysis of QIARM and state-of-the-art approaches across eight scenarios over a 360-minute simulation period</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-4.tif"/>
</fig>
<p>As demand was higher, so in Scenarios 3 and 6, which are high-loaded scenarios, QIARM remained the best. In Scenario 3, a high-demand but stable network records an average latency of 15 ms by QIARM, while FRATO accounted for 22 ms, ADAPTIVE6G accounted for 25 ms, R-ARM accounted for 27 ms, and IoT-Pi accounted for 29 ms. In fact, under a fluctuating high-demand Scenario 6, QIARM uses its adaptive learning to maintain the latency at 18 ms, remarkably below FRATO at 24 ms, ADAPTIVE6G at 27 ms, R-ARM at 29 ms, and IoT-Pi at 31 ms. These results underline the efficiency of QIARM&#x2019;s quantum-inspired approach under demanding and fluctuating load conditions.</p>
<p>Under peak-demand scenarios like 7 and 8, their performance was still really strong, scaled up with efficiency under very extreme conditions. Indeed, during peak demand-Scenario 7-with utilization at 95% for most of the time, QIARM still maintained an average latency of 20 ms, while FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi realized 26, 28, 30, and 32 ms, respectively. Scenario 8, corresponding to the peak demand with fluctuating network conditions, declared latency in QIARM at 21 ms, FRATO at 28 ms, ADAPTIVE6G at 30 ms, R-ARM at 32 ms, and IoT-Pi at 34 ms.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Energy Consumption Analysis</title>
<p>To assess the energy efficiency of the proposed QIARM model, we evaluated its performance across eight distinct scenarios. The energy consumption <italic>E</italic> quantifies the power used across all fog nodes, incorporating real-time energy variations during task execution.
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#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:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>P</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:msub><mml:mi>P</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the instantaneous power of fog node <inline-formula id="ieqn-162"><mml:math id="mml-ieqn-162"><mml:mi>j</mml:mi></mml:math></inline-formula>, <italic>M</italic> is the number of nodes, and <italic>T</italic> is the total simulation time. In Scenario 1, where demand and network utilization were low and stable, QIARM achieved an energy consumption of 240 kWh, significantly lower than the baseline models, as shown by <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. In comparison, FRATO recorded 290 kWh, ADAPTIVE6G consumed 310 kWh, R-ARM used 330 kWh, and IoT-Pi reached 345 kWh. This result proves that QIARM energy-aware scheduling effectively cuts down consumption in low-demand situations. Along similar lines, Scenario 2 is a moderate-demand environment, in which, with stable utilization, QIARM kept energy consumption at 260 kWh, while FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi recorded 310, 330, 355, and 370 kWh, respectively.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Energy consumption analysis of QIARM and state-of-the-art approaches across eight scenarios over a 360-minute simulation period</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-5.tif"/>
</fig>
<p>For high-demand conditions in scenario 3, QIARM&#x2019;s energy efficiency remained robust at 280 kWh, compared to FRATO&#x2019;s 340 kWh, ADAPTIVE6G&#x2019;s 360 kWh, R-ARM&#x2019;s 380 kWh, and IoT-Pi&#x2019;s 395 kWh. This scenario highlights QIARM&#x2019;s adaptive energy-aware resource allocation as demand intensifies. In Scenario 4, under low demand but fluctuating network utilization, QIARM managed to keep energy consumption at 250 kWh. Meanwhile, FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi showed higher energy demands, consuming 300, 325, 345, and 360 kWh, respectively.</p>
<p>As the network load increased in Scenario 5 with moderate demand and fluctuating utilization, QIARM recorded an energy consumption of 275 kWh, whereas FRATO consumed 330 kWh, ADAPTIVE6G reached 350 kWh, R-ARM utilized 375 kWh, and IoT-Pi peaked at 390 kWh. In Scenario 6, where both demand and network utilization were high and variable, QIARM achieved 295 kWh in energy consumption, outperforming FRATO at 355 kWh, ADAPTIVE6G at 375 kWh, R-ARM at 400 kWh, and IoT-Pi at 415 kWh, showcasing QIARM&#x2019;s resilience in handling more intense and dynamic conditions.</p>
<p>In peak-demand Scenario 7, with a stable but high utilization of 95%, QIARM recorded an energy consumption of 310 kWh, substantially lower than FRATO at 370 kWh, ADAPTIVE6G at 390 kWh, R-ARM at 415 kWh, and IoT-Pi at 430 kWh. Finally, in Scenario 8, representing the most challenging conditions of peak demand with fluctuating utilization, QIARM&#x2019;s adaptive framework achieved 320 kWh in energy usage. In contrast, FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi recorded higher values of 380, 400, 420, and 435 kWh, respectively.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Task Offloading Success Rate</title>
<p>To evaluate the task offloading efficiency of QIARM, we analyzed its performance across eight novel scenarios. The task offloading success rate<italic>S</italic> measures the efficiency of the system in completing tasks successfully without resource bottlenecks.
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mrow><mml:mtext>success</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mrow><mml:mtext>total</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn></mml:math></disp-formula>where <inline-formula id="ieqn-163"><mml:math id="mml-ieqn-163"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mtext>success</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> is the number of successfully offloaded tasks, and <inline-formula id="ieqn-164"><mml:math id="mml-ieqn-164"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mtext>total</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> is the total number of tasks generated. In scenario 1, QIARM achieved a task offloading success rate of 98%, outperforming FRATO&#x2019;s 94%, ADAPTIVE6G&#x2019;s 92%, R-ARM&#x2019;s 89%, and IoT-Pi&#x2019;s 88%, as shown by <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. This scenario indicates that QIARM effectively manages low-demand environments by accurately offloading tasks without exceeding resource limits. Scenario 2, a moderate-demand setting, reflected similar results, with QIARM recording a success rate of 96%, while FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi attained success rates of 92%, 90%, 88%, and 87%, respectively.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Task offloading success rate analysis of QIARM and state-of-the-art approaches across pre-defined multiple scenarios</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-6.tif"/>
</fig>
<p>Under high-demand conditions in Scenario 3, QIARM&#x2019;s success rate was 93%, still higher than FRATO at 89%, ADAPTIVE6G at 87%, R-ARM at 85%, and IoT-Pi at 83%. This scenario highlights QIARM&#x2019;s ability to optimize task management and avoid resource overload, unlike the traditional models which showed higher failure rates. In Scenario 4, where demand was low but utilization fluctuated, QIARM managed to maintain a success rate of 95%. In comparison, FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi achieved success rates of 91%, 89%, 87%, and 85%, respectively.</p>
<p>In Scenario 5, QIARM attained a success rate of 94%, while running at a moderate pace and fluctuating utilization, far ahead of FRATO with 90%, ADAPTIVE6G with 88%, R-ARM with 86%, and IoT-Pi at 84%. Further, under high and fluctuating demands in Scenario 6, the adaptive mechanism of QIARM yielded higher results; its success rate stood at 91%, much better compared to FRATO at 87%, ADAPTIVE6G at 85%, R-ARM at 82%, and IoT-Pi at 80%. These results clearly show how QIARM retains good success rates under dynamic and stressful conditions. For example, in the peak demand Scenario 7. In the last Scenario, 8, for peak demand and fluctuating network conditions, the success rate recorded by QIARM was 88%, by FRATO was 83%, by ADAPTIVE6G was 81%, R-ARM had 79%, and IoT-Pi had 76%.</p>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Resource Utilization</title>
<p>The resource utilization efficiency in the proposed QIARM model is studied with the top-performing approaches. The resource utilization <italic>U</italic> evaluates the percentage of available resources effectively used during task allocation cycles.
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:mi>U</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mo movablelimits="false">&#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:msubsup><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msubsup><mml:mo movablelimits="false">&#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:msubsup><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn></mml:math></disp-formula>where <inline-formula id="ieqn-165"><mml:math id="mml-ieqn-165"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the resource allocated to task <inline-formula id="ieqn-166"><mml:math id="mml-ieqn-166"><mml:mi>i</mml:mi></mml:math></inline-formula> at node <inline-formula id="ieqn-167"><mml:math id="mml-ieqn-167"><mml:mi>j</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-168"><mml:math id="mml-ieqn-168"><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is the total resource capacity of node <inline-formula id="ieqn-169"><mml:math id="mml-ieqn-169"><mml:mi>j</mml:mi></mml:math></inline-formula>. In Scenario 1, during low demand or nodes operating at a stable utilization of 50%, the resource utilization rate in QIARM is 85%, compared to FRATO at 78%, ADAPTIVE6G at 75%, R-ARM at 72%, and IoT-Pi at 70%, as depicted in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. It shows there that QIARM maximizes resource allocation even at low-demand conditions by appropriately distributing the tasks across the nodes. Scenario 2, on the other hand, is a moderate-demand scenario; QIARM continued to be the most efficient, reaching an occupancy rate of 87%, while FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi reached 80%, 77%, 74%, and 72%, respectively.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Resource utilization across scenarios and approaches</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_60973-fig-7.tif"/>
</fig>
<p>For example, under the high-demand Scenario 3, QIARM experienced resource utilization of 89%, against FRATO, which had 82%, ADAPTIVE6G at 80%, R-ARM at 77%, and IoT-Pi at 75%. This underlines how QIARM is able to be adaptive to high demand in managing the resources. Efficient distribution becomes very important during such a situation, as it helps avert bottlenecks of the resources. Under scenario 4, with fluctuating utilization, QIARM was able to maintain resource utilization at 86%, while outperforming those reached by FRATO at 79%, ADAPTIVE6G at 76%, R-ARM at 73%, and IoT-Pi at 71%. In scenario 7, peak demand and utilization stability at 95%, QIARM reached a utilization of 91%, significantly higher when compared to FRATO at 84%, ADAPTIVE6G at 82%, R-ARM at 79%, and IoT-Pi at 77%. Lastly, in Scenario 8, representing peak demand and fluctuating utilization, QIARM maintained its resource utilization rate at 90%, whereas FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi reached utilization of 85%, 83%, 80%, and 78%, respectively.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Computational Complexity Analysis</title>
<p>This section evaluates the computational complexity of the QIARM algorithm, focusing on its three core phases and comparing its overhead with baseline approaches.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Complexity of QIARM</title>
<p>The initialization of resource vectors and quantum superposition states scales linearly with the number of fog nodes <italic>M</italic> and resource configurations <italic>K</italic>. The complexity is <inline-formula id="ieqn-170"><mml:math id="mml-ieqn-170"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>K</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
<p>The parallel evaluation of resource states and coordination based on entanglement between nodes scale quadratically with the number of fog nodes <italic>M</italic> and linearly with tasks <italic>N</italic>, resulting in <inline-formula id="ieqn-171"><mml:math id="mml-ieqn-171"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
<p>Iterative updates of allocation strategies based on real-time dynamics introduce a complexity of <inline-formula id="ieqn-172"><mml:math id="mml-ieqn-172"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, where <italic>T</italic> is the number of adjustment cycles. The overall complexity of QIARM is:
<disp-formula id="ueqn-27"><mml:math id="mml-ueqn-27" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>K</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Comparison with Baseline Approaches</title>
<p>- FRATO: Linear complexity of <inline-formula id="ieqn-173"><mml:math id="mml-ieqn-173"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>M</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> but lacks adaptability and parallelism. - ADAPTIVE6G: Centralized slicing introduces <inline-formula id="ieqn-174"><mml:math id="mml-ieqn-174"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>M</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> complexity. - R-ARM: Sequential retransmission strategies result in <inline-formula id="ieqn-175"><mml:math id="mml-ieqn-175"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. - IoT-Pi: Lightweight learning with <inline-formula id="ieqn-176"><mml:math id="mml-ieqn-176"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> but lacks coordination.</p>
<p>Compared to these models, QIARM&#x2019;s parallelism significantly reduces execution time while maintaining scalability and adaptability. The added quadratic complexity for entanglement-based coordination is offset by gains in resource optimization.</p>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Discussion</title>
<p>The evaluation of the QIARM model shows notable superiority in resource management efficiency over some established models, such as FRATO, ADAPTIVE6G, R-ARM, and IoT-Pi. In all scenarios, QIARM can maintain a much higher task-offloading success rate along with much better resource utilization compared with other established schemes. Therefore, the performance adaptability and robustness of the QIARM are confirmed with fluctuating network conditions. While classical schemes fail in general for high-demand or variable-load conditions, the quantum-inspired algorithms from QIARM achieve sophisticated balancing of resources with minimal latency and energy consumption. Hence, the performance shows that quantum-inspired models can attempt to solve some major limitations in the existing resource management techniques under diverse scenarios and challenging IoT and fog computing conditions.</p>
<p>In addition, the adaptive resource allocation and scheduling mechanisms of QIARM helped achieve high energy efficiency, represented by the consumption of lower energy in all scenarios compared to baseline models. The quantum-based framework of QIARM dealt with real-time demands in a very nontraditional manner with an energy-aware perspective that made it rather different from the traditional models, which do not possess such responsive adaptability. These results show the feasibility of integrating quantum-inspired methods in the pursuit of greater efficiency in the IoT, especially in complex systems that are fully decentralized and require both resource flexibility and energy optimization. Although FRATO achieved a maximum task load success rate of 94% under low-demand conditions, our QIARM model achieved 98%, demonstrating superior adaptability. Additionally, QIARM reduced energy consumption by up to 20% across various scenarios compared to state-of-the-art methods like ADAPTIVE6G and IoT-Pi, which lacked similar energy-aware scheduling mechanisms. These results underline QIARM&#x2019;s ability to address the scalability and efficiency challenges in fog computing environments, unlike traditional models that fail under dynamic network conditions.</p>
<p>Although QIARM implements effective optimization in resource allocation, quantum-inspired mechanisms may introduce computational overheads that could affect scalability for larger networks. Future research efforts should be made to further refine and develop these algorithms to reduce computational overheads so that, in the future, quantum-inspired methods remain viable even for large-scale networks in the IoT. Furthermore, hybrid solutions that merge quantum-inspired principles with other emerging models can also be further explored to achieve even higher improvements in performance and energy efficiency.</p>
</sec>
<sec id="s7">
<label>7</label>
<title>Conclusion</title>
<p>Efficient resource management in IoT and fog computing environments is increasingly critical to meet the demands of scalable and energy-efficient networks. This study introduced the QIARM model, designed to optimize resource allocation in dynamic conditions. Unlike conventional methods, QIARM uniquely leverages quantum principles to balance resource use and energy efficiency through adaptive scheduling. Practically, this innovation has potential applications in diverse IoT networks, where flexible resource management is essential. The evaluation showed QIARM&#x2019;s superior performance, with a task-offloading success rate reaching 98% under low-demand conditions, compared to 94% for FRATO and 92% for ADAPTIVE6G. Under high-demand scenarios, QIARM maintained a utilization rate of 89%, outperforming FRATO&#x2019;s 82% and R-ARM&#x2019;s 77%. Furthermore, QIARM demonstrated notable energy efficiency, reducing consumption by up to 20% in all scenarios. Although the QIARM model demonstrates significant improvements in scalability, energy efficiency, and resource management, it introduces computational overhead due to the quantum-inspired mechanisms. Future extensions could explore hybrid models, integrating quantum-inspired principles with machine learning for even greater optimization in complex IoT environments.</p>
</sec>
</body>
<back>
<ack>
<p>None.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This research is funded by Researchers Supporting Project Number (RSPD2025R947), King Saud University, Riyadh, Saudi Arabia.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Conceptualization and methodology: Sonia Khan, Naqash Younas, Musaed Alhussein; Data collection: Sonia Khan, Naqash Younas; Analysis and interpretation of results: Sonia Khan, Musaed Alhussein, Wahib Jamal Khan; Draft manuscript preparation: Sonia Khan; Review and editing: Sonia Khan, Musaed Alhussein, Wahib Jamal Khan, Khursheed Aurangzeb; Project administration: Muhammad Shahid Anwar. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The data and code used in this study are part of ongoing research and are not publicly available at this stage. They will be published and made accessible upon completion of the project to ensure the transparency and reproducibility of the research findings. Any requests for data prior to publication will be entertained by the corresponding author, subject to research timeline and confidentiality constraints.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kopetz</surname> <given-names>H</given-names></string-name>, <string-name><surname>Steiner</surname> <given-names>W</given-names></string-name></person-group>. <chapter-title>Internet of things</chapter-title>. In: <source>Real-time systems: design principles for distributed embedded applications</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2022</year>. p. <fpage>325</fpage>&#x2013;<lpage>41</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ji</surname> <given-names>IH</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>JH</given-names></string-name>, <string-name><surname>Jeon</surname> <given-names>S</given-names></string-name>, <string-name><surname>Seo</surname> <given-names>JT</given-names></string-name></person-group>. <article-title>Encrypted cyberattack detection system over encrypted IoT traffic based on statistical intelligence</article-title>. <source>Comput Model Eng Sci</source>. <year>2024</year>;<volume>141</volume>(<issue>2</issue>):<fpage>1519</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2024.053437</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Satamraju</surname> <given-names>KP</given-names></string-name>, <string-name><surname>Malarkodi</surname> <given-names>B</given-names></string-name></person-group>. <article-title>A decentralized framework for device authentication and data security in the next generation internet of medical things</article-title>. <source>Comput Commun</source>. <year>2021</year>;<volume>180</volume>:<fpage>146</fpage>&#x2013;<lpage>60</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comcom.2021.09.012</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ren</surname> <given-names>J</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Mao</surname> <given-names>X</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>W</given-names></string-name></person-group>. <article-title>An edge-fog-cloud computing-based digital twin model for prognostics health management of process manufacturing systems</article-title>. <source>Comput Model Eng Sci</source>. <year>2023</year>;<volume>135</volume>(<issue>1</issue>):<fpage>599</fpage>&#x2013;<lpage>618</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2022.022415</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shukla</surname> <given-names>S</given-names></string-name>, <string-name><surname>Hassan</surname> <given-names>MF</given-names></string-name>, <string-name><surname>Tran</surname> <given-names>DC</given-names></string-name>, <string-name><surname>Akbar</surname> <given-names>R</given-names></string-name>, <string-name><surname>Paputungan</surname> <given-names>IV</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MK</given-names></string-name></person-group>. <article-title>Improving latency in Internet-of-Things and cloud computing for real-time data transmission: a systematic literature review (SLR)</article-title>. <source>Cluster Comput</source>. <year>2023</year>:<fpage>1</fpage>&#x2013;<lpage>24</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10586-021-03279-3</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Murshed</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Murphy</surname> <given-names>C</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>D</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>N</given-names></string-name>, <string-name><surname>Ananthanarayanan</surname> <given-names>G</given-names></string-name>, <string-name><surname>Hussain</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Machine learning at the network edge: a survey</article-title>. <source>ACM Comput Surveys</source>. <year>2021</year>;<volume>54</volume>(<issue>8</issue>):<fpage>1</fpage>&#x2013;<lpage>37</lpage>. doi:10.1145/3469029.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>George</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ravindran</surname> <given-names>A</given-names></string-name>, <string-name><surname>Mendieta</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mez Tabkhi</surname> <given-names>H</given-names></string-name></person-group>. <article-title>An adaptive messaging system for latency-sensitive multi-camera machine vision at the IoT edge</article-title>. <source>IEEE Access</source>. <year>2021</year>;<volume>9</volume>:<fpage>21457</fpage>&#x2013;<lpage>73</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2021.3055775</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cao</surname> <given-names>B</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Adaptive 5G-and-beyond network-enabled interpretable federated learning enhanced by neuroevolution</article-title>. <source>Sci China Inf Sci</source>. <year>2024</year>;<volume>67</volume>(<issue>7</issue>):<fpage>170306</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s11432-023-4011-4</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Caiazza</surname> <given-names>C</given-names></string-name>, <string-name><surname>Giordano</surname> <given-names>S</given-names></string-name>, <string-name><surname>Luconi</surname> <given-names>V</given-names></string-name>, <string-name><surname>Vecchio</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Edge computing vs centralized cloud: impact of communication latency on the energy consumption of LTE terminal nodes</article-title>. <source>Comput Commun</source>. <year>2022</year>;<volume>194</volume>:<fpage>213</fpage>&#x2013;<lpage>25</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comcom.2022.07.026</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>D</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>EALLR: energy-aware low-latency routing data driven model in mobile edge computing</article-title>. <source>IEEE Trans Consum Electron</source>. <year>2024</year>. doi:<pub-id pub-id-type="doi">10.1109/TCE.2024.3507158</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ghaleb</surname> <given-names>M</given-names></string-name>, <string-name><surname>Azzedin</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Towards scalable and efficient architecture for modeling trust in IoT environments</article-title>. <source>Sensors</source>. <year>2021</year>;<volume>21</volume>(<issue>9</issue>):<fpage>2986</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s21092986</pub-id>; <pub-id pub-id-type="pmid">33923182</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nasir</surname> <given-names>M</given-names></string-name>, <string-name><surname>Muhammad</surname> <given-names>K</given-names></string-name>, <string-name><surname>Ullah</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ahmad</surname> <given-names>J</given-names></string-name>, <string-name><surname>Baik</surname> <given-names>SW</given-names></string-name>, <string-name><surname>Sajjad</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Enabling automation and edge intelligence over resource constraint IoT devices for smart home</article-title>. <source>Neurocomputing</source>. <year>2022</year>;<volume>491</volume>:<fpage>494</fpage>&#x2013;<lpage>506</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.neucom.2021.04.138</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bian</surname> <given-names>J</given-names></string-name>, <string-name><surname>Al Arafat</surname> <given-names>A</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>H</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>L</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>H</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Machine learning in real-time Internet of Things (IoT) systems: a survey</article-title>. <source>IEEE Internet Things J</source>. <year>2022</year>;<volume>9</volume>(<issue>11</issue>):<fpage>8364</fpage>&#x2013;<lpage>86</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2022.3161050</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>The intelligent traffic flow control system based on 6G and optimized genetic algorithm</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2024</year>. doi:<pub-id pub-id-type="doi">10.1109/tits.2024.3467269</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Siriwardhana</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Porambage</surname> <given-names>P</given-names></string-name>, <string-name><surname>Liyanage</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ylianttila</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A survey on mobile augmented reality with 5G mobile edge computing: architectures, applications, and technical aspects</article-title>. <source>IEEE Commun Surv Tut</source>. <year>2021</year>;<volume>23</volume>(<issue>2</issue>):<fpage>1160</fpage>&#x2013;<lpage>92</lpage>. doi:<pub-id pub-id-type="doi">10.1109/COMST.2021.3061981</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gupta</surname> <given-names>A</given-names></string-name>, <string-name><surname>Agarwal</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Enhancing sales forecasting accuracy through integrated enterprise resource planning and customer relationship management using artificial intelligence</article-title>. In: <conf-name>2024 3rd International Conference on Artificial Intelligence For Internet of Things (AIIoT)</conf-name>; <year>2024</year>; <publisher-loc>Vellore, Tamilnadu, India</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jayaprakash</surname> <given-names>S</given-names></string-name>, <string-name><surname>Nagarajan</surname> <given-names>MD</given-names></string-name>, <string-name><surname>Prado</surname> <given-names>RPd</given-names></string-name>, <string-name><surname>Subramanian</surname> <given-names>S</given-names></string-name>, <string-name><surname>Divakarachari</surname> <given-names>PB</given-names></string-name></person-group>. <article-title>A systematic review of energy management strategies for resource allocation in the cloud: clustering, optimization and machine learning</article-title>. <source>Energies</source>. <year>2021</year>;<volume>14</volume>(<issue>17</issue>):<fpage>5322</fpage>. doi:<pub-id pub-id-type="doi">10.3390/en14175322</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ahammad</surname> <given-names>I</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MAR</given-names></string-name>, <string-name><surname>Salehin</surname> <given-names>ZU</given-names></string-name></person-group>. <article-title>Software-defined dew, roof, fog and cloud (SD-DRFC) framework for IoT ecosystem: the journey, novel framework architecture, simulation, and use cases</article-title>. <source>SN Comput Sci</source>. <year>2021</year>;<volume>2</volume>(<issue>3</issue>):<fpage>159</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s42979-021-00521-y</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Song</surname> <given-names>B</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>P</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>FR</given-names></string-name>, <string-name><surname>Du</surname> <given-names>X</given-names></string-name>, <string-name><surname>Guizani</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Resource management for edge intelligence (EI)-assisted IoV using quantum-inspired reinforcement learning</article-title>. <source>IEEE Internet Things J</source>. <year>2021</year>;<volume>9</volume>(<issue>14</issue>):<fpage>12588</fpage>&#x2013;<lpage>600</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2021.3137984</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Taneja</surname> <given-names>A</given-names></string-name>, <string-name><surname>Saluja</surname> <given-names>N</given-names></string-name>, <string-name><surname>Rani</surname> <given-names>S</given-names></string-name></person-group>. <article-title>An energy efficient dynamic framework for resource control in massive IoT network for smart cities</article-title>. <source>Wirel Netw</source>. <year>2024</year>;<volume>30</volume>(<issue>5</issue>):<fpage>4447</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11276-022-03047-0</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname> <given-names>G</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>X</given-names></string-name>, <string-name><surname>Chang</surname> <given-names>V</given-names></string-name>, <string-name><surname>Vasilakos</surname> <given-names>AV</given-names></string-name></person-group>. <article-title>Low-latency and resource-efficient service function chaining orchestration in network function virtualization</article-title>. <source>IEEE Internet Things J</source>. <year>2020</year>;<volume>7</volume>(<issue>7</issue>):<fpage>5760</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2019.2937110</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Su</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>B</given-names></string-name>, <string-name><surname>Guizani</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Profit maximization of independent task offloading in MEC-enabled 5G internet of vehicles</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2024</year>;<volume>25</volume>(<issue>11</issue>):<fpage>16449</fpage>&#x2013;<lpage>61</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TITS.2024.3416300</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Guizani</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Proportional fairness-aware task scheduling in space-air-ground integrated networks</article-title>. <source>IEEE Trans Serv Comput</source>. <year>2024</year>;<volume>17</volume>(<issue>6</issue>):<fpage>4125</fpage>&#x2013;<lpage>37</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TSC.2024.3478730</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Ding</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>X</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Du-Bus: a realtime bus waiting time estimation system based on multi-source data</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2022</year>;<volume>23</volume>(<issue>12</issue>):<fpage>24524</fpage>&#x2013;<lpage>39</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TITS.2022.3210170</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tran-Dang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>DS</given-names></string-name></person-group>. <article-title>FRATO: fog resource based adaptive task offloading for delay-minimizing IoT service provisioning</article-title>. <source>IEEE Trans Parallel Distrib Syst</source>. <year>2021</year>;<volume>32</volume>(<issue>10</issue>):<fpage>2491</fpage>&#x2013;<lpage>508</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TPDS.2021.3067654</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sharif</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Jung</surname> <given-names>LT</given-names></string-name>, <string-name><surname>Razzak</surname> <given-names>I</given-names></string-name>, <string-name><surname>Alazab</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Adaptive and priority-based resource allocation for efficient resources utilization in mobile-edge computing</article-title>. <source>IEEE Internet Things J</source>. <year>2021</year>;<volume>10</volume>(<issue>4</issue>):<fpage>3079</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2021.3111838</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Thantharate</surname> <given-names>A</given-names></string-name>, <string-name><surname>Beard</surname> <given-names>C</given-names></string-name></person-group>. <article-title>ADAPTIVE6G: adaptive resource management for network slicing architectures in current 5G and future 6G systems</article-title>. <source>J Netw Syst Manag</source>. <year>2023</year>;<volume>31</volume>(<issue>1</issue>):<fpage>9</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s10922-022-09693-1</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peng</surname> <given-names>X</given-names></string-name>, <string-name><surname>Song</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ota</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Task offloading for IoAV under extreme weather conditions using dynamic price driven double broad reinforcement learning</article-title>. <source>IEEE Internet Things J</source>. <year>2024</year>;<volume>11</volume>(<issue>10</issue>):<fpage>17021</fpage>&#x2013;<lpage>33</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2024.3360110</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Farhad</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>DH</given-names></string-name>, <string-name><surname>Pyun</surname> <given-names>JY</given-names></string-name></person-group>. <article-title>R-ARM: retransmission-assisted resource management in LoRaWAN for the Internet of Things</article-title>. <source>IEEE Internet Things J</source>. <year>2021</year>;<volume>9</volume>(<issue>10</issue>):<fpage>7347</fpage>&#x2013;<lpage>61</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2021.3111167</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Maraveas</surname> <given-names>C</given-names></string-name>, <string-name><surname>Piromalis</surname> <given-names>D</given-names></string-name>, <string-name><surname>Arvanitis</surname> <given-names>KG</given-names></string-name>, <string-name><surname>Bartzanas</surname> <given-names>T</given-names></string-name>, <string-name><surname>Loukatos</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Applications of IoT for optimized greenhouse environment and resources management</article-title>. <source>Comput Electron Agric</source>. <year>2022</year>;<volume>198</volume>:<fpage>106993</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compag.2022.106993</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shao</surname> <given-names>T</given-names></string-name>, <string-name><surname>Chowdhury</surname> <given-names>D</given-names></string-name>, <string-name><surname>Gill</surname> <given-names>SS</given-names></string-name>, <string-name><surname>Buyya</surname> <given-names>R</given-names></string-name></person-group>. <article-title>IoT-Pi: a machine learning-based lightweight framework for cost-effective distributed computing using IoT</article-title>. <source>Internet Technol Lett</source>. <year>2022</year>;<volume>5</volume>(<issue>3</issue>):<fpage>e355</fpage>. doi:<pub-id pub-id-type="doi">10.1002/itl2.355</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Buvana</surname> <given-names>M</given-names></string-name>, <string-name><surname>Loheswaran</surname> <given-names>K</given-names></string-name>, <string-name><surname>Madhavi</surname> <given-names>K</given-names></string-name>, <string-name><surname>Ponnusamy</surname> <given-names>S</given-names></string-name>, <string-name><surname>Behura</surname> <given-names>A</given-names></string-name>, <string-name><surname>Jayavadivel</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Improved resource management and utilization based on a fog-cloud computing system with IoT incorporated with classifier systems</article-title>. <source>Microprocess Microsyst</source>. <year>2021</year>:<fpage>103815</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.micpro.2020.103815</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Li</surname> <given-names>B</given-names></string-name>, <string-name><surname>Song</surname> <given-names>B</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Muhammad</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Dual-driven resource management for sustainable computing in the blockchain-supported digital twin IoT</article-title>. <source>IEEE Internet Things J</source>. <year>2022</year>;<volume>10</volume>(<issue>8</issue>):<fpage>6549</fpage>&#x2013;<lpage>60</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2022.3162714</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>C</given-names></string-name>, <string-name><surname>He</surname> <given-names>A</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Chronopoulos</surname> <given-names>AT</given-names></string-name>, <string-name><surname>Giannakos</surname> <given-names>A</given-names></string-name></person-group>. <article-title>RFL-APIA: a comprehensive framework for mitigating poisoning attacks and promoting model aggregation in IIoT federated learning</article-title>. <source>IEEE Trans Ind Inform</source>. <year>2024</year>;<volume>20</volume>(<issue>11</issue>):<fpage>12935</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TII.2024.3431020</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Dl</surname> <given-names>Kong</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Mao</surname> <given-names>Y</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A model value transfer incentive mechanism for federated learning with smart contracts in AIoT</article-title>. <source>IEEE Internet Things J</source>. <year>2024</year>;<volume>12</volume>(<issue>3</issue>):<fpage>2530</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2024.3468443</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Quan</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>H</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Deep reinforcement learning based resource management for DNN inference in industrial IoT</article-title>. <source>IEEE Trans Veh Technol</source>. <year>2021</year>;<volume>70</volume>(<issue>8</issue>):<fpage>7605</fpage>&#x2013;<lpage>18</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TVT.2021.3068255</pub-id>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ong</surname> <given-names>KSH</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Niyato</surname> <given-names>D</given-names></string-name>, <string-name><surname>Friedrichs</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Deep-reinforcement-learning-based predictive maintenance model for effective resource management in industrial IoT</article-title>. <source>IEEE Internet Things J</source>. <year>2021</year>;<volume>9</volume>(<issue>7</issue>):<fpage>5173</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2021.3109955</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>E</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>An efficient prediction-based user recruitment for mobile crowdsensing</article-title>. <source>IEEE Trans Mobile Comput</source>. <year>2018</year>;<volume>17</volume>(<issue>1</issue>):<fpage>16</fpage>&#x2013;<lpage>28</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TMC.2017.2702613</pub-id>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>P</given-names></string-name>, <string-name><surname>Song</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>FR</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>L</given-names></string-name>, <string-name><surname>Leung</surname> <given-names>VC</given-names></string-name></person-group>. <article-title>Resource management for pervasive-edge-computing-assisted wireless VR streaming in industrial Internet of Things</article-title>. <source>IEEE Trans Indus Inform</source>. <year>2021</year>;<volume>17</volume>(<issue>11</issue>):<fpage>7607</fpage>&#x2013;<lpage>17</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TII.2021.3061579</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>