<?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">73039</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.073039</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>AI-Driven SDN and Blockchain-Based Routing Framework for Scalable and Trustworthy AIoT Networks</article-title>
<alt-title alt-title-type="left-running-head">AI-Driven SDN and Blockchain-Based Routing Framework for Scalable and Trustworthy AIoT Networks</alt-title>
<alt-title alt-title-type="right-running-head">AI-Driven SDN and Blockchain-Based Routing Framework for Scalable and Trustworthy AIoT Networks</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alharbi</surname><given-names>Mekhled</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>mn-alharbi@ju.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Haseeb</surname><given-names>Khalid</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Humayun</surname><given-names>Mamoona</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><email>mamoona.humayun@roehampton.ac.uk</email></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Software Engineering, College of Computer and Information Sciences, Jouf University</institution>, <addr-line>Sakaka, 72388</addr-line>, <country>Al-Jouf, Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, Islamia College Peshawar</institution>, <addr-line>Peshawar, 25120</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-3"><label>3</label><institution>School of Computing, Engineering and the Built Environment, University of Roehampton</institution>, <addr-line>London, SW155PJ</addr-line>, <country>UK</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Mekhled Alharbi. Email: <email>mn-alharbi@ju.edu.sa</email>; Mamoona Humayun. Email: <email>mamoona.humayun@roehampton.ac.uk</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>26</day><month>11</month><year>2025</year>
</pub-date>
<volume>145</volume>
<issue>2</issue>
<fpage>2601</fpage>
<lpage>2616</lpage>
<history>
<date date-type="received">
<day>09</day>
<month>09</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>28</day>
<month>10</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_73039.pdf"></self-uri>
<abstract>
<p>Emerging technologies and the Internet of Things (IoT) are integrating for the growth and development of heterogeneous networks. These systems are providing real-time devices to end users to deliver dynamic services and improve human lives. Most existing approaches have been proposed to improve energy efficiency and ensure reliable routing; however, trustworthiness and network scalability remain significant research challenges. In this research work, we introduce an AI-enabled Software-Defined Network (SDN)- driven framework to provide secure communication, trusted behavior, and effective route maintenance. By considering multiple parameters in the forwarder selection process, the proposed framework enhances network stability and optimizes decision-making. In addition, the involvement of the blockchain consensus algorithm and the intelligence of the SDN controller enables a proposed framework for robust authentication and a verifiable process of data blocks. Ultimately, only trusted devices are selected for routing, and malicious threats are prevented as data is forwarded to the cloud system. The extensive experimental analysis demonstrated that the proposed framework significantly improved energy consumption by 48%, packet loss by 49%, response time by 46%, and data transfer rate by 45% compared with existing techniques.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Blockchain</kwd>
<kwd>energy efficiency</kwd>
<kwd>Internet of Things</kwd>
<kwd>software-defined networking</kwd>
<kwd>trust management</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Deanship of Graduate Studies and Scientific Research at Jouf University</funding-source>
<award-id>DGSSR-2025-02-01669</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>IoT integrated with smart technologies enables the development of real-time critical systems for the timely processing and automation across various domains, e.g., vehicle interaction, healthcare, and agriculture [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-3">3</xref>]. Artificial Intelligence of Things (AIoT) networks continuously collect observed data and maintain seamless connectivity among devices and physical objects [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-5">5</xref>]. The integration of such technologies drives growth in modern ecosystems and fosters smarter interactions among research communities and industries [<xref ref-type="bibr" rid="ref-6">6</xref>&#x2013;<xref ref-type="bibr" rid="ref-8">8</xref>]. In recent decades, edge computing has enabled smart cities to access resources near source devices and to provide distributed computing with minimal overhead, while enabling effective resource management [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. AI-driven techniques and edge computing support timely decision-making for autonomous services and enable timely detection of malicious activities, leveraging existing security policies [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. Despite this, most proposed approaches still lack privacy-preserving, lightweight authentication mechanisms for adaptive environments, and thus are unable to address issues of fault tolerance and efficient bandwidth utilization [<xref ref-type="bibr" rid="ref-13">13</xref>&#x2013;<xref ref-type="bibr" rid="ref-15">15</xref>]. In addition, due to the rapid involvement of malicious devices in the IoT system over the insecure Internet, they are increasingly posing significant network threats, including involvement of untrusted devices, denial-of-service (DoS), and routing hole attacks [<xref ref-type="bibr" rid="ref-16">16</xref>&#x2013;<xref ref-type="bibr" rid="ref-18">18</xref>]. In this research, we present a framework that integrates AI and blockchain technologies to increase intelligence at both the device and edge levels. It reduces additional computational costs in the constraint applications, and the involvement of the SDN controller helps optimize the decision-making system. It mitigates threats even in the presence of faulty IoT devices and enhances network-wide communication security through an authentic, authorized, and trusted system. The major contributions of our work are provided as follows.
<list list-type="simple">
<list-item><label>i.</label>
<p>A trust-aware routing mechanism integrating blockchain technology with SDN programmability is proposed to improve energy efficiency and enable real-time decision-making for AIoT networks.</p></list-item>
<list-item><label>ii.</label>
<p>Dynamic trust computation using AI-driven behavioral analysis to continuously evaluate dynamic metrics, ensuring secure routing and minimizing route disruptions.</p></list-item>
<list-item><label>iii.</label>
<p>It improves and enhances the privacy, and strengthens resilience of IoT systems using an AI-powered anomaly detection mechanism and mitigates network threats.</p></list-item>
</list></p>
<p>The paper is structured into the following sub-sections. Related work is discussed in <xref ref-type="sec" rid="s2">Section 2</xref>. <xref ref-type="sec" rid="s3">Section 3</xref> explains the functionalities of the proposed framework. Performance analysis is done in <xref ref-type="sec" rid="s4">Section 4</xref>, and <xref ref-type="sec" rid="s5">Section 5</xref> provides the conclusion of our work with future directions.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>Wireless devices and sensors are interconnected to develop real-time AIoT applications and generate large amounts of environmental data [<xref ref-type="bibr" rid="ref-19">19</xref>,<xref ref-type="bibr" rid="ref-20">20</xref>]. In smart cities, security against malicious attacks is a demanding requirement in most existing approaches that involve IoT systems and edge processing. It leads to compromised network integrity and unauthorized access during data transmission and decision-making [<xref ref-type="bibr" rid="ref-21">21</xref>&#x2013;<xref ref-type="bibr" rid="ref-23">23</xref>]. Recent studies have explored blockchain for decentralized trust management [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>], SDN for network programmability and centralized policy enforcement [<xref ref-type="bibr" rid="ref-26">26</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>], and AI-driven approaches for threat detection and dynamic routing optimization [<xref ref-type="bibr" rid="ref-28">28</xref>,<xref ref-type="bibr" rid="ref-29">29</xref>]. However, most solutions often face scalability challenges, high computational costs, and limited end-to-end IoT security integration, motivating the need for a unified, lightweight framework. The proposed framework [<xref ref-type="bibr" rid="ref-30">30</xref>] integrates blockchain technology for decentralized, immutable data management, Artificial Intelligence for dynamic data analysis and threat detection, and advanced searchable encryption for secure, efficient queries. A patient-centered data access model that combines blockchain and trust chains enhances safety and efficiency, while also demonstrating a return on investment. The blockchain-based architecture ensures the integrity and immutability of medical data from IoMT devices, enabling decentralized, tamper-proof storage. In [<xref ref-type="bibr" rid="ref-31">31</xref>], the authors introduce a Free Node-based Routing Algorithm (FNRA) to provide efficient routing for the SIoT network. It compares the forwarding capabilities of relay and source nodes and distinguishes between in-community and out-of-community message forwarding. FNRA classifies devices into four structures and dynamically adopts forwarding strategies. The analysis of FNRA is evaluated through a range of experiments that demonstrate its superior performance compared to existing approaches. In [<xref ref-type="bibr" rid="ref-32">32</xref>], an Enhanced Energy Efficient Clustering and Routing protocol is proposed to address network issues. The protocol consists of three stages: selecting the best Cluster Head (CH) nodes using k-means clustering, designating a Super Cluster Head using an Adaptive Neuro Fuzzy Inference System, and determining the most energy-efficient multi-path routing strategy using the Black Widow Optimization algorithm. The proposed multi-level hierarchical secure and optimal routing (ML-HSOR) protocol [<xref ref-type="bibr" rid="ref-33">33</xref>] addresses network issues through four stages: registration, clustering, authentication, and optimal routing. Sensor nodes are registered with the base station using unique identities. A Markov model with adaptive weighting selects the optimal Cluster Head (CH) to improve network performance. Multi-level trust evaluation detects malicious nodes during authentication, and data transmission is optimized using the polarity learning-based chimp optimization algorithm (PL-COA). Authors [<xref ref-type="bibr" rid="ref-34">34</xref>] proposed BlockDLO, an IoT security approach combining blockchain technology with deep learning. The architecture consists of five phases: (1) network localization using chaotic map-based identification, (2) page rank-based clustering for edge computing, (3) shared-chain technique with deep distributed file system and Ethereum smart contracts for block creation and data security, (4) communication route optimization via page rank centrality, and (5) deep learning integration to detect malicious data using authenticated received data, forming an efficient intrusion detection system. In [<xref ref-type="bibr" rid="ref-35">35</xref>], the authors proposed a MANET-IoT architecture using Hybrid K-Mode Clustering (HKMC) for cluster building and Spider Monkey Optimization (SMO) to identify the optimal Cluster Head (CH). An Energy-aware Multi-Attribute Trust (EMAT) model, based on Multi-Agent Reinforcement Learning (MA-RL), computes trust values and selects optimal routes using the Secure &#x0026; Energy Score (SES) methodology. To enhance data security, a Multi-Attribute Cryptography (MAC) approach is introduced, improving energy efficiency and security in MANET-IoT environments. Authors of [<xref ref-type="bibr" rid="ref-36">36</xref>] present a novel multiobjective SDN-based framework for IoT sensors, ensuring end-to-end (E2E) QoS across multiple domains with heterogeneous traffic service classes (TSC). The framework employs a two-layer SDN architecture to manage QoS based on specific service demands. An optimal additive weighting module (OAWM) ranks TSCs and prioritizes service parameters such as delay, PLR, and jitter. At the same time, global controller statistics enable E2E QoS provisioning by mapping service requests from IoT sensors. <xref ref-type="table" rid="table-1">Table 1</xref> summarizes the significant contributions and limitations of existing approaches for IoT systems and for achieving data privacy and integrity.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of existing schemes</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Existing schemes</th>
<th>Limitations</th>
<th>Contributions</th>
</tr>
</thead>
<tbody>
<tr>
<td>AI-driven Trust Management System (AI-DTMS) with blockchain</td>
<td>Challenges related to scalability when integrating AI with blockchain, especially in large-scale IoT deployments</td>
<td>Combines AI and blockchain to enhance the security of IoT networks by enabling dynamic trust management.</td>
</tr>
<tr>
<td>Free Node-based Routing Algorithm (FNRA)</td>
<td>Potential performance issues arise in highly dynamic networks, especially when nodes frequently join or leave.</td>
<td>Optimizes routing in IoT networks by utilizing community structures and selecting the optimal nodes for message forwarding.</td>
</tr>
<tr>
<td>Federated Deep Reinforcement Learning (FDRL) for IoT-enabled WSNs</td>
<td>Devices&#x2019; efficient collaboration is limited due to the bounded resources and overhead.</td>
<td>Enables decentralized routing decision-making via federated deep reinforcement learning quality of servicet adapts to network conditions.</td>
</tr>
<tr>
<td>Enhanced Energy Efficient Clustering and Routing protocol</td>
<td>Multi phase routing increases complexity and network scalability.</td>
<td>Improves energy efficiency and routing performance by applying k-means clustering and Black Widow Optimization to select optimal paths.</td>
</tr>
<tr>
<td>Multi-Level Hierarchical Secure and Optimal Routing (ML-HSOR) protocol</td>
<td>Potential delays in trust evaluation can impact the overall system performance, especially in real-time applications.</td>
<td>Utilizes a multi-stage approach that incorporates trust evaluation and optimizes data transmission paths for enhanced security and efficiency.</td>
</tr>
<tr>
<td>BlockDLO: Blockchain and Deep Learning for IoT security</td>
<td>The integration of deep learning for intrusion detection introduces high computational costs and energy consumption.</td>
<td>Combines blockchain technology and deep learning for secure data transmission, intrusion detection, and data integrity in IoT systems.</td>
</tr>
<tr>
<td>MANET-IoT architecture with Energy-aware Multi-Attribute Trust (EMAT) model</td>
<td>Excessive overhead incurs the complexity in trust evaluation and route-selection mechanisms.</td>
<td>Improves energy efficiency and communication security in IoT networks.</td>
</tr>
<tr>
<td>Reliable Routing based on Reinforcement Learning in SD-IoT Networks (RRSN)</td>
<td>Determining appropriate values for weight factors and managing delay caused by SDN controllers.</td>
<td>Optimized QoS-aware reliable routing is proposed for SD-IoT networks, integrating intelligent routing techniques with SDN and ML.</td>
</tr>
<tr>
<td>Multiobjective SDN-based Framework for IoT Sensors</td>
<td>the management of multiple QoS goals within diverse network traffic leads to additional overheads.</td>
<td>Rank traffic classes and provides the priority to QoS factors improves network metrics in terms of delays, lost rate and delivery performance.</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3">
<label>3</label>
<title>Materials and Methods</title>
<p>The proposed framework models an IoT deployment with edge nodes and an SDN controller as a time-varying graph, where devices make routing decisions aided by blockchain-backed trust and AI-based anomaly detection. Let <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>v</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> denote IoT devices and edge nodes, and <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> the set of wireless links at time <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>t</mml:mi></mml:math></inline-formula>. Each node <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> has coordinates <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, residual energy <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>E</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>, transmit/receive electronics energy per bit <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mtext>elec</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>, and amplification factor <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mtext>&#x03B5;</mml:mtext><mml:mrow><mml:mtext>amp</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>; links have distance <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and one-hop latency <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>L</mml:mi><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>. The maximum radio range is <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula>, and packets have size <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>s</mml:mi></mml:math></inline-formula> bits. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the architectural flow among the developed phases of the proposed framework.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Phases of the proposed trust-aware SDN-driven AIoT model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-1.tif"/>
</fig>
<p>To establish connectivity in physical space, the distance <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> between two nodes, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>v</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, is defined as the Manhattan distance, expressed in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>d</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 stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>A link is considered available if the two nodes are within communication range of each other. The binary link indicator <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>a</mml:mi><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> captures the condition, as defined in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>a</mml:mi><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:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>otherwise.</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The energy to transmit <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>s</mml:mi></mml:math></inline-formula> bits over distance <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> follows a standard radio model with path-loss exponent <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>&#x03B3;</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mo>&#x2265;</mml:mo><mml:mspace width="negativethinmathspace" /><mml:mspace width="thinmathspace" /><mml:mn>2</mml:mn></mml:math></inline-formula>. The per-transmission energy is defined in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>, while the reception consumes only electronic energy, and the per-reception energy at node <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>v</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is given in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" 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:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="negativethinmathspace" /><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:mtext>elec</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mtext>&#x03B5;</mml:mtext><mml:mrow><mml:mrow><mml:mtext>amp</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" 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:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mrow><mml:mtext>elec</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>s</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The nodes&#x2019; residual energy is updated after a single transmit-receive exchange to track their lifetimes using <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>E</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:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>i</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>tx</mml:mtext></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>i</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext>rx</mml:mtext></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> is an indicator function that determines whether node <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>i</mml:mi></mml:math></inline-formula> transmitted or received during the current time slot. Specifically, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>i</mml:mi><mml:mtext>&#x00A0;tx</mml:mtext><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> subtracts the energy consumed by transmission <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>i</mml:mi><mml:mtext>&#x00A0;rx</mml:mtext><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> subtracts the energy consumed by reception <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
<p>In the proposed framework, the link reliability over a sliding window of <italic>W</italic> packets is measured as the successful delivery ratio, capturing short-term wireless quality. The reliability <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>R</mml:mi><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> is defined as the fraction of packets that were successfully received within the window and can be formulated using <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>R</mml:mi><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:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>W</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtext>pkt&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mi>W</mml:mi></mml:mfrac></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mo>&#x22AE;</mml:mo></mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> is an indicator function, and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow></mml:math></inline-formula> is the set of successfully received packets during time slot <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>. A node&#x2019;s local forwarding reliability aggregates its incident links to stabilize trust against fluctuations in the reliability of individual links. The neighborhood-averaged reliability is computed based on <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mover><mml:mi>R</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><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:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow></mml:mrow><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:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow></mml:mrow><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:mrow></mml:munder><mml:msub><mml:mi>R</mml:mi><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></disp-formula>where <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mrow><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow></mml:mrow><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:mo fence="false" stretchy="false">{</mml:mo><mml:mi>j</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>a</mml:mi><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:mn>1</mml:mn><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> is the neighbor set.</p>
<p>In addition, the proposed framework integrates blockchain to contribute an auditable record of behavior. Let <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>B</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> represent the blockchain-derived trust component for node <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>i</mml:mi></mml:math></inline-formula>, which is updated using exponential smoothing based on the ratio of valid on-chain events. The trust update is given in <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>B</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:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>V</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:mrow><mml:mrow><mml:msub><mml:mi>T</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:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is the smoothing factor, <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mi>V</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> is the number of valid events for node <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>i</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>t</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>T</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> is the total number of events for node <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>i</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>t</mml:mi></mml:math></inline-formula>. Each block <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>k</mml:mi></mml:math></inline-formula> records the hashed state and transactions to ensure immutability. With the previous block&#x2019;s hash <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>, timestamp <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>, node set digest <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:msub><mml:mi>S</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>, and transaction list <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>T</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>, the block hash is computed as given in <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>.
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>h</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2225;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2225;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2225;</mml:mo><mml:mi>T</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2225;</mml:mo><mml:msub><mml:mrow><mml:mtext>nonce</mml:mtext></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>H</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is a cryptographic hash function, and <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mo>&#x2225;</mml:mo></mml:math></inline-formula> denotes concatenation.</p>
<p>The proposed framework explores Proof of Authority (PoA) as the consensus algorithm for establishing and maintaining the blockchain network. The following parameters are considered for blockchain operations:
<list list-type="simple">
<list-item><label>i.</label>
<p>A time needed to generate a new block is denoted by Block Time (<inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mtext>block</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>) and varies based on the network conditions and consensus algorithm. It is typically fixed for PoA, but can change with realistic, distributed loads.</p></list-item>
<list-item><label>ii.</label>
<p>Block Size (<inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mtext>block</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula>) is a dynamic parameter, and it contains collected data from IoT devices.</p></list-item>
<list-item><label>iii.</label>
<p>Block Verification Time (<inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mtext>verify</mml:mtext></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 a dynamic parameter, and it represents the time while verifying a newly created block. Verification depends on network conditions, block size, and required computational power.</p></list-item>
<list-item><label>iv.</label>
<p>Broadcast Time (<inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mtext>broadcast</mml:mtext></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>) denotes the time for flooding the blocks to all devices. Due to network conditions, latency, topology, etc., the value of this parameter varies.</p></list-item>
</list></p>
<p>Thus, the blockchain overhead <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mtext>BC</mml:mtext></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 sum of the block verification and broadcast times as given in <xref ref-type="disp-formula" rid="eqn-10">Eqs. (10)</xref> to <xref ref-type="disp-formula" rid="eqn-12">(12)</xref>.
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" 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:mtd><mml:mrow><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mrow><mml:mtext>verify</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mrow><mml:mtext>verify</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" 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:mtd><mml:mrow><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mrow><mml:mtext>broadcast</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mrow><mml:mtext>broadcast</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" 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:mtd><mml:mrow><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mrow><mml:mtext>BC</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mrow><mml:mtext>verify</mml:mtext></mml:mrow></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:msub><mml:mi>O</mml:mi><mml:mrow><mml:mrow><mml:mtext>broadcast</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Edge-hosted AI assigns an anomaly score <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><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> using logistic regression [<xref ref-type="bibr" rid="ref-37">37</xref>] to each node based on its feature vector <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">f</mml:mtext></mml:mrow><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>, which can include metrics like inter-arrival variance, drop burst, and trust transition. The score is computed using a logistic regression head on an encoder function <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> as given in <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>.
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><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:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>w</mml:mi><mml:mi mathvariant="normal">&#x22A4;</mml:mi></mml:msup><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</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:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the sigmoid function, defined as given in <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>.
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>z</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>z</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>The trust score <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi>T</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> of node <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>i</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>t</mml:mi></mml:math></inline-formula> is computed as a combination of node reliability <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mover><mml:mi>R</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><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>, blockchain-derived trust <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msub><mml:mi>B</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 anomaly score <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><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>, subject to <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, as defined in <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref>.
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>T</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>&#x2208;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mover><mml:mi>R</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><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>&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mi>B</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>&#x03B2;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</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 stretchy="false">)</mml:mo><mml:mo>&#x2223;</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>It represents the trust score <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mi>T</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> of node <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>i</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>t</mml:mi></mml:math></inline-formula>, where <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msub><mml:mover><mml:mi>R</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><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> denotes the reliability or reputation of node <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>i</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:msub><mml:mi>B</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> represents the blockchain-derived trust component for node <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>i</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><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> is the anomaly score, indicating the likelihood of abnormal behavior, subject to the constraint <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. The node reliability <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mover><mml:mi>R</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><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>, blockchain-derived trust <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mi>B</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 anomaly score <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><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> are integrated to compute the trust score <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi>T</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> of node <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>i</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>t</mml:mi></mml:math></inline-formula>, while <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>.</p>
<p>Also the proposed framework determines link-wise latency <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msub><mml:mi>L</mml:mi><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>, and it the combination of transmission (<inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mtext>tx</mml:mtext></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>) that represents the associated with the link from device <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>i</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>j</mml:mi></mml:math></inline-formula> at time <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>t</mml:mi></mml:math></inline-formula>, propagation (<inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mtext>prop</mml:mtext></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>) that measures the time taken in traveling the signal from device <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>i</mml:mi></mml:math></inline-formula> to device <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>j</mml:mi></mml:math></inline-formula>, queuing (<inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mtext>queue</mml:mtext></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>) measures a time that a packet waits in the queue for for transmission, and processing delays (<inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mtext>proc</mml:mtext></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>) indicates the time needed for the data to be processed, as shown in <xref ref-type="disp-formula" rid="eqn-16">Eq. (16)</xref>.
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:msub><mml:mi>L</mml:mi><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:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>tx</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>prop</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>queue</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>proc</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-17">Eq. (17)</xref>, a composite cost is computed by penalizing the factors such as delay, low energy, low trust, and blockchain overhead. The weighted parameters <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula> are combined with the parameters for balanced contribution such that (<inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>&#x03B3;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>&#x03B4;</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>).
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mrow><mml:msub><mml:mi>w</mml:mi><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:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>L</mml:mi><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:mi>&#x03B2;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>E</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:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>T</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:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mrow><mml:mtext>BC</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Delay of the link between nodes <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:mi>i</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:mi>j</mml:mi></mml:math></inline-formula> is denoted by <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:msub><mml:mi>L</mml:mi><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>r, the energy depletion represents by <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:msub><mml:mi>E</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>, <inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:msub><mml:mi>T</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 trust score, and blockchain overhead is denoted by <inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mtext>BC</mml:mtext></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>. Also, to avoid undefined values in computations, a small constant <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula> is introduced. At the end, SDN determines the minimum-cost route under the current state as given in <xref ref-type="disp-formula" rid="eqn-18">Eq. (18)</xref> for a path <italic>P</italic>.
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x22C6;</mml:mo></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><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>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi>&#x1D4AB;</mml:mi></mml:mrow></mml:mrow></mml:munder><mml:mtext>&#x00A0;&#x00A0;</mml:mtext><mml:mi>C</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="2em" /><mml:mi>C</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2208;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>w</mml:mi><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></disp-formula></p>
<p>To ensure end-to-end service guarantees, the data-plane delay of the selected route is monitored and sent back to the controller for reconfiguration, as given in <xref ref-type="disp-formula" rid="eqn-19">Eq. (19)</xref>.
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>e2e</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x22C6;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x22C6;</mml:mo></mml:msup></mml:mrow></mml:munder><mml:msub><mml:mi>L</mml:mi><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></disp-formula>where <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mtext>e2e</mml:mtext></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x22C6;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the total delay of the selected route <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x22C6;</mml:mo></mml:msup></mml:math></inline-formula> at time <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:mi>t</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:msub><mml:mi>L</mml:mi><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> is the delay on the link between nodes <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:mi>i</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mi>j</mml:mi></mml:math></inline-formula>. <xref ref-type="table" rid="table-2">Table 2</xref> summarizes the definitions and values of the key parameters used in the tests.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Definitions and values of parameters used in the tests</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Value/Range</th>
</tr>
</thead>
<tbody>
<tr>
<td>Window size</td>
<td>200 samples</td>
</tr>
<tr>
<td>Smoothing factor (<inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>)</td>
<td>0.5</td>
</tr>
<tr>
<td>Trust threshold (<inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>)</td>
<td>0.7</td>
</tr>
<tr>
<td>Coefficient for average reputation (<inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>)</td>
<td>0.4</td>
</tr>
<tr>
<td>Coefficient for belief (<inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula>)</td>
<td>0.3</td>
</tr>
<tr>
<td>Coefficient for activity (<inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula>)</td>
<td>0.3</td>
</tr>
<tr>
<td>Error term (<inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula>)</td>
<td>0.05</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Algorithm 1 computes trust for IoT devices using blockchain technology to achieve more reliable, trustworthy communication. It enables distributed route establishment and lightweight computing while incurring the least overhead on the IoT system. <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>V</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is used to evaluate the time complexity, where |<italic>V</italic> | represents the number of nodes. Algorithm 2 governs the optimization of task distribution across network edges and provides energy-efficient communication integrated blockchain technology. <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>V</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is used for time complexity to validate the block, where |<italic>N</italic>| is the number of edge nodes and |<italic>V</italic> | is the number of trusted nodes.</p>
<fig id="fig-10">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-10.tif"/>
</fig>
<fig id="fig-11">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-11.tif"/>
</fig>
</sec>
<sec id="s4">
<label>4</label>
<title>Simulation Description</title>
<p>This section presents the experimental results of the proposed framework as compared to FNRA [<xref ref-type="bibr" rid="ref-31">31</xref>] and ML-HSOR [<xref ref-type="bibr" rid="ref-33">33</xref>], conducted using the NS-3 simulator. The deployed environment is composed of edge devices, IoT sensors, SDN controller, and sink nodes. IoT devices are resource-constrained, with static edges, limited processing power for intensive computing, and limited support for other resources. SDN controllers act as centralized managers, collecting global information about devices and optimizing decision-making. The dimension area is fixed to 2000 m <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:mo>&#x00D7;</mml:mo></mml:math></inline-formula> 2000 m, with 10&#x2013;50 malicious devices, and 100&#x2013;1000 sensors. The parameters considered for evaluating performance in a simulated environment are illustrated in <xref ref-type="table" rid="table-3">Table 3</xref>.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Simulation parameters</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Value</th>
</tr>
</thead>
<tbody>
<tr>
<td>Simulation area</td>
<td><inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mn>2000</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mn>2000</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>Number of sensors</td>
<td>100 to 1000</td>
</tr>
<tr>
<td>Initial energy</td>
<td>5J per sensor</td>
</tr>
<tr>
<td>Malicious devices</td>
<td>10 to 50</td>
</tr>
<tr>
<td>Number of simulations</td>
<td>50 runs</td>
</tr>
<tr>
<td>Reputation weight (<inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula>)</td>
<td>0.3</td>
</tr>
<tr>
<td>Activity weight (<inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>)</td>
<td>0.2</td>
</tr>
<tr>
<td>Packet size</td>
<td>256 bits</td>
</tr>
<tr>
<td>Decay factor (<inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>)</td>
<td>0.7</td>
</tr>
<tr>
<td>Edge devices</td>
<td>40</td>
</tr>
<tr>
<td>Analyzing scenarios</td>
<td>Varying network load and connection time</td>
</tr>
<tr>
<td>SDN controllers</td>
<td>2</td>
</tr>
<tr>
<td>Neighbor weight (<inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula>)</td>
<td>0.5</td>
</tr>
<tr>
<td>Trust threshold (<inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>)</td>
<td>0.8</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s4_1">
<label>4.1</label>
<title>Analysis for Varying Connection Time</title>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> demonstrates the performance evaluation of the proposed framework and existing approaches in terms of energy consumption over varying connection time. The results reveal an average improvement of 44% for the proposed framework. It is due to intelligent routing enabled by SDN, which reduces additional retransmissions among devices. Also, dynamic trust-aware evaluation increases confidence among devices and aligns communication more stably with the support of multiple parameters. Moreover, it dynamically updates trust scores to improve communication reliability upon fault detection in an IoT environment. The system&#x2019;s optimal decision-making enhances efficient resource management and ultimately results in the least energy consumption in crucial areas. The results of the data transfer rate analysis are depicted in <xref ref-type="fig" rid="fig-3">Fig. 3</xref> for the proposed framework and existing solutions. Based on the analysis, the proposed framework significantly improved data transfer rate by an average of 47%. It is because of considering dynamic attributes for detecting network threats while imposing the least communication overhead. In addition, the updation of established routes by reevaluating the quality of service factors decreases congestion on the forwarders and enhances the functionality of data forwarding. Trust computing also provides a more reliable process for route selection, which helps maintain a consistent communication system. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> measures and evaluates the performance of the proposed framework for packet loss rate under varying connection times. Based on the statistical analysis, the proposed framework reduces packet loss relative to relevant approaches by an average of 49%. It is due to the integration of artificial intelligence techniques and the SDN controller&#x2019;s controllability. Moreover, the edges are more robust at detecting malicious threats, with prompt trust evaluation and continuous reevaluation based on behavior and network conditions. In addition, the reliable detection of communication anomalies with trust penalties and block-wise authentication reduces the number of malicious packets in the network, thereby enabling only verified device participation and optimizing data flow with greater accuracy via fault-tolerant links. The performance of response time under varying connection counts is depicted in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> for the proposed framework and existing approaches. The remarkable improvement of 42% on average has been observed for the proposed framework. It is due to the intelligent learning technique, which considers different device conditions and effective load distribution along the established routes. It maintains route stability for a more extended period and improves the timely response to requested nodes. Unlike other approaches, the SDN controller serves as a centralized hub for the proposed framework and continually monitors network behavior. In case any anomaly is detected, the routes are reformulated to improve the system&#x2019;s responsiveness.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Impact of varying connection time on energy consumption</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-2.tif"/>
</fig><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Impact of varying connection time on data transfer rate</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-3.tif"/>
</fig><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Impact of varying connection time on packet loss ratio</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Impact of varying connection time on response time</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-5.tif"/>
</fig>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Analysis for Varying Network Load</title>
<p>As shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, the proposed framework exhibits a substantial improvement in energy efficiency across different network loads, achieving an average enhancement of 52% compared to existing solutions. This is made possible by the intelligent routing mechanism, which supports data-forwarding decisions based on trustworthy devices and integrates them via an authentic, blockchain-assisted scheme. During the prediction phase, the next hop is selected by exploring trusted edges while continuously monitoring network metrics, thereby balancing load across links. This ensures optimal decisions, improves route stability, and strengthens the resilience of the innovative system. By leveraging the robustness of the SDN controller and incorporating network feedback, the proposed framework enables lightweight operations. It ensures efficient communication services for resource optimization, ultimately improving energy utilization in the IoT network. In <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the proposed framework is compared with existing approaches in terms of data transfer rate across varying network load. The results highlight notable improvements of 41% in the delivery of data packets over the unpredictable environment. These improvements are attributed to the use of dynamic trust computation during route and channel selection, combined with authentic and secure blockchain validation. By optimizing learning patterns and establishing energy-aware, authenticated forwarding routes, the proposed framework achieves stronger, more reliable connectivity, even under the influence of malicious nodes. In addition, the routing costs are updated regularly based on dynamic conditions, providing more reliable paths for forwarding IoT data. The performance evaluation of the proposed framework and related studies is depicted in <xref ref-type="fig" rid="fig-8">Fig. 8</xref> over varying network load. Based on the results, the proposed framework significantly enables the timely detection of malicious activities through trust-aware computing. The trust scores are dynamically updated using network behavior and realistic conditions. In addition, the devices are mutually authentic based on the history and only authorize access to reliable connections. The SDN controller effectively manages resources and meets application demands on time. The reliable connections are frequently updated, and up-to-date information about the channels is maintained for further analysis. This continuous re-evaluation provides energy-efficient routes and long-term stable connections to increase the delivery ratio of data packets in real-time systems. In <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, the performance analysis of response time for the proposed framework and existing approaches is presented. Based on the results, the proposed framework improves the system&#x2019;s response time by an average of 50% with the support of network edges and trusted devices. It reduces the additional overhead on devices and the number of incoming requests for faulty devices to process data packets at the edges. The data routes are selected and maintained using dynamic network factors, which leads to lower processing power for the constraint devices and improves the overall efficacy of the communication system.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Impact of varying network load on energy consumption</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-6.tif"/>
</fig><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Impact of varying network load on data transfer rate</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-7.tif"/>
</fig><fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Impact of varying network load on packet loss ratio</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-8.tif"/>
</fig><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Impact of varying network load on response time</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_73039-fig-9.tif"/>
</fig>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>Real-time applications play a vital role in sensing and processing the collected data from the observed environment. IoT, along with emerging technologies, has led to the development and growth of smart cities. These systems are composed of sensors and many physical objects deployed in the sensing field to periodically gather data and forward it to the edge/cloud for further analysis in harsh environments. This research proposed a blockchain-assisted framework integrated with AI techniques to optimize network performance and security. In addition, intelligence is provided at the edges via lightweight computing to enhance decision-making and evenly distribute load across data forwarders and constraint devices. The network behavior and device conditions are frequently reevaluated for dynamic trust computation, thereby offering a more trustworthy system even in the presence of malicious threats. The consideration of multiple factors in route selection involves addressing energy holes across network boundaries by efficiently maintaining routes. In future work, we intend to incorporate a deep learning model to improve system stability under dynamic conditions and enhance distributed threat detection, thereby enhancing the security of the proposed framework in a large-scale IoT system.</p>
</sec>
</body>
<back>
<ack>
<p>The authors gratefully acknowledge the financial support from the Deanship of Graduate Studies and Scientific Research at Jouf University.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was funded by the Deanship of Graduate Studies and Scientific Research at Jouf University under grant No. DGSSR-2025-02-01669.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Conceptualization, Mekhled Alharbi, Mamoona Humayun; Formal analysis, Mekhled Alharbi, Mamoona Humayun; Methodology, Mamoona Humayun, Khalid Haseeb; Supervision, Mamoona Humayun, Mekhled Alharbi; Validation, Mekhled Alharbi, Khalid Haseeb; Writing&#x2014;original draft, Mekhled Alharbi, Khalid Haseeb; Writing&#x2014;review &#x0026; editing, Mekhled Alharbi, Mamoona Humayun. 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>Data available on request from the authors.</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="journal"><person-group person-group-type="author"><string-name><surname>Zeng</surname> <given-names>F</given-names></string-name>, <string-name><surname>Pang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Tang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Sensors on Internet of Things systems for the sustainable development of smart cities: a systematic literature review</article-title>. <source>Sensors</source>. <year>2024</year>;<volume>24</volume>(<issue>7</issue>):<fpage>2074</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s24072074</pub-id>; <pub-id pub-id-type="pmid">38610286</pub-id></mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fadhel</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Duhaim</surname> <given-names>AM</given-names></string-name>, <string-name><surname>Saihood</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sewify</surname> <given-names>A</given-names></string-name>, <string-name><surname>Al-Hamadani</surname> <given-names>MN</given-names></string-name>, <string-name><surname>Albahri</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Comprehensive systematic review of information fusion methods in smart cities and urban environments</article-title>. <source>Inf Fusion</source>. <year>2024</year>;<volume>107</volume>:<fpage>102317</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inffus.2024.102317</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>Alshammeri</surname> <given-names>M</given-names></string-name>, <string-name><surname>Humayun</surname> <given-names>M</given-names></string-name>, <string-name><surname>Haseeb</surname> <given-names>K</given-names></string-name>, <string-name><surname>Alwakid</surname> <given-names>GN</given-names></string-name></person-group>. <article-title>AI-driven sentiment-enhanced secure IoT communication model using resilience behavior analysis</article-title>. <source>Comput Mater Contin</source>. <year>2025</year>;<volume>84</volume>(<issue>1</issue>):<fpage>433</fpage>&#x2013;<lpage>46</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2025.065660</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>Yamini</surname> <given-names>B</given-names></string-name>, <string-name><surname>Pradeep</surname> <given-names>G</given-names></string-name>, <string-name><surname>Kalaiyarasi</surname> <given-names>D</given-names></string-name>, <string-name><surname>Jayaprakash</surname> <given-names>M</given-names></string-name>, <string-name><surname>Janani</surname> <given-names>G</given-names></string-name>, <string-name><surname>Uthayakumar</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Theoretical study and analysis of advanced wireless sensor network techniques in Internet of Things (IoT)</article-title>. <source>Meas Sens</source>. <year>2024</year>;<volume>33</volume>:<fpage>101098</fpage>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Magara</surname> <given-names>T</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Internet of things (IoT) of smart homes: privacy and security</article-title>. <source>J Electr Comput Eng</source>. <year>2024</year>;<volume>2024</volume>(<issue>1</issue>):<fpage>7716956</fpage>. doi:<pub-id pub-id-type="doi">10.1155/2024/7716956</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>Kumar</surname> <given-names>V</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>F</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>F</given-names></string-name>, <string-name><surname>Karri</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Seamless wireless communication platform for Internet of Things applications</article-title>. <source>IEEE Wireless Commun</source>. <year>2022</year>;<volume>30</volume>(<issue>6</issue>):<fpage>102</fpage>&#x2013;<lpage>10</lpage>. doi:<pub-id pub-id-type="doi">10.1109/mwc.006.2200097</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Albouq</surname> <given-names>SS</given-names></string-name>, <string-name><surname>Abi Sen</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Almashf</surname> <given-names>N</given-names></string-name>, <string-name><surname>Yamin</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alshanqiti</surname> <given-names>A</given-names></string-name>, <string-name><surname>Bahbouh</surname> <given-names>NM</given-names></string-name></person-group>. <article-title>A survey of interoperability challenges and solutions for dealing with them in IoT environment</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>36416</fpage>&#x2013;<lpage>28</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2022.3162219</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>Alwakid</surname> <given-names>GN</given-names></string-name>, <string-name><surname>Humayun</surname> <given-names>M</given-names></string-name>, <string-name><surname>Haseeb</surname> <given-names>K</given-names></string-name>, <string-name><surname>Shafique</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Real-time e-health framework for efficient AI-driven disability monitoring using secured Internet of Medical Things</article-title>. <source>Computing</source>. <year>2025</year>;<volume>107</volume>(<issue>8</issue>):<fpage>163</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s00607-025-01519-7</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>Sharma</surname> <given-names>M</given-names></string-name>, <string-name><surname>Tomar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Hazra</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Edge computing for industry 5.0: fundamental, applications, and research challenges</article-title>. <source>IEEE Internet of Things J</source>. <year>2024</year>;<volume>11</volume>(<issue>11</issue>):<fpage>19070</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jiot.2024.3359297</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>Oliveira</surname> <given-names>F</given-names></string-name>, <string-name><surname>Costa</surname> <given-names>DG</given-names></string-name>, <string-name><surname>Assis</surname> <given-names>F</given-names></string-name>, <string-name><surname>Silva</surname> <given-names>I</given-names></string-name></person-group>. <article-title>Internet of Intelligent Things: a convergence of embedded systems, edge computing and machine learning</article-title>. <source>Internet Things</source>. <year>2024</year>;<volume>26</volume>:<fpage>101153</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.iot.2024.101153</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>Rong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Mao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>H</given-names></string-name>, <string-name><surname>He</surname> <given-names>X</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Edge computing enabled large-scale traffic flow prediction with GPT in intelligent autonomous transport system for 6G network</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2024</year>;<volume>26</volume>:<fpage>17321</fpage>&#x2013;<lpage>38</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tits.2024.3456890</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>Ficili</surname> <given-names>I</given-names></string-name>, <string-name><surname>Giacobbe</surname> <given-names>M</given-names></string-name>, <string-name><surname>Tricomi</surname> <given-names>G</given-names></string-name>, <string-name><surname>Puliafito</surname> <given-names>A</given-names></string-name></person-group>. <article-title>From sensors to data intelligence: leveraging IoT, cloud, and edge computing with AI</article-title>. <source>Sensors</source>. <year>2025</year>;<volume>25</volume>(<issue>6</issue>):<fpage>1763</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s25061763</pub-id>; <pub-id pub-id-type="pmid">40292910</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>Fouda</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Fadlullah</surname> <given-names>ZM</given-names></string-name>, <string-name><surname>Ibrahem</surname> <given-names>MI</given-names></string-name>, <string-name><surname>Kato</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Privacy-preserving data-driven learning models for emerging communication networks: a comprehensive survey</article-title>. <source>IEEE Commun Surv Tutor</source>. <year>2025</year>;<volume>27</volume>(<issue>4</issue>):<fpage>2505</fpage>&#x2013;<lpage>42</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Feretzakis</surname> <given-names>G</given-names></string-name>, <string-name><surname>Papaspyridis</surname> <given-names>K</given-names></string-name>, <string-name><surname>Gkoulalas-Divanis</surname> <given-names>A</given-names></string-name>, <string-name><surname>Verykios</surname> <given-names>VS</given-names></string-name></person-group>. <article-title>Privacy-preserving techniques in generative AI and large language models: a narrative review</article-title>. <source>Information</source>. <year>2024</year>;<volume>15</volume>(<issue>11</issue>):<fpage>697</fpage>. doi:<pub-id pub-id-type="doi">10.3390/info15110697</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>Menon</surname> <given-names>UV</given-names></string-name>, <string-name><surname>Kumaravelu</surname> <given-names>VB</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>CV</given-names></string-name>, <string-name><surname>Rammohan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chinnadurai</surname> <given-names>S</given-names></string-name>, <string-name><surname>Venkatesan</surname> <given-names>R</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>AI-powered IoT: a survey on integrating artificial intelligence with IoT for enhanced security, efficiency, and smart applications</article-title>. <source>IEEE Access</source>. <year>2025</year>;<volume>13</volume>:<fpage>50296</fpage>&#x2013;<lpage>339</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2025.3551750</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bergies</surname> <given-names>S</given-names></string-name>, <string-name><surname>Aljohani</surname> <given-names>TM</given-names></string-name>, <string-name><surname>Su</surname> <given-names>SF</given-names></string-name>, <string-name><surname>Elsisi</surname> <given-names>M</given-names></string-name></person-group>. <article-title>An IoT-based deep-learning architecture to secure automated electric vehicles against cyberattacks and data loss</article-title>. <source>IEEE Trans Syst Man Cybern Syst</source>. <year>2024</year>;<volume>54</volume>(<issue>9</issue>):<fpage>5717</fpage>&#x2013;<lpage>32</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tsmc.2024.3409314</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abbas</surname> <given-names>S</given-names></string-name>, <string-name><surname>Bouazzi</surname> <given-names>I</given-names></string-name>, <string-name><surname>Ojo</surname> <given-names>S</given-names></string-name>, <string-name><surname>Al Hejaili</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sampedro</surname> <given-names>GA</given-names></string-name>, <string-name><surname>Almadhor</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Evaluating deep learning variants for cyber-attacks detection and multi-class classification in IoT networks</article-title>. <source>PeerJ Comput Sci</source>. <year>2024</year>;<volume>10</volume>:<fpage>e1793</fpage>. doi:<pub-id pub-id-type="doi">10.7717/peerj-cs.1793</pub-id>; <pub-id pub-id-type="pmid">38259893</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>Kumar</surname> <given-names>G</given-names></string-name>, <string-name><surname>Alqahtani</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Machine learning techniques for intrusion detection systems in SDN-recent advances, challenges and future directions</article-title>. <source>Comput Model Eng Sci</source>. <year>2023</year>;<volume>134</volume>(<issue>1</issue>):<fpage>89</fpage>&#x2013;<lpage>119</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2022.020724</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>Bhatt</surname> <given-names>K</given-names></string-name>, <string-name><surname>Agrawal</surname> <given-names>C</given-names></string-name>, <string-name><surname>Bisen</surname> <given-names>AM</given-names></string-name></person-group>. <article-title>A review on emerging applications of IoT and sensor technology for industry 4.0</article-title>. <source>Wireless Personal Commun</source>. <year>2024</year>;<volume>134</volume>(<issue>4</issue>):<fpage>2371</fpage>&#x2013;<lpage>89</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11277-024-11054-x</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>Abdulhussain</surname> <given-names>SH</given-names></string-name>, <string-name><surname>Mahmmod</surname> <given-names>BM</given-names></string-name>, <string-name><surname>Alwhelat</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shehada</surname> <given-names>D</given-names></string-name>, <string-name><surname>Shihab</surname> <given-names>ZI</given-names></string-name>, <string-name><surname>Mohammed</surname> <given-names>HJ</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A comprehensive review of sensor technologies in IoT: technical aspects, challenges, and future directions</article-title>. <source>Computers</source>. <year>2025</year>;<volume>14</volume>(<issue>8</issue>):<fpage>342</fpage>. doi:<pub-id pub-id-type="doi">10.3390/computers14080342</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>Aouedi</surname> <given-names>O</given-names></string-name>, <string-name><surname>Vu</surname> <given-names>TH</given-names></string-name>, <string-name><surname>Sacco</surname> <given-names>A</given-names></string-name>, <string-name><surname>Nguyen</surname> <given-names>DC</given-names></string-name>, <string-name><surname>Piamrat</surname> <given-names>K</given-names></string-name>, <string-name><surname>Marchetto</surname> <given-names>G</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A survey on intelligent Internet of Things: applications, security, privacy, and future directions</article-title>. <source>IEEE Commun Surv Tutor</source>. <year>2025</year>;<volume>27</volume>(<issue>2</issue>):<fpage>1238</fpage>&#x2013;<lpage>92</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Golpayegani</surname> <given-names>F</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>N</given-names></string-name>, <string-name><surname>Afraz</surname> <given-names>N</given-names></string-name>, <string-name><surname>Gyamfi</surname> <given-names>E</given-names></string-name>, <string-name><surname>Malekjafarian</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sch&#x00E4;fer</surname> <given-names>D</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Adaptation in edge computing: a review on design principles and research challenges</article-title>. <source>ACM Trans Autonomous and Adaptive Syst</source>. <year>2024</year>;<volume>19</volume>(<issue>3</issue>):<fpage>1</fpage>&#x2013;<lpage>43</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3664200</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>Ahmed</surname> <given-names>M</given-names></string-name>, <string-name><surname>Soofi</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Raza</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>F</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>WU</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A comprehensive survey on RIS-enhanced physical layer security in UAV-assisted networks</article-title>. <source>IEEE Internet of Things J</source>. <year>2025</year>;<volume>12</volume>(<issue>16</issue>):<fpage>32538</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jiot.2025.3569716</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>Islam</surname> <given-names>R</given-names></string-name>, <string-name><surname>Bose</surname> <given-names>R</given-names></string-name>, <string-name><surname>Roy</surname> <given-names>S</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Sutradhar</surname> <given-names>S</given-names></string-name>, <string-name><surname>Das</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Decentralized trust framework for smart cities: a blockchain-enabled cybersecurity and data integrity model</article-title>. <source>Sci Rep</source>. <year>2025</year>;<volume>15</volume>(<issue>1</issue>):<fpage>23454</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-025-06405-y</pub-id>; <pub-id pub-id-type="pmid">40603417</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>Shi</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Blockchain-aided decentralized trust management of edge computing: toward reliable off-chain and on-chain trust</article-title>. <source>IEEE Netw</source>. <year>2024</year>;<volume>38</volume>(<issue>5</issue>):<fpage>182</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1109/mnet.2024.3399270</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>Bringhenti</surname> <given-names>D</given-names></string-name>, <string-name><surname>Yusupov</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zarca</surname> <given-names>AM</given-names></string-name>, <string-name><surname>Valenza</surname> <given-names>F</given-names></string-name>, <string-name><surname>Sisto</surname> <given-names>R</given-names></string-name>, <string-name><surname>Bernabe</surname> <given-names>JB</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Automatic, verifiable and optimized policy-based security enforcement for SDN-aware IoT networks</article-title>. <source>Comput Netw</source>. <year>2022</year>;<volume>213</volume>:<fpage>109123</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comnet.2022.109123</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>Priyadarsini</surname> <given-names>M</given-names></string-name>, <string-name><surname>Bera</surname> <given-names>P</given-names></string-name>, <string-name><surname>Das</surname> <given-names>SK</given-names></string-name>, <string-name><surname>Rahman</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>A security enforcement framework for SDN controller using game theoretic approach</article-title>. <source>IEEE Trans Dependable Secur Comput</source>. <year>2022</year>;<volume>20</volume>(<issue>2</issue>):<fpage>1500</fpage>&#x2013;<lpage>15</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tdsc.2022.3158690</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>Kavitha</surname> <given-names>D</given-names></string-name>, <string-name><surname>Thejas</surname> <given-names>S</given-names></string-name></person-group>. <article-title>AI enabled threat detection: leveraging artificial intelligence for advanced security and cyber threat mitigation</article-title>. <source>IEEE Access</source>. <year>2024</year>;<volume>12</volume>:<fpage>173127</fpage>&#x2013;<lpage>36</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2024.3493957</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>Villegas-Ch</surname> <given-names>W</given-names></string-name>, <string-name><surname>Govea</surname> <given-names>J</given-names></string-name>, <string-name><surname>Gurierrez</surname> <given-names>R</given-names></string-name>, <string-name><surname>Mera-Navarrete</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Optimizing security in IoT ecosystems using hybrid artificial intelligence and blockchain models: a scalable and efficient approach for threat detection</article-title>. <source>IEEE Access</source>. <year>2025</year>;<volume>13</volume>:<fpage>16933</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2025.3532800</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>Khan</surname> <given-names>S</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>M</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>K</given-names></string-name></person-group>. <article-title>A blockchain-enabled AI-driven secure searchable encryption framework for medical IoT systems</article-title>. <source>IEEE J Bio Health Inform</source>. doi:<pub-id pub-id-type="doi">10.1109/JBHI.2025.3538623</pub-id>; <pub-id pub-id-type="pmid">40048336</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>Xu</surname> <given-names>F</given-names></string-name>, <string-name><surname>Lyu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ahmed</surname> <given-names>M</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Deng</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>W</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Improving routing performance in social internet of things with FNRA: the free node-based approach</article-title>. <source>Alexandria Eng J</source>. <year>2024</year>;<volume>88</volume>:<fpage>68</fpage>&#x2013;<lpage>79</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.aej.2024.01.010</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>Senkumar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Arafat</surname> <given-names>IS</given-names></string-name>, <string-name><surname>Nathiya</surname> <given-names>R</given-names></string-name>, <string-name><surname>Nishath</surname> <given-names>SH</given-names></string-name></person-group>. <article-title>Enhanced energy efficient clustering and routing algorithm in wireless sensor network</article-title>. <source>Wireless Personal Commun</source>. <year>2024</year>;<volume>138</volume>(<issue>3</issue>):<fpage>1531</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11277-024-11549-7</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>Sharma</surname> <given-names>V</given-names></string-name>, <string-name><surname>Beniwal</surname> <given-names>R</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>V</given-names></string-name></person-group>. <article-title>Multi-level trust-based secure and optimal IoT-WSN routing for environmental monitoring applications</article-title>. <source>J Supercomput</source>. <year>2024</year>;<volume>80</volume>(<issue>8</issue>):<fpage>11338</fpage>&#x2013;<lpage>81</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11227-023-05875-z</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>Kokila</surname> <given-names>M</given-names></string-name>, <string-name><surname>Reddy</surname> <given-names>KS</given-names></string-name></person-group>. <article-title>BlockDLO: blockchain computing with deep learning orchestration for secure data communication in IoT Environment</article-title>. <source>IEEE Access</source>. <year>2024</year>;<volume>12</volume>:<fpage>134521</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2024.3462735</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>Aravindan</surname> <given-names>S</given-names></string-name>, <string-name><surname>Rajaram</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Energy-aware multi-attribute trust modal for secure MANET-IoT environment</article-title>. <source>Multimed Tools Appl</source>. <year>2024</year>;<volume>83</volume>(<issue>38</issue>):<fpage>85637</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11042-024-20075-4</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>Ali</surname> <given-names>J</given-names></string-name>, <string-name><surname>Song</surname> <given-names>HH</given-names></string-name>, <string-name><surname>Roh</surname> <given-names>BH</given-names></string-name></person-group>. <article-title>An SDN-based framework for E2E QoS guarantee in Internet-of-Things devices</article-title>. <source>IEEE Internet Things J</source>. <year>2025</year>;<volume>12</volume>(<issue>1</issue>):<fpage>605</fpage>&#x2013;<lpage>22</lpage>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Solomon</surname> <given-names>FAM</given-names></string-name>, <string-name><surname>Sathianesan</surname> <given-names>GW</given-names></string-name>, <string-name><surname>Ramesh</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Logistic regression trust&#x2014;a trust model for Internet-of-Things using regression analysis</article-title>. <source>Comput Syst Sci Eng</source>. <year>2023</year>;<volume>44</volume>(<issue>2</issue>):<fpage>1125</fpage>&#x2013;<lpage>42</lpage>. doi:<pub-id pub-id-type="doi">10.32604/csse.2023.024292</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>