[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (173)

Search Parameters:
Keywords = update latency

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
20 pages, 833 KiB  
Article
Mobility Prediction and Resource-Aware Client Selection for Federated Learning in IoT
by Rana Albelaihi
Future Internet 2025, 17(3), 109; https://doi.org/10.3390/fi17030109 - 1 Mar 2025
Viewed by 152
Abstract
This paper presents the Mobility-Aware Client Selection (MACS) strategy, developed to address the challenges associated with client mobility in Federated Learning (FL). FL enables decentralized machine learning by allowing collaborative model training without sharing raw data, preserving privacy. However, client mobility and limited [...] Read more.
This paper presents the Mobility-Aware Client Selection (MACS) strategy, developed to address the challenges associated with client mobility in Federated Learning (FL). FL enables decentralized machine learning by allowing collaborative model training without sharing raw data, preserving privacy. However, client mobility and limited resources in IoT environments pose significant challenges to the efficiency and reliability of FL. MACS is designed to maximize client participation while ensuring timely updates under computational and communication constraints. The proposed approach incorporates a Mobility Prediction Model to forecast client connectivity and resource availability and a Resource-Aware Client Evaluation mechanism to assess eligibility based on predicted latencies. MACS optimizes client selection, improves convergence rates, and enhances overall system performance by employing these predictive capabilities and a dynamic resource allocation strategy. The evaluation includes comparisons with advanced baselines such as Reinforcement Learning-based FL (RL-based) and Deep Learning-based FL (DL-based), in addition to Static and Random selection methods. For the CIFAR dataset, MACS achieved a final accuracy of 95%, outperforming Static selection (85%), Random selection (80%), RL-based FL (90%), and DL-based FL (93%). Similarly, for the MNIST dataset, MACS reached 98% accuracy, surpassing Static selection (92%), Random selection (88%), RL-based FL (94%), and DL-based FL (96%). Additionally, MACS consistently required fewer iterations to achieve target accuracy levels, demonstrating its efficiency in dynamic IoT environments. This strategy provides a scalable and adaptable solution for sustainable federated learning across diverse IoT applications, including smart cities, healthcare, and industrial automation. Full article
Show Figures

Figure 1

Figure 1
<p>Federated Learning with mobile clients.</p>
Full article ">Figure 2
<p>Client selection across FL methods.</p>
Full article ">Figure 3
<p>Average data rate across FL methods.</p>
Full article ">Figure 4
<p>Computational capacity across FL methods.</p>
Full article ">Figure 5
<p>Delay comparison across FL methods.</p>
Full article ">Figure 6
<p>Coverage indicator across FL methods.</p>
Full article ">Figure 7
<p>Accuracy comparison for CIFAR dataset.</p>
Full article ">Figure 8
<p>Accuracy comparison for MNIST dataset.</p>
Full article ">
18 pages, 802 KiB  
Article
FLPSHARD: A Flexible and Efficient Blockchain Sharding Solution for IIoT
by Hongtao Zhang and Jingfeng Xue
Electronics 2025, 14(5), 961; https://doi.org/10.3390/electronics14050961 - 27 Feb 2025
Viewed by 229
Abstract
The introduction of blockchain sharding technology in IIoT (Industrial Internet of Things) can leverage the scalability, decentralization, and immutability of blockchain to significantly enhance security. However, existing IIoT operations are highly correlated with business and geographical locations, as well as network conditions, making [...] Read more.
The introduction of blockchain sharding technology in IIoT (Industrial Internet of Things) can leverage the scalability, decentralization, and immutability of blockchain to significantly enhance security. However, existing IIoT operations are highly correlated with business and geographical locations, as well as network conditions, making traditional random sharding schemes unsuitable for such scenarios. To address this issue, we propose the FLPShard model, a method that transforms the sharding problem into a single-source capacitated facility location problem (SSCFLP). FLPShard can handle multiple constraints simultaneously and allows multiple nodes to be bundled and allocated as a whole, meeting the demands of IIoT. By constructing neighborhoods during the dynamic adjustment process, we achieve dynamic incremental updates and automatic splitting of blockchain shards. We evaluated FLPShard by building a system prototype, and the results show that, compared to random sharding algorithms, FLPShard significantly increases system throughput and greatly reduces transaction latency. Full article
Show Figures

Figure 1

Figure 1
<p>Blockchain sharding scheme based on the improved SSCFLP model.</p>
Full article ">Figure 2
<p>Transaction Complete Time in each shard: FLPShard takes less time when the shard size is fixed.</p>
Full article ">Figure 3
<p>Transaction Complete Time in each shard: FLPShard takes less time with the same total number of nodes. The Fission scheme has a shorter processing time because its shard size is smaller than that of FLPShard and Omniledger.</p>
Full article ">Figure 4
<p>Throughput in each shard: FLPShard has greater throughput with the same number of nodes.</p>
Full article ">
22 pages, 2628 KiB  
Article
Privacy-Preserving Dynamic Spatial Keyword Query Scheme with Multi-Attribute Cost Constraints in Cloud–Edge Collaboration
by Zhenya Chen, Yushen Deng, Ming Yang, Xiaoming Wu, Xin Wang and Peng Wei
Electronics 2025, 14(5), 897; https://doi.org/10.3390/electronics14050897 - 24 Feb 2025
Viewed by 141
Abstract
The rapid advancement of the Internet of Things (IoT) and mobile devices has made location-based services (LBSs) increasingly prevalent, significantly improving daily convenience and work efficiency. However, this widespread usage has raised growing concerns about privacy and security, particularly during data outsourcing to [...] Read more.
The rapid advancement of the Internet of Things (IoT) and mobile devices has made location-based services (LBSs) increasingly prevalent, significantly improving daily convenience and work efficiency. However, this widespread usage has raised growing concerns about privacy and security, particularly during data outsourcing to cloud servers, where users’ location information and related data are susceptible to breaches by malicious actors or attackers. Traditional privacy-preserving spatial keyword schemes often employ Bloom filters for data encoding and storage. While Bloom filters offer high lookup speeds, they suffer from limitations such as a relatively high false positive rate in certain scenarios and poor space efficiency. These issues can adversely affect query accuracy and overall user experience. Furthermore, existing schemes have not sufficiently addressed the multi-attribute characteristics of spatial textual data. At the same time, relying solely on cloud servers for large-scale data processing introduces additional challenges, including heavy computational overhead, high latency, and substantial communication costs. To address these challenges, we propose a cloud–edge collaborative privacy-preserving dynamic spatial keyword query scheme with multi-attribute cost constraints. This scheme introduces a novel index structure that leverages security-enhanced Xor filter technology and Geohash techniques. This index structure not only strengthens query security and efficiency but also significantly reduces the false positive rate, thereby improving query accuracy. Moreover, the proposed scheme supports multi-attribute cost constraints and dynamic data updates, allowing it to adapt flexibly to practical requirements and user-specific needs. Finally, through security analysis and experimental evaluation, we demonstrate that the proposed scheme is both secure and effective. Full article
Show Figures

Figure 1

Figure 1
<p>An example of spatial keyword query.</p>
Full article ">Figure 2
<p>System model.</p>
Full article ">Figure 3
<p>An example of a secure index.</p>
Full article ">Figure 4
<p>Secure index construction time. (<b>a</b>) Total construction time varying with <span class="html-italic">N</span>; (<b>b</b>) XGRtree index time on cloud varying with <span class="html-italic">N</span>; and (<b>c</b>) Subtree index time on edge varying with <span class="html-italic">N</span>.</p>
Full article ">Figure 5
<p>Trapdoor construction time analysis. (<b>a</b>) Query trapdoor time varying with <math display="inline"><semantics> <mrow> <mi>G</mi> <mi>e</mi> <mi>o</mi> <mi>l</mi> <mi>e</mi> <mi>n</mi> <mi>g</mi> <mi>t</mi> <mi>h</mi> </mrow> </semantics></math>; (<b>b</b>) Query trapdoor time varying with <math display="inline"><semantics> <mrow> <mi>W</mi> <mi>l</mi> <mi>e</mi> <mi>n</mi> <mi>g</mi> <mi>t</mi> <mi>h</mi> </mrow> </semantics></math>; and (<b>c</b>) Update trapdoor time varying with <math display="inline"><semantics> <mrow> <mi>E</mi> <mi>n</mi> <mi>t</mi> <mi>r</mi> <mi>i</mi> <mi>e</mi> <mi>s</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Query and update time analysis. (<b>a</b>) Query time varying with <span class="html-italic">N</span> and (<b>b</b>) Update time varying with <span class="html-italic">N</span>.</p>
Full article ">Figure 7
<p>False positive comparison.</p>
Full article ">
16 pages, 35017 KiB  
Article
Cloud-Enabled Reconfiguration of Electrical/Electronic Architectures for Modular Electric Vehicles
by David Kraus, Daniel Baumann, Veljko Vučinić and Eric Sax
World Electr. Veh. J. 2025, 16(2), 111; https://doi.org/10.3390/wevj16020111 - 18 Feb 2025
Viewed by 252
Abstract
Modern mobility faces increasing challenges, like carbon-free transportation and the need for flexible transportation solutions. The U-Shift II project addresses these problems through a modular electric vehicle architecture, a drive unit (Driveboard) and a vehicle body (Capsule). This separation offers high flexibility in [...] Read more.
Modern mobility faces increasing challenges, like carbon-free transportation and the need for flexible transportation solutions. The U-Shift II project addresses these problems through a modular electric vehicle architecture, a drive unit (Driveboard) and a vehicle body (Capsule). This separation offers high flexibility in different use cases. Current architecture paradigms, like AUTOSAR, face limitations in cost and development speed. To address these issues, this paper introduces a hybrid software architecture that integrates signal-oriented architecture (e.g., CAN bus) with service-oriented architecture for enhanced flexibility. A integral component of the hybrid architecture is the dynamic link system, which bridges these architectures by dynamically integrating Capsule-specific components into the Driveboard software stack during runtime. The performance of the developed systen and its functionality were evaluated using a hardware setup integrated into a Driveboard prototype. The dynamic link aystem was evaluated including latency measurements, as well as functionality tests. Additionally, a cloud-based reconfiguration process enhances the versatility of the Driveboard by allowing for over-the-air software updates and resource allocation. The results show a promising hybrid, reconfigurable E/E architecture that aims to enable a robust transition towards a pure service-oriented architecture required in future electric autonomous vehicles. Full article
Show Figures

Figure 1

Figure 1
<p>U-Shift vehicle concept [<a href="#B11-wevj-16-00111" class="html-bibr">11</a>].</p>
Full article ">Figure 2
<p>System architecture of dynamic link system based on [<a href="#B9-wevj-16-00111" class="html-bibr">9</a>].</p>
Full article ">Figure 3
<p>Startup sequence of new DLS X-Software Component (SWC) and exemplary interaction between Capsule and Driveboard.</p>
Full article ">Figure 4
<p>Reconfiguration of a software component in the cloud with a gating mechanism and the context for selecting expert networks.</p>
Full article ">Figure 5
<p>U-Shift II prototype hardware setup.</p>
Full article ">Figure 6
<p>PTP synchronization of MAB and Orchestrator.</p>
Full article ">Figure 7
<p>Received raw UIF message and separated information based on RID.</p>
Full article ">Figure 8
<p>Impact of CPU utilization on the frequency of an SWC.</p>
Full article ">
27 pages, 1511 KiB  
Article
Secure Tiny Machine Learning on Edge Devices: A Lightweight Dual Attestation Mechanism for Machine Learning
by Vlad-Eusebiu Baciu, An Braeken, Laurent Segers and Bruno da Silva
Future Internet 2025, 17(2), 85; https://doi.org/10.3390/fi17020085 - 12 Feb 2025
Viewed by 678
Abstract
Emerging edge devices are transforming the Internet of Things (IoT) by enabling more responsive and efficient interactions between physical objects and digital networks. These devices support diverse applications, from health-monitoring wearables to environmental sensors, by moving data processing closer to the source. Traditional [...] Read more.
Emerging edge devices are transforming the Internet of Things (IoT) by enabling more responsive and efficient interactions between physical objects and digital networks. These devices support diverse applications, from health-monitoring wearables to environmental sensors, by moving data processing closer to the source. Traditional IoT systems rely heavily on centralized servers, but advances in edge computing and Tiny Machine Learning (TinyML) now allow for on-device processing, enhancing battery efficiency and reducing latency. While this shift improves privacy, the distributed nature of edge devices introduces new security challenges, particularly regarding TinyML models, which are designed for low-power environments and may be vulnerable to tampering or unauthorized access. Since other IoT entities depend on the data generated by these models, ensuring trust in the devices is essential. To address this, we propose a lightweight dual attestation mechanism utilizing Entity Attestation Tokens (EATs) to validate the device and ML model integrity. This approach enhances security by enabling verified device-to-device communication, supports seamless integration with secure cloud services, and allows for flexible, authorized ML model updates, meeting modern IoT systems’ scalability and compliance needs. Full article
Show Figures

Figure 1

Figure 1
<p>Device attestation and involved entities: Soc Manufacturer, Device Manufacturer, Relying Party, Verifier, User.</p>
Full article ">Figure 2
<p>Dual attestation method: ensure device and model trust through PSA and ML-EAT tokens.</p>
Full article ">Figure 3
<p>Remote attestation mechanism. Attestation request from a remote relying party.</p>
Full article ">Figure 4
<p>STM32H573I-DK Discovery development platform.</p>
Full article ">Figure 5
<p>Software architecture of the proposed dual attestation mechanism.</p>
Full article ">Figure 6
<p>Provisioning of secure artifacts and ML application provisioning flow.</p>
Full article ">Figure 7
<p>ML-EAT token size based on the number of encoder layers for the evaluated AE architecture.</p>
Full article ">Figure 8
<p>Performance of the dual attestation mechanism for the evaluated models. Tokens generation time and model hash overhead.</p>
Full article ">Figure 9
<p>Token time generation based on the number of encoder layers for the evaluated AE architecture. Model hash time not included.</p>
Full article ">
31 pages, 1787 KiB  
Article
Distributed Gradient Descent Framework for Real-Time Task Offloading in Heterogeneous Satellite Networks
by Yanbing Li, Yuchen Wu and Shangpeng Wang
Mathematics 2025, 13(4), 561; https://doi.org/10.3390/math13040561 - 8 Feb 2025
Viewed by 328
Abstract
Task offloading in satellite networks, which involves distributing computational tasks among heterogeneous satellite nodes, is crucial for optimizing resource utilization and minimizing system latency. However, existing approaches such as static offloading strategies and heuristic-based offloading methods neglect dynamic topologies and uncertain conditions that [...] Read more.
Task offloading in satellite networks, which involves distributing computational tasks among heterogeneous satellite nodes, is crucial for optimizing resource utilization and minimizing system latency. However, existing approaches such as static offloading strategies and heuristic-based offloading methods neglect dynamic topologies and uncertain conditions that hinder adaptability to sudden changes. Furthermore, current collaborative computing strategies inadequately address satellite platform heterogeneity and often overlook resource fluctuations, resulting in inefficient resource sharing and inflexible task scheduling. To address these issues, we propose a dynamic gradient descent-based task offloading method. This method proposes a collaborative optimization framework based on dynamic programming. By constructing delay optimization and resource efficiency models and integrating dynamic programming with value iteration techniques, the framework achieves real-time updates of system states and decision variables. Then, a distributed gradient descent algorithm combined with Gradient Surgery techniques is employed to optimize task offloading decisions and resource allocation schemes, ensuring a precise balance between delay minimization and resource utilization maximization in dynamic network environments. Experimental results demonstrate that the proposed method enhances the global optimizing result by at least 1.97%, enhances resource utilization rates by at least 3.91%, and also reduces the solution time by at least 191.91% in large-scale networks. Full article
(This article belongs to the Special Issue New Advances in Network and Edge Computing)
Show Figures

Figure 1

Figure 1
<p>Schematic basic idea D-GTOM framework.</p>
Full article ">Figure 2
<p>Main simulation interface of the CSTK platform.</p>
Full article ">Figure 3
<p>Comparison of objective function values for different algorithms across 4 datasets.</p>
Full article ">Figure 4
<p>Comparison of resource utilization rates for different algorithms across 4 datasets.</p>
Full article ">Figure 5
<p>Running time and improvement rates of algorithms across 4 datasets.</p>
Full article ">Figure 6
<p>Comparison of average task delay for different algorithms across 4 datasets.</p>
Full article ">Figure 7
<p>Comparison of evaluation metrics in large-scale satellite dataset with growing task quantity.</p>
Full article ">
16 pages, 6121 KiB  
Article
Stereo Event-Based Visual–Inertial Odometry
by Kunfeng Wang, Kaichun Zhao, Wenshuai Lu and Zheng You
Sensors 2025, 25(3), 887; https://doi.org/10.3390/s25030887 - 31 Jan 2025
Cited by 1 | Viewed by 512
Abstract
Event-based cameras are a new type of vision sensor in which pixels operate independently and respond asynchronously to changes in brightness with microsecond resolution, instead of providing standard intensity frames. Compared with traditional cameras, event-based cameras have low latency, no motion blur, and [...] Read more.
Event-based cameras are a new type of vision sensor in which pixels operate independently and respond asynchronously to changes in brightness with microsecond resolution, instead of providing standard intensity frames. Compared with traditional cameras, event-based cameras have low latency, no motion blur, and high dynamic range (HDR), which provide possibilities for robots to deal with some challenging scenes. We propose a visual–inertial odometry for stereo event-based cameras based on Error-State Kalman Filter (ESKF). The vision module updates the pose by relying on the edge alignment of a semi-dense 3D map to a 2D image, while the IMU module updates the pose using median integration. We evaluate our method on public datasets with general 6-DoF motion (three-axis translation and three-axis rotation) and compare the results against the ground truth. We compared our results with those from other methods, demonstrating the effectiveness of our approach. Full article
(This article belongs to the Section Intelligent Sensors)
Show Figures

Figure 1

Figure 1
<p>(<b>Top left</b>): scene. (<b>Bottom left</b>): inverse depth map at time <span class="html-italic">t</span>, and different colors represent different depths. (<b>Right</b>): global map and pose estimation.</p>
Full article ">Figure 2
<p>Overview of our proposed stereo event-based visual–inertial odometry.</p>
Full article ">Figure 3
<p>Time-surface. (<b>Left</b>): output of an event camera, and different colors represent different times. (<b>Right</b>): time-surface map. Figure adapted from [<a href="#B16-sensors-25-00887" class="html-bibr">16</a>].</p>
Full article ">Figure 4
<p>Time-surface and its included historical information.</p>
Full article ">Figure 5
<p>Algorithm performance. The left image shows the experimental scene, while the right image displays the local point clouds and trajectories.</p>
Full article ">Figure 6
<p>The first column shows images from a traditional camera. The second column is the time-surface. The third column is the inverse depth map. The last column is the warping depth map overlaid on the time-surface negative.</p>
Full article ">
27 pages, 2104 KiB  
Article
FL-TENB4: A Federated-Learning-Enhanced Tiny EfficientNetB4-Lite Approach for Deepfake Detection in CCTV Environments
by Jimin Ha, Abir El Azzaoui and Jong Hyuk Park
Sensors 2025, 25(3), 788; https://doi.org/10.3390/s25030788 - 28 Jan 2025
Viewed by 584
Abstract
The widespread deployment of CCTV systems has significantly enhanced surveillance and public safety across various environments. However, the emergence of deepfake technology poses serious challenges by enabling malicious manipulation of video footage, compromising the reliability of CCTV systems for evidence collection and privacy [...] Read more.
The widespread deployment of CCTV systems has significantly enhanced surveillance and public safety across various environments. However, the emergence of deepfake technology poses serious challenges by enabling malicious manipulation of video footage, compromising the reliability of CCTV systems for evidence collection and privacy protection. Existing deepfake detection solutions often suffer from high computational overhead and are unsuitable for real-time deployment on resource-constrained CCTV cameras. This paper proposes FL-TENB4, a Federated-Learning-enhanced Tiny EfficientNetB4-Lite framework for deepfake detection in CCTV environments. The proposed architecture integrates Tiny Machine Learning (TinyML) techniques with EfficientNetB4-Lite, a lightweight convolutional neural network optimized for edge devices, and employs a Federated Learning (FL) approach for collaborative model updates. The TinyML-based local model ensures real-time deepfake detection with minimal latency, while FL enables privacy-preserving training by aggregating model updates without transferring sensitive video data to centralized servers. The effectiveness of the proposed system is validated using the FaceForensics++ dataset under resource-constrained conditions. Experimental results demonstrate that FL-TENB4 achieves high detection accuracy, reduced model size, and low inference latency, making it highly suitable for real-world CCTV environments. Full article
Show Figures

Figure 1

Figure 1
<p>Architecture overview.</p>
Full article ">Figure 2
<p>Simulation results of FL-TENB4 model.</p>
Full article ">Figure 3
<p>Performance comparison.</p>
Full article ">Figure 4
<p>Comparison of efficiency metrics.</p>
Full article ">Figure 5
<p>Optimized bandwidth utilization and latency variability in Federated Learning with 100 edge devices.</p>
Full article ">
34 pages, 16501 KiB  
Article
Vehicle-to-Everything-Car Edge Cloud Management with Development, Security, and Operations Automation Framework
by DongHwan Ku, Hannie Zang, Anvarjon Yusupov, Sun Park and JongWon Kim
Electronics 2025, 14(3), 478; https://doi.org/10.3390/electronics14030478 - 24 Jan 2025
Viewed by 523
Abstract
Modern autonomous driving and intelligent transportation systems face critical challenges in managing real-time data processing, network latency, and security threats across distributed vehicular environments. Conventional cloud-centric architectures typically struggle to meet the low-latency and high-reliability requirements of vehicle-to-everything (V2X) applications, particularly in dynamic [...] Read more.
Modern autonomous driving and intelligent transportation systems face critical challenges in managing real-time data processing, network latency, and security threats across distributed vehicular environments. Conventional cloud-centric architectures typically struggle to meet the low-latency and high-reliability requirements of vehicle-to-everything (V2X) applications, particularly in dynamic and resource-constrained edge environments. To address these challenges, this study introduces the V2X-Car Edge Cloud system, which is a cloud-native architecture driven by DevSecOps principles to ensure secure deployment, dynamic resource orchestration, and real-time monitoring across distributed edge nodes. The proposed system integrates multicluster orchestration with Kubernetes, hybrid communication protocols (C-V2X, 5G, and WAVE), and data-fusion pipelines to enhance transparency in artificial intelligence (AI)-driven decision making. A software-in-the-loop simulation environment was implemented to validate AI models, and the SmartX MultiSec framework was integrated into the proposed system to dynamically monitor network traffic flow and security. Experimental evaluations in a virtual driving environment demonstrate the ability of the proposed system to perform automated security updates, continuous performance monitoring, and dynamic resource allocation without manual intervention. Full article
(This article belongs to the Special Issue Cloud Computing, IoT, and Big Data: Technologies and Applications)
Show Figures

Figure 1

Figure 1
<p>V2X-Car Edge Cloud for driving simulation.</p>
Full article ">Figure 2
<p>V2X-Car Edge Cloud architecture.</p>
Full article ">Figure 3
<p>Software design for V2X-Car Edge Cloud.</p>
Full article ">Figure 4
<p>Hardware Specifications of AI+X Post and AI Computing and Storage Boxes.</p>
Full article ">Figure 5
<p>Hardware specifications of virtual driving simulation environment.</p>
Full article ">Figure 6
<p>Hardware specifications of real-world driving environment.</p>
Full article ">Figure 7
<p>Virtual driving simulation environment over V2X-Car Edge Cloud.</p>
Full article ">Figure 8
<p>Real-world driving environment over V2X-Car Edge Cloud.</p>
Full article ">Figure 9
<p>System initialization process in V2X-Car Edge Cloud.</p>
Full article ">Figure 10
<p>Traffic flow monitoring and visualization setup in V2X-Car Edge Cloud.</p>
Full article ">Figure 11
<p>Object detection and latency analysis workflow in V2X-Car Edge Cloud.</p>
Full article ">Figure 12
<p>Functions for SmartX MultiSec.</p>
Full article ">Figure 13
<p>Functional verification workflow of V2X-Car Edge Cloud.</p>
Full article ">Figure 14
<p>A section of GIST campus map and its virtual representation for simulation.</p>
Full article ">Figure 15
<p>Roadside of GIST campus and its virtual driving environment.</p>
Full article ">Figure 16
<p>Virtual driving scenario overview.</p>
Full article ">Figure 17
<p>Sequence diagram for the virtual driving simulation.</p>
Full article ">Figure 18
<p>Real-time visualization of vehicle and environmental data in virtual driving simulation.</p>
Full article ">Figure 19
<p>V2X data visualization in real-world driving.</p>
Full article ">Figure 20
<p>Real-time object detection during virtual driving simulation.</p>
Full article ">Figure 21
<p>Frame processing delay.</p>
Full article ">Figure 22
<p>Delay Visualization Tool (DVT) for internal process tracking of two Data IO Boxes.</p>
Full article ">Figure 23
<p>The result of delay measurement for first 9000 frames.</p>
Full article ">Figure 24
<p>The implemented result of 2D onion-ring visualization for box layer visibility.</p>
Full article ">Figure 25
<p>The implemented result of 3D onion-ring visualization for networking flow visibility.</p>
Full article ">
24 pages, 11547 KiB  
Article
Dynamic Key Replacement Mechanism for Lightweight Internet of Things Microcontrollers to Resist Side-Channel Attacks
by Chung-Wei Kuo, Wei Wei, Chun-Chang Lin, Yu-Yi Hong, Jia-Ruei Liu and Kuo-Yu Tsai
Future Internet 2025, 17(1), 43; https://doi.org/10.3390/fi17010043 - 18 Jan 2025
Viewed by 594
Abstract
5G technology and IoT devices are improving efficiency and quality of life across many sectors. IoT devices are often used in open environments where they handle sensitive data. This makes them vulnerable to side-channel attacks (SCAs), where attackers can intercept and analyze the [...] Read more.
5G technology and IoT devices are improving efficiency and quality of life across many sectors. IoT devices are often used in open environments where they handle sensitive data. This makes them vulnerable to side-channel attacks (SCAs), where attackers can intercept and analyze the electromagnetic signals emitted by microcontroller units (MCUs) to expose encryption keys and compromise sensitive data. To address this critical vulnerability, this study proposes a novel dynamic key replacement mechanism specifically designed for lightweight IoT microcontrollers. The mechanism integrates Moving Target Defense (MTD) with a lightweight Diffie–Hellman (D-H) key exchange protocol and AES-128 encryption to provide robust protection against SCAs. Unlike traditional approaches, the proposed mechanism dynamically updates encryption keys during each cryptographic cycle, effectively mitigating the risk of key reuse—a primary vulnerability exploited in SCAs. The lightweight D-H key exchange ensures that even resource-constrained IoT devices can securely perform key exchanges without significant computational overhead. Experimental results demonstrate the practicality and security of the proposed mechanism, achieving key updates with minimal time overhead, ranging from 12 to 50 milliseconds per encryption transmission. Moreover, the approach shows strong resilience against template attacks, with only two out of sixteen AES-128 subkeys compromised after 20,000 attack attempts—a notable improvement over existing countermeasures. The key innovation of this study lies in the seamless integration of MTD with lightweight cryptographic protocols, striking a balance between security and performance. This dynamic key replacement mechanism offers an effective, scalable, and resource-efficient solution for IoT applications, particularly in scenarios that demand robust protection against SCAs and low-latency performance. Full article
(This article belongs to the Special Issue Privacy and Security Issues in IoT Systems)
Show Figures

Figure 1

Figure 1
<p>AES encryption process flow.</p>
Full article ">Figure 2
<p>Hamming Weight grouping results.</p>
Full article ">Figure 3
<p>Lightweight D-H protocol.</p>
Full article ">Figure 4
<p>SCA system configuration [<a href="#B16-futureinternet-17-00043" class="html-bibr">16</a>].</p>
Full article ">Figure 5
<p>Actual client-side setup.</p>
Full article ">Figure 6
<p>Server-side configuration display.</p>
Full article ">Figure 7
<p>Key generation concept in dynamic key replacement for AES encryption.</p>
Full article ">Figure 8
<p>D-H key exchange.</p>
Full article ">Figure 9
<p>Experimental environment setup.</p>
Full article ">Figure 9 Cont.
<p>Experimental environment setup.</p>
Full article ">Figure 10
<p>Server-side secure channel setup and encrypted packets transmission.</p>
Full article ">Figure 11
<p>Process of server side receiving encrypted data and decryption.</p>
Full article ">Figure 12
<p>SCA results of AES encryption with different key replacements.</p>
Full article ">Figure 12 Cont.
<p>SCA results of AES encryption with different key replacements.</p>
Full article ">
19 pages, 3693 KiB  
Article
Real-Time On-Device Continual Learning Based on a Combined Nearest Class Mean and Replay Method for Smartphone Gesture Recognition
by Heon-Sung Park, Min-Kyung Sung, Dae-Won Kim and Jaesung Lee
Sensors 2025, 25(2), 427; https://doi.org/10.3390/s25020427 - 13 Jan 2025
Viewed by 691
Abstract
Sensor-based gesture recognition on mobile devices is critical to human–computer interaction, enabling intuitive user input for various applications. However, current approaches often rely on server-based retraining whenever new gestures are introduced, incurring substantial energy consumption and latency due to frequent data transmission. To [...] Read more.
Sensor-based gesture recognition on mobile devices is critical to human–computer interaction, enabling intuitive user input for various applications. However, current approaches often rely on server-based retraining whenever new gestures are introduced, incurring substantial energy consumption and latency due to frequent data transmission. To address these limitations, we present the first on-device continual learning framework for gesture recognition. Leveraging the Nearest Class Mean (NCM) classifier coupled with a replay-based update strategy, our method enables continuous adaptation to new gestures under limited computing and memory resources. By employing replay buffer management, we efficiently store and revisit previously learned instances, mitigating catastrophic forgetting and ensuring stable performance as new gestures are added. Experimental results on a Samsung Galaxy S10 device demonstrate that our method achieves over 99% accuracy while operating entirely on-device, offering a compelling synergy between computational efficiency, robust continual learning, and high recognition accuracy. This work demonstrates the potential of on-device continual learning frameworks that integrate NCM classifiers with replay-based techniques, thereby advancing the field of resource-constrained, adaptive gesture recognition. Full article
(This article belongs to the Special Issue Computer Vision-Based Human Activity Recognition)
Show Figures

Figure 1

Figure 1
<p>The overall procedure of the on-device continual learning framework for gesture recognition. This framework enables continual learning on mobile devices through two main elements: network learning and replay buffer management technology.</p>
Full article ">Figure 2
<p>Structure of the gesture recognition network using sensor data, with a replay buffer for continual learning of new gestures through 1D convolutional layers and a fully connected layer.</p>
Full article ">Figure 3
<p>Replay buffer management technology to minimize mobile device memory usage. This technique stores some data similar to the feature mean vector of the new gesture while not exceeding memory usage.</p>
Full article ">Figure 4
<p>Replay buffer management process for continual learning. When a new gesture is introduced, its representative features are calculated and stored in the buffer. The system removes the buffer data farthest from the representative features to maintain fixed memory usage while preserving knowledge of previously learned gestures.</p>
Full article ">Figure 5
<p>Results of our method performing gesture recognition on a Samsung Galaxy S10 smartphone. The figure demonstrates the system successful real-time operation and incremental learning of gestures, highlighting its practical functionality through a dedicated mobile application.</p>
Full article ">
21 pages, 1568 KiB  
Article
Efficient State Synchronization in Distributed Electrical Grid Systems Using Conflict-Free Replicated Data Types
by Arsentii Prymushko, Ivan Puchko, Mykola Yaroshynskyi, Dmytro Sinko, Hryhoriy Kravtsov and Volodymyr Artemchuk
IoT 2025, 6(1), 6; https://doi.org/10.3390/iot6010006 - 11 Jan 2025
Viewed by 663
Abstract
Modern electrical grids are evolving towards distributed architectures, necessitating efficient and reliable state synchronization mechanisms to maintain structural and functional consistency. This paper investigates the application of conflict-free replicated data types (CRDTs) for representing and synchronizing the states of distributed electrical grid systems [...] Read more.
Modern electrical grids are evolving towards distributed architectures, necessitating efficient and reliable state synchronization mechanisms to maintain structural and functional consistency. This paper investigates the application of conflict-free replicated data types (CRDTs) for representing and synchronizing the states of distributed electrical grid systems (DEGSs). We present a general structure for DEGSs based on CRDTs, focusing on the Convergent Replicated Data Type (CvRDT) model with delta state propagation to optimize the communication overhead. The Observed Remove Set (ORSet) and Last-Writer-Wins Register (LWW-Register) are utilized to handle concurrent updates and ensure that only the most recent state changes are retained. An actor-based framework, “Vigilant Hawk”, leveraging the Akka toolkit, was developed to simulate the asynchronous and concurrent nature of DEGSs. Each electrical grid node is modelled as an independent actor with isolated state management, facilitating scalability and fault tolerance. Through a series of experiments involving 100 nodes under varying latency degradation coefficients (LDK), we examined the impact of network conditions on the state synchronization efficiency. The simulation results demonstrate that CRDTs effectively maintain consistency and deterministic behavior in DEGSs, even with increased network latency and node disturbances. An effective LDK range was identified (LDK effective = 2 or 4), where the network remains stable without significant delays in state propagation. The linear relationship between the full state distribution time (FSDT) and LDK indicates that the system can scale horizontally without introducing complex communication overhead. The findings affirm that using CRDTs for state synchronization enhances the resilience and operational efficiency of distributed electrical grids. The deterministic and conflict-free properties of CRDTs eliminate the need for complex concurrency control mechanisms, making them suitable for real-time monitoring and control applications. Future work will focus on addressing identified limitations, such as optimizing message routing based on the network topology and incorporating security measures to protect state information in critical infrastructure systems. Full article
Show Figures

Figure 1

Figure 1
<p>Transition diagram of the power unit state.</p>
Full article ">Figure 2
<p>Conceptual view of CRDT state distribution between concurrently updated nodes.</p>
Full article ">Figure 3
<p>General representation of DEGS based on CRDT.</p>
Full article ">Figure 4
<p>Structural view of the node.</p>
Full article ">Figure 5
<p>Experimental flow of inner node communication.</p>
Full article ">Figure 6
<p>Simulation results for CRDT message distribution density within electrical grid with LDK = 2, 4, 8, 16.</p>
Full article ">Figure 7
<p>Simulation results for network state synchronization with LDK = 2, 4, 8, 16, 32, 64 and FSDT.</p>
Full article ">
41 pages, 6955 KiB  
Article
Framework Design for the Dynamic Reconfiguration of IoT-Enabled Embedded Systems and “On-the-Fly” Code Execution
by Elmin Marevac, Esad Kadušić, Nataša Živić, Nevzudin Buzađija and Samir Lemeš
Future Internet 2025, 17(1), 23; https://doi.org/10.3390/fi17010023 - 7 Jan 2025
Viewed by 786
Abstract
Embedded systems, particularly when integrated into the Internet of Things (IoT) landscape, are critical for projects requiring robust, energy-efficient interfaces to collect real-time data from the environment. As these systems become complex, the need for dynamic reconfiguration, improved availability, and stability becomes increasingly [...] Read more.
Embedded systems, particularly when integrated into the Internet of Things (IoT) landscape, are critical for projects requiring robust, energy-efficient interfaces to collect real-time data from the environment. As these systems become complex, the need for dynamic reconfiguration, improved availability, and stability becomes increasingly important. This paper presents the design of a framework architecture that supports dynamic reconfiguration and “on-the-fly” code execution in IoT-enabled embedded systems, including a virtual machine capable of hot reloads, ensuring system availability even during configuration updates. A “hardware-in-the-loop” workflow manages communication between the embedded components, while low-level coding constraints are accessible through an additional abstraction layer, with examples such as MicroPython or Lua. The study results demonstrate the VM’s ability to handle serialization and deserialization with minimal impact on system performance, even under high workloads, with serialization having a median time of 160 microseconds and deserialization having a median of 964 microseconds. Both processes were fast and resource-efficient under normal conditions, supporting real-time updates with occasional outliers, suggesting room for optimization and also highlighting the advantages of VM-based firmware update methods, which outperform traditional approaches like Serial and OTA (Over-the-Air, the ability to update or configure firmware, software, or devices via wireless connection) updates by achieving lower latency and greater consistency. With these promising results, however, challenges like occasional deserialization time outliers and the need for optimization in memory management and network protocols remain for future work. This study also provides a comparative analysis of currently available commercial solutions, highlighting their strengths and weaknesses. Full article
Show Figures

Figure 1

Figure 1
<p>Zerynth virtual machine architecture block diagram (adapted from [<a href="#B15-futureinternet-17-00023" class="html-bibr">15</a>]).</p>
Full article ">Figure 2
<p>Comparison of standard development platform architecture to one based on MicroPython (adapted from [<a href="#B18-futureinternet-17-00023" class="html-bibr">18</a>]).</p>
Full article ">Figure 3
<p>Overview of Lua in the NetBSD kernel (adapted from [<a href="#B21-futureinternet-17-00023" class="html-bibr">21</a>]).</p>
Full article ">Figure 4
<p>ESP8266 IoT Framework architecture (adapted from [<a href="#B22-futureinternet-17-00023" class="html-bibr">22</a>]).</p>
Full article ">Figure 5
<p>Configuration definition and persistence using EEPROM library functions (authors’ contribution).</p>
Full article ">Figure 6
<p>Ewings ESP Framework structure (adapted from [<a href="#B24-futureinternet-17-00023" class="html-bibr">24</a>]).</p>
Full article ">Figure 7
<p>Simplified framework workflow overview with pre-installed web server on microcontroller boards (authors’ contribution).</p>
Full article ">Figure 8
<p>Class diagram of the created prototype (excluding subclasses for expressions and statements) (authors’ contribution).</p>
Full article ">Figure 9
<p>Diagram of the program serialization process (authors’ contribution).</p>
Full article ">Figure 10
<p>Framework architecture deployment diagram (authors’ contribution).</p>
Full article ">Figure 11
<p>Default file browser layout with placeholder dates used for illustrative purposes.</p>
Full article ">Figure 12
<p>Implementation of the “Persistence.load” method via the native interface.</p>
Full article ">Figure 13
<p>Implementation of the “Persistence.save” method via the native interface.</p>
Full article ">Figure 14
<p>Implementation of the “checkContainsExternalReferences” function.</p>
Full article ">Figure 15
<p>Implementation of the “Persistence.saveToFlash” method via the native interface.</p>
Full article ">Figure 16
<p>Comparison of the decompiled code for Lua 5.0 and Stella with loop instructions highlighted (authors’ contribution).</p>
Full article ">Figure 17
<p>Object marking for time-constrained allocation entries.</p>
Full article ">Figure 18
<p>Memory usage with the next collection limit during garbage collector stress testing (authors’ contribution).</p>
Full article ">Figure 19
<p>Changes in the number of allocated objects and execution times during garbage collector stress testing (authors’ contribution).</p>
Full article ">Figure 20
<p>Serialization and deserialization times during stress testing (authors’ contribution).</p>
Full article ">Figure 21
<p>(<b>a</b>) Histogram for serialization times; (<b>b</b>) histogram for serialization request sizes (authors’ contribution).</p>
Full article ">Figure 22
<p>Comparison of update times for dynamic, OTA, and serial firmware updates (authors’ contribution).</p>
Full article ">
19 pages, 500 KiB  
Article
Cross-Chain Identity Authentication Method Based on Relay Chain
by Qipeng Huang, Minsheng Tan and Wenlong Tian
Information 2025, 16(1), 27; https://doi.org/10.3390/info16010027 - 6 Jan 2025
Viewed by 2207
Abstract
The cross-chain identity authentication method based on relay chains provides a promising solution to the issues brought by the centralized notary mechanism. Nonetheless, it continues to encounter numerous challenges regarding data privacy, security, and issues of heterogeneity. For example, there is a concern [...] Read more.
The cross-chain identity authentication method based on relay chains provides a promising solution to the issues brought by the centralized notary mechanism. Nonetheless, it continues to encounter numerous challenges regarding data privacy, security, and issues of heterogeneity. For example, there is a concern regarding the protection of identity information during the cross-chain authentication process, and the incompatibility of cryptographic components across different blockchains during cross-chain transactions. We design and propose a cross-chain identity privacy protection method based on relay chains to address these issues. In this method, the decentralized nature of relay chains ensures that the cross-chain authentication process is not subject to subjective manipulation, guaranteeing the authenticity and reliability of the data. Regarding the compatibility issue, we unify the user keys according to the identity manager organization, storing them on the relay chain and eliminating the need for users to configure identical key systems. Additionally, to comply with General Data Protection Regulation (GDPR) principles, we store the user keys from the relay chain in distributed servers using the InterPlanetary File System (IPFS). To address privacy concerns, we enable pseudonym updates based on the user’s public key during cross-chain transactions. This method ensures full compatibility while protecting user privacy. Moreover, we introduce Zero-Knowledge Proof (ZKP) technology, ensuring that audit nodes cannot trace the user’s identity information with malicious intent. Our method offers compatibility while ensuring unlinkability and anonymity through thorough security analysis. More importantly, comparative analysis and experimental results show that our proposed method achieves lower computational cost, reduced storage cost, lower latency, and higher throughput. Therefore, our method demonstrates superior security and performance in cross-chain privacy protection. Full article
Show Figures

Figure 1

Figure 1
<p>The cross-chain architecture.</p>
Full article ">Figure 2
<p>The workflow of cross-chain authentication.</p>
Full article ">Figure 3
<p>Comparison of throughput.</p>
Full article ">Figure 4
<p>Comparison of latency.</p>
Full article ">
20 pages, 15263 KiB  
Article
An Efficient Cluster-Based Mutual Authentication and Key Update Protocol for Secure Internet of Vehicles in 5G Sensor Networks
by Xinzhong Su and Youyun Xu
Sensors 2025, 25(1), 212; https://doi.org/10.3390/s25010212 - 2 Jan 2025
Viewed by 527
Abstract
The Internet of Vehicles (IoV), a key component of smart transportation systems, leverages 5G communication for low-latency data transmission, facilitating real-time interactions between vehicles, roadside units (RSUs), and sensor networks. However, the open nature of 5G communication channels exposes IoV systems to significant [...] Read more.
The Internet of Vehicles (IoV), a key component of smart transportation systems, leverages 5G communication for low-latency data transmission, facilitating real-time interactions between vehicles, roadside units (RSUs), and sensor networks. However, the open nature of 5G communication channels exposes IoV systems to significant security threats, such as eavesdropping, replay attacks, and message tampering. To address these challenges, this paper proposes the Efficient Cluster-based Mutual Authentication and Key Update Protocol (ECAUP) designed to secure IoV systems within 5G-enabled sensor networks. The ECAUP meets the unique mobility and security demands of IoV by enabling fine-grained access control and dynamic key updates for RSUs through a factorial tree structure, ensuring both forward and backward secrecy. Additionally, physical unclonable functions (PUFs) are utilized to provide end-to-end authentication and physical layer security, further enhancing the system’s resilience against sophisticated cyber-attacks. The security of the ECAUP is formally verified using BAN Logic and ProVerif, and a comparative analysis demonstrates its superiority in terms of overhead efficiency (more than 50%) and security features over existing protocols. This work contributes to the development of secure, resilient, and efficient intelligent transportation systems, ensuring robust communication and protection in sensor-based IoV environments. Full article
(This article belongs to the Special Issue Advances in Security for Emerging Intelligent Systems)
Show Figures

Figure 1

Figure 1
<p>IOV authentication model.</p>
Full article ">Figure 2
<p>Factorial-tree-based accessible device table. The number of leaf nodes at each level in factorial tree is <math display="inline"><semantics> <mrow> <mo>(</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> <mo>!</mo> </mrow> </semantics></math>, where <span class="html-italic">t</span> is the level of the tree.</p>
Full article ">Figure 3
<p><math display="inline"><semantics> <mrow> <mi>R</mi> <mi>S</mi> <mi>U</mi> </mrow> </semantics></math> registration.</p>
Full article ">Figure 4
<p>Mutual authentication between <math display="inline"><semantics> <mrow> <mi>R</mi> <mi>S</mi> <mi>U</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>I</mi> <mi>O</mi> <mi>V</mi> <mi>D</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p><math display="inline"><semantics> <mrow> <mi>I</mi> <mi>O</mi> <mi>V</mi> <mi>D</mi> </mrow> </semantics></math> join and leave.</p>
Full article ">Figure 6
<p>Proverif simulation results.</p>
Full article ">Figure 7
<p>Comparison of communication cost and calculation cost.</p>
Full article ">
Back to TopTop