[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

Search Results (161)

Search Parameters:
Keywords = update latency

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
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
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 163
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 254
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 ">
17 pages, 4607 KiB  
Article
Event-Based Visual/Inertial Odometry for UAV Indoor Navigation
by Ahmed Elamin, Ahmed El-Rabbany and Sunil Jacob
Sensors 2025, 25(1), 61; https://doi.org/10.3390/s25010061 - 25 Dec 2024
Viewed by 302
Abstract
Indoor navigation is becoming increasingly essential for multiple applications. It is complex and challenging due to dynamic scenes, limited space, and, more importantly, the unavailability of global navigation satellite system (GNSS) signals. Recently, new sensors have emerged, namely event cameras, which show great [...] Read more.
Indoor navigation is becoming increasingly essential for multiple applications. It is complex and challenging due to dynamic scenes, limited space, and, more importantly, the unavailability of global navigation satellite system (GNSS) signals. Recently, new sensors have emerged, namely event cameras, which show great potential for indoor navigation due to their high dynamic range and low latency. In this study, an event-based visual–inertial odometry approach is proposed, emphasizing adaptive event accumulation and selective keyframe updates to reduce computational overhead. The proposed approach fuses events, standard frames, and inertial measurements for precise indoor navigation. Features are detected and tracked on the standard images. The events are accumulated into frames and used to track the features between the standard frames. Subsequently, the IMU measurements and the feature tracks are fused to continuously estimate the sensor states. The proposed approach is evaluated using both simulated and real-world datasets. Compared with the state-of-the-art U-SLAM algorithm, our approach achieves a substantial reduction in the mean positional error and RMSE in simulated environments, showing up to 50% and 47% reductions along the x- and y-axes, respectively. The approach achieves 5–10 ms latency per event batch and 10–20 ms for frame updates, demonstrating real-time performance on resource-constrained platforms. These results underscore the potential of our approach as a robust solution for real-world UAV indoor navigation scenarios. Full article
(This article belongs to the Special Issue Multi-sensor Integration for Navigation and Environmental Sensing)
Show Figures

Figure 1

Figure 1
<p>Workflow of the proposed event-based VIO.</p>
Full article ">Figure 2
<p>DAVIS346 event camera.</p>
Full article ">Figure 3
<p>Study area camera calibration: (<b>a</b>) a 6 × 9 chessboard with a square size of 30 mm; and (<b>b</b>) an example of the detected pattern image.</p>
Full article ">Figure 4
<p>An office environment simulation layout.</p>
Full article ">Figure 5
<p>Simulated dataset: comparison of trajectories.</p>
Full article ">Figure 6
<p>Ground-based dataset: an example of feature detection and tracking on an events accumulated frame.</p>
Full article ">Figure 7
<p>Ground-based dataset: an example of feature detection and tracking on a standard frame.</p>
Full article ">Figure 8
<p>Ground-based dataset: an example of feature detection and tracking on combined events and standard frames.</p>
Full article ">Figure 9
<p>Ground-based dataset: comparison of trajectories.</p>
Full article ">Figure 10
<p>UAV used for the experiments. (1) DAVIS346 event camera. (2) NVIDIA Jetson Xavier computer. (3) Pixhawk 4 flight controller.</p>
Full article ">Figure 11
<p>UAV-based dataset: an example of feature detection and tracking on an events accumulated frame.</p>
Full article ">Figure 12
<p>UAV-based dataset: an example of feature detection and tracking on a standard frame.</p>
Full article ">Figure 13
<p>UAV-based dataset: an example of feature detection and tracking on combined events and standard frames.</p>
Full article ">Figure 14
<p>UAV-based dataset: comparison of trajectories.</p>
Full article ">
20 pages, 1708 KiB  
Article
Sustainability in Industry 4.0: Edge Computing Microservices as a New Approach
by Leandro Colevati dos Santos, Maria Lucia Pereira da Silva and Sebastião Gomes dos Santos Filho
Sustainability 2024, 16(24), 11052; https://doi.org/10.3390/su162411052 - 17 Dec 2024
Viewed by 677
Abstract
The importance of the electronics sector in the modern world is unquestionable, as it demonstrates clean technology, dry processes, and efficient design, which favor Industry 4.0 and sustainability. Nonetheless, the large number of instruments developed, and their correspondent quick obsolescence, imply an increment [...] Read more.
The importance of the electronics sector in the modern world is unquestionable, as it demonstrates clean technology, dry processes, and efficient design, which favor Industry 4.0 and sustainability. Nonetheless, the large number of instruments developed, and their correspondent quick obsolescence, imply an increment in electronic waste. Therefore, in this work, with the aim of diminishing obsolescence, we developed and customized one application that runs independently of systems and takes advantage of the existing computing structures. The application is a new edge computing structure (the AIFC) that is based on an enterprise service bus (ESB) developed in decentralized microservices. In this study, we conducted action research involving the collaboration of researchers and practitioners, and the tests involved six different scenarios; they used existing low-cost, basic computing environments and ranged from the proof of concept, prototype, minimum viable product, and scalability to the roadmap for the structure implementation. The six scenarios emulated sections of a small and medium-sized enterprise (SME), and all the developed microservices communicate with each other to perform data filtering, processing, storage, query, and sensor data acquisition. The results show that it is possible to carry out these functions with low latency and without any decrement or even increase in performance when compared with more conventional cloud computing structures, and it is also possible to manipulate different products that do not have single, consolidated structures. Moreover, there is no need to update machines or communication structures, which are the main factors of rapid obsolescence. Therefore, following the steps of the AIFC development, the results from the proof of concept to the minimum viable product and scalability tests correspond to a roadmap for a sustainable solution and are an important tool for both Industry 4.0 and SMEs. Full article
Show Figures

Figure 1

Figure 1
<p>Interconnection between Industry 4.0, SMEs, electronics, and sustainability.</p>
Full article ">Figure 2
<p>AIFC block diagram.</p>
Full article ">Figure 3
<p>The proof-of-concept step.</p>
Full article ">Figure 4
<p>Elements added to the ESB for the MVP.</p>
Full article ">Figure 5
<p>Working Groups in the Scalability Phase.</p>
Full article ">Figure 6
<p>Proposed roadmap for developing the MVP AIFC structure.</p>
Full article ">
20 pages, 3279 KiB  
Article
Slot Occupancy-Based Collision Avoidance Algorithm for Very-High-Frequency Data Exchange System Network in Maritime Internet of Things
by Sol-Bee Lee, Jung-Hyok Kwon, Bu-Young Kim, Woo-Seong Shim, Taeshik Shon and Eui-Jik Kim
Appl. Sci. 2024, 14(24), 11751; https://doi.org/10.3390/app142411751 - 16 Dec 2024
Viewed by 560
Abstract
The maritime industry is undergoing a paradigm shift driven by rapid advancements in wireless communication and an increase in maritime traffic data. However, the existing automatic identification system (AIS) struggles to accommodate the increasing maritime traffic data, leading to the introduction of the [...] Read more.
The maritime industry is undergoing a paradigm shift driven by rapid advancements in wireless communication and an increase in maritime traffic data. However, the existing automatic identification system (AIS) struggles to accommodate the increasing maritime traffic data, leading to the introduction of the very-high-frequency (VHF) data exchange system (VDES). While the VDES increases bandwidth and data rates, ensuring the stable transmission of maritime IoT (MIoT) application data in congested coastal areas remains a challenge due to frequent collisions of AIS messages. This paper presents a slot occupancy-based collision avoidance algorithm (SOCA) for a VDES network in the MIoT. SOCA is designed to mitigate the impact of interference caused by transmissions of AIS messages on transmissions of VDE-Terrestrial (VDE-TER) data in coastal areas. To this end, SOCA provides four steps: (1) construction of the neighbor information table (NIT) and VDES frame maps, (2) construction of the candidate slot list, (3) TDMA channel selection, and (4) slot selection for collision avoidance. SOCA operates by constructing the NIT based on AIS messages to estimate the transmission intervals of AIS messages and updating VDES frame maps upon receiving VDES messages to monitor slot usage dynamically. After that, it generates a candidate slot list for VDE-TER channels, classifying the slots into interference and non-interference categories. SOCA then selects a TDMA channel that minimizes AIS interference and allocates slots with low expected occupancy probabilities to avoid collisions. To evaluate the performance of SOCA, we conducted experimental simulations under static and dynamic ship scenarios. In the static ship scenario, SOCA outperforms the existing VDES, achieving improvements of 13.58% in aggregate throughput, 11.50% in average latency, 33.60% in collision ratio, and 22.64% in packet delivery ratio. Similarly, in the dynamic ship scenario, SOCA demonstrates improvements of 7.30%, 11.99%, 39.27%, and 11.82% in the same metrics, respectively. Full article
Show Figures

Figure 1

Figure 1
<p>VDES functions and frequency usage.</p>
Full article ">Figure 2
<p>VDES frame structure.</p>
Full article ">Figure 3
<p>VDE-TER default slotmap.</p>
Full article ">Figure 4
<p>Example of ship scenarios: (<b>a</b>) static ship scenario and (<b>b</b>) dynamic ship scenario.</p>
Full article ">Figure 5
<p>Aggregate throughput: (<b>a</b>) static ship scenario and (<b>b</b>) dynamic ship scenario.</p>
Full article ">Figure 6
<p>Average latency: (<b>a</b>) static ship scenario and (<b>b</b>) dynamic ship scenario.</p>
Full article ">Figure 7
<p>Collision ratio: (<b>a</b>) static ship scenario and (<b>b</b>) dynamic ship scenario.</p>
Full article ">Figure 8
<p>Packet delivery ratio: (<b>a</b>) static ship scenario and (<b>b</b>) dynamic ship scenario.</p>
Full article ">
18 pages, 406 KiB  
Article
A Blockchain Multi-Chain Federated Learning Framework for Enhancing Security and Efficiency in Intelligent Unmanned Ports
by Zeqiang Xie and Zijian Li
Electronics 2024, 13(24), 4926; https://doi.org/10.3390/electronics13244926 - 13 Dec 2024
Viewed by 487
Abstract
The integration of blockchain and federated learning (FL) has emerged as a promising solution to address data privacy and security challenges in Intelligent Unmanned Ports (IUPs). However, existing blockchain federated learning (BFL) frameworks encounter significant limitations, including high latency, inefficient data processing, and [...] Read more.
The integration of blockchain and federated learning (FL) has emerged as a promising solution to address data privacy and security challenges in Intelligent Unmanned Ports (IUPs). However, existing blockchain federated learning (BFL) frameworks encounter significant limitations, including high latency, inefficient data processing, and limited scalability, particularly in scenarios with sparse and distributed data. This paper introduces a novel multi-chain federated learning (MFL) framework to overcome these challenges. The proposed MFL architecture interconnects multiple BFL chains to facilitate the secure and efficient aggregation of data across distributed devices. The framework enhances privacy and efficiency by transmitting aggregated model updates rather than raw data. A low-frequency consensus mechanism is employed to improve performance, leveraging game theory for representative selection to optimize model aggregation while reducing inter-chain communication overhead. The experimental results demonstrate that the MFL framework significantly outperforms traditional BFL in terms of accuracy, latency, and system efficiency, particularly under the conditions of high data sparsity and network latency. These findings highlight the potential of MFL to provide a scalable and secure solution for decentralized learning in IUP environments, with broader applicability to other distributed systems such as the Industrial Internet of Things (IIoT). Full article
(This article belongs to the Special Issue Empowering IoT with AI: AIoT for Smart and Autonomous Systems)
Show Figures

Figure 1

Figure 1
<p>The figure illustrates the workflow of the proposed MFL framework. Data are collected locally from Port Equipment and Cargo Ship Equipment, where self-training is performed to generate gradients. These gradients are securely stored and processed in the Blockchain Storage Units, supported by Blockchain Computing Nodes. The Cross-Chain Communication Nodes enable efficient gradient exchange between blockchains, facilitating global model updates while ensuring data privacy and system scalability.</p>
Full article ">Figure 2
<p>Workflow of the low-frequency consensus.</p>
Full article ">Figure 3
<p>Impact of data sparsity on model performance.</p>
Full article ">Figure 4
<p>Comparison of model performance–performance by the times.</p>
Full article ">Figure 5
<p>Comparison of model performance–loss by the times.</p>
Full article ">Figure 6
<p>Comparison of convergence, performance by the times, and loss by the times.</p>
Full article ">Figure 7
<p>Comparisons of the system delay between different nodes of BFL and MFL.</p>
Full article ">
22 pages, 6724 KiB  
Article
An FPGA-Based Trigonometric Kalman Filter Approach for Improving the Measurement Quality of a Multi-Head Rotational Encoder
by Dariusz Janiszewski
Energies 2024, 17(23), 6122; https://doi.org/10.3390/en17236122 - 5 Dec 2024
Viewed by 445
Abstract
This article introduces an advanced theoretical approach, named the Trigonometric Kalman Filter (TKF), to enhance measurement accuracy for multi-head rotational encoders. Leveraging the processing capabilities of a Field-Programmable Gate Array (FPGA), the proposed TKF algorithm uses trigonometric functions and sophisticated signal fusion techniques [...] Read more.
This article introduces an advanced theoretical approach, named the Trigonometric Kalman Filter (TKF), to enhance measurement accuracy for multi-head rotational encoders. Leveraging the processing capabilities of a Field-Programmable Gate Array (FPGA), the proposed TKF algorithm uses trigonometric functions and sophisticated signal fusion techniques to provide highly accurate real-time angle estimation with rapid response. The inclusion of the Coordinate Rotation Digital Computer (CORDIC) algorithm enables swift and efficient computation of trigonometric values, facilitating precise tracking of angular position and rotational speed. This approach represents a notable advancement in control systems, where high accuracy and minimal latency are essential for optimal performance. The paper addresses key challenges in angle measurement, particularly the signal fusion inaccuracies that often impede precision in high-demand applications. Implementing the TKF with an FPGA-based pure fixed-point method not only enhances computational efficiency but also significantly reduces latency when compared to conventional software-based solutions. This FPGA-based implementation is particularly advantageous in real-time applications where processing speed and accuracy are critical, and it demonstrates the effective integration of hardware acceleration in improving measurement fidelity. To validate the effectiveness of this approach, the TKF was rigorously tested on a precision drive control system, configured for a direct PMSM drive in an astronomical telescope mount equipped with a standard 0.5m telescope frequently used by astronomers. This real-world application highlights the TKF’s ability to meet the stringent positioning and measurement accuracy requirements characteristic of astronomical observation, a field where minute angular adjustments are critical. The FPGA-based design enables high-frequency updates, essential for managing the minor, precise adjustments required for telescope control. The study includes a comprehensive computational analysis and experimental testing on an Altera Stratix FPGA board, presenting a detailed comparison of the TKF’s performance with other known methods, including fusion techniques such as differential methods, αβ filters, and related Kalman filtering applied to one sensors. The study demonstrates that the four-head fusion configuration of the TKF outperforms traditional methods in terms of measurement accuracy and responsiveness. Full article
(This article belongs to the Section F3: Power Electronics)
Show Figures

Figure 1

Figure 1
<p>Typical computing step for the CORDIC algorithm.</p>
Full article ">Figure 2
<p>Rotating encoder ring (ER) and four fixed read heads (RH1–RH4): real montage (<b>a</b>), schematic view (<b>b</b>).</p>
Full article ">Figure 3
<p>TKF diagram.</p>
Full article ">Figure 4
<p>The laboratory prototype astronomical two-axis direct-drive mount with an <math display="inline"><semantics> <mrow> <mn>11</mn> <mo>″</mo> </mrow> </semantics></math> telescope [<a href="#B30-energies-17-06122" class="html-bibr">30</a>].</p>
Full article ">Figure 5
<p>FPGA Controllerl—DE4.</p>
Full article ">Figure 6
<p>Schematic diagram of the computation system in Quartus II software.</p>
Full article ">Figure 7
<p>Trial scenario—torque demand (<math display="inline"><semantics> <msub> <mi>i</mi> <mi>q</mi> </msub> </semantics></math>) to produce small movement.</p>
Full article ">Figure 8
<p>TKF results with floating-point (<b>a</b>) and fixed-point (<b>b</b>) operations.</p>
Full article ">Figure 9
<p>Read and estimated position in dynamical (<b>a</b>) and steady state (<b>b</b>).</p>
Full article ">Figure 10
<p>Comparison of estimated speed <math display="inline"><semantics> <msub> <mover accent="true"> <mi>ω</mi> <mo stretchy="false">^</mo> </mover> <mi>r</mi> </msub> </semantics></math> in dynamical (<b>a</b>) and steady-state (<b>b</b>) operations.</p>
Full article ">Figure 11
<p>Comparison of dynamical behavior’s estimated speed <math display="inline"><semantics> <msub> <mover accent="true"> <mi>ω</mi> <mo stretchy="false">^</mo> </mover> <mi>r</mi> </msub> </semantics></math> during large changes in value, for positive (<b>a</b>) and negative (<b>b</b>) response.</p>
Full article ">Figure 12
<p>Comparison of dynamical behavior results with other methods for whole scenario (<b>a</b>) and enlarged part with biggest changes (<b>b</b>).</p>
Full article ">
38 pages, 8761 KiB  
Article
Fiducial Reference Measurements for Air Quality Monitoring Using Ground-Based MAX-DOAS Instruments (FRM4DOAS)
by Michel Van Roozendael, Francois Hendrick, Martina M. Friedrich, Caroline Fayt, Alkis Bais, Steffen Beirle, Tim Bösch, Monica Navarro Comas, Udo Friess, Dimitris Karagkiozidis, Karin Kreher, Alexis Merlaud, Gaia Pinardi, Ankie Piters, Cristina Prados-Roman, Olga Puentedura, Lucas Reischmann, Andreas Richter, Jan-Lukas Tirpitz, Thomas Wagner, Margarita Yela and Steffen Ziegleradd Show full author list remove Hide full author list
Remote Sens. 2024, 16(23), 4523; https://doi.org/10.3390/rs16234523 - 2 Dec 2024
Cited by 1 | Viewed by 622
Abstract
The UV–Visible Working Group of the Network for the Detection of Atmospheric Composition Changes (NDACC) focuses on the monitoring of air-quality-related stratospheric and tropospheric trace gases in support of trend analysis, satellite validation and model studies. Tropospheric measurements are based on MAX-DOAS-type instruments [...] Read more.
The UV–Visible Working Group of the Network for the Detection of Atmospheric Composition Changes (NDACC) focuses on the monitoring of air-quality-related stratospheric and tropospheric trace gases in support of trend analysis, satellite validation and model studies. Tropospheric measurements are based on MAX-DOAS-type instruments that progressively emerged in the years 2010 onward. In the interest of improving the overall consistency of the NDACC MAX-DOAS network and facilitating its further extension to the benefit of satellite validation, the ESA initiated, in late 2016, the FRM4DOAS project, which aimed to set up the first centralised data processing system for MAX-DOAS-type instruments. Developed by a consortium of European scientists with proven expertise in measurements, data extraction algorithms and software design specialities, the system has now reached pre-operational status and has demonstrated its ability to deliver a set of quality-controlled atmospheric composition data products with a latency of one day. The processing system has been designed using a highly modular approach, making it easy to integrate new tools or processing updates. It incorporates advanced algorithms selected by community consensus for the retrieval of total ozone, lower tropospheric and stratospheric NO2 vertical profiles and formaldehyde profiles. The ozone and NO2 products are currently generated from a total of 22 stations and delivered daily to the NDACC rapid delivery (RD) repository, with an additional mirroring to the ESA Validation Data Centre (EVDC). Although it is still operated in a pre-operational/demonstrational mode, FRM4DOAS was already used for several validation and science studies, and it was also deployed in support of field campaigns for the validation of the TROPOMI and GEMS satellite missions. It recently went through a CEOS-FRM self-assessment process aiming at assessing the level of maturity of the service in terms of instrumentation, operations, data sampling, metrology and verification. Based on this evaluation, it falls under class C, which is a good rating but also implies that further improvements are needed to reach full compliance with FRM standards, i.e., class A. Full article
Show Figures

Figure 1

Figure 1
<p>Current geographical distribution of the UV–Visible instruments that are centrally processed by the FRM4DOAS system (for more details, see <a href="#remotesensing-16-04523-t001" class="html-table">Table 1</a>).</p>
Full article ">Figure 2
<p>From top to bottom: slope, intercept, regression coefficient and root mean squares (RMSs) of a linear regression between true and retrieved total aerosol optical thickness derived from O<sub>4</sub> dSCDs at 360 nm and 477 nm and HCHO and NO<sub>2</sub> tropospheric total columns for each of the algorithms. Dots show all data; circular symbols represent pie charts that quantify the fraction of data flagged as valid. Intercept and RMS values are in dimensionless units for aerosols and 10<sup>16</sup> molec cm<sup>−2</sup> for HCHO and NO<sub>2</sub>. This figure is adapted from (Figure 18 in [<a href="#B25-remotesensing-16-04523" class="html-bibr">25</a>]).</p>
Full article ">Figure 3
<p>Twilight zenith-sky geometry used for stratospheric trace gas vertical profile retrievals. As indicated, the mean scattering altitude depends on the solar elevation.</p>
Full article ">Figure 4
<p><b>Top</b>: Zenith CI values and frequency distribution for Xianghe. <b>Bottom</b>: the normalised CI values (points) versus SZA. The green, orange and red regions correspond to the “good”, “mediocre” and “bad” regions as defined by the sky flag. Figures taken from [<a href="#B42-remotesensing-16-04523" class="html-bibr">42</a>].</p>
Full article ">Figure 5
<p>Cloud classification scheme. Paths with black arrows indicate the primary classification results: Only one primary classification result can be attributed to a given elevation sequence. Paths with blue arrows indicate secondary classification results, which complement the primary classification results. Figure taken from [<a href="#B43-remotesensing-16-04523" class="html-bibr">43</a>].</p>
Full article ">Figure 6
<p>The workflow diagram of the FRM4DOAS processing system. Circles represent files (green are level-1 files, grey are internal files, cyan are master netCDF4 level-2 files, orange are level-2 files in standard GEOMS hdf4 format), dark blue pentagons represent processing steps and magenta diamond-shapes are decision steps.</p>
Full article ">Figure 7
<p>Concept diagram of an FRM4DOAS module. See main text for more details.</p>
Full article ">Figure 8
<p>Decision tree for potential measurement type. Note that measurement type 1 (off-axis measurement) is never assigned as definite. Only certain differences between originally reported and newly classified will be flagged as a warning (7 → 2 or 11, 11 → 7); others will not be flagged. Measurement types are never changed. Current limits are given in <a href="#remotesensing-16-04523-t008" class="html-table">Table 8</a>.</p>
Full article ">Figure 9
<p>Annual variation of the tropospheric NO<sub>2</sub> column for ground-based MAX-DOAS and TROPOMI over Xianghe, using only coincident measurements. Black curves show the ground-based median, red curves show TROPOMI median, dashed lines show the filtering with processor version 1.0, solid lines with filtering of processor version 1.1. For details, see text.</p>
Full article ">Figure 10
<p>Current workflow for the submission to NDACC and EVDC databases.</p>
Full article ">Figure 11
<p>Comparison of retrieved surface concentrations of HCHO (top) and NO<sub>2</sub> (bottom) with LP-DOAS observations during CINDI-2 (12–28 September 2016). The upper panel in each figure shows the comparison between LP-DOAS (black) and the median of the data (blue); the lower panel includes all individual values (represented in different colours). Results from invalid profiles are shown in washed-out colours. For NO<sub>2</sub>, lidar data are included as grey crosses where available. The colorbar at the bottom of the figure specifies the cloud conditions. Green stands for good, orange for critical and red for bad conditions.</p>
Full article ">Figure 12
<p>Comparison of all retrieved tropospheric columns of NO<sub>2</sub> and results from direct sun measurements (top) and comparisons of HCHO median values with all individual retrievals (bottom). The grey-shaded area in the NO<sub>2</sub> panel indicates the uncertainty of the direct sun columns. Other descriptions of <a href="#remotesensing-16-04523-f011" class="html-fig">Figure 11</a> apply.</p>
Full article ">Figure 13
<p>Comparison of MAX-DOAS and sun-photometer retrieved AOD during the CINDI-2 campaign (12–28 September 2016). The first row shows the comparison between medians and total and partial sun-photometer AOD; the second and third rows show all results for the UV and the vis aerosol retrievals. Other descriptions of <a href="#remotesensing-16-04523-f011" class="html-fig">Figure 11</a> apply.</p>
Full article ">Figure 14
<p>Overview of the FRM4DOAS tropospheric NO<sub>2</sub> vertical profile demonstrational data processing covering the period from January 2018 until late September 2024. Note that for double-channel instruments, NO<sub>2</sub> files are produced both for the UV and visible channels.</p>
Full article ">Figure 15
<p>Overview of the FRM4DOAS total ozone demonstrational data processing covering the period from January 2018 until late September 2024.</p>
Full article ">Figure 16
<p>Intercomparison of NO<sub>2</sub> and HCHO VCD from three collocated instruments during the GMAP 2021 campaign (Incheon, South Korea, October 2021). The red shows the linear regression line, while the dashed black line corresponds to the 1:1 line.</p>
Full article ">Figure 17
<p>Box-and-wisher plot of the daily relative biases for S5p/TROPOMI tropospheric NO<sub>2</sub> v2.4 vs. MAX-DOAS from the FRM4DOAS processing chain main stations (mid-July 2018 to December 2023). The stations are ordered from bottom to top by increasing median NO<sub>2</sub> MAX-DOAS VCD values (values given in brackets in units of 10<sup>15</sup> molec.cm<sup>−2</sup>).</p>
Full article ">Figure 18
<p>Mosaic plot of the monthly median relative biases for S5p tropospheric NO<sub>2</sub> v2.4 vs. MAX-DOAS based on the FRM4DOAS processing. As in <a href="#remotesensing-16-04523-f017" class="html-fig">Figure 17</a>, the stations are ordered from bottom to top by increasing median NO<sub>2</sub> MAX-DOAS VCD values (values given in brackets in units of 10<sup>15</sup> molec.cm<sup>−2</sup>).</p>
Full article ">Figure 19
<p>Overview plot of the S5p tropospheric NO<sub>2</sub> v2.4 vs. MAX-DOAS comparisons results based on the NIDFORVAL (N4V), FRM4DOAS (FRM) and automated validation server (AVS) treatments for a subset of sites (see text). Panels (<b>a</b>–<b>c</b>) present scatter plots for each case including statistics information, and panels (<b>d</b>,<b>e</b>) summarise the final comparison spread in absolute and relative cases as bar plots.</p>
Full article ">
14 pages, 2922 KiB  
Article
Enhancing Security of Automotive OTA Firmware Updates via Decentralized Identifiers and Distributed Ledger Technology
by Ana Kovacevic and Nenad Gligoric
Electronics 2024, 13(23), 4640; https://doi.org/10.3390/electronics13234640 - 25 Nov 2024
Viewed by 924
Abstract
The increasing connectivity and complexity of automotive systems require enhanced mechanisms for firmware updates to ensure security and integrity. Traditional methods are insufficient for modern vehicles that require seamless over-the-air (OTA) updates. Current OTA mechanisms often lack robust security measures, leaving vehicles vulnerable [...] Read more.
The increasing connectivity and complexity of automotive systems require enhanced mechanisms for firmware updates to ensure security and integrity. Traditional methods are insufficient for modern vehicles that require seamless over-the-air (OTA) updates. Current OTA mechanisms often lack robust security measures, leaving vehicles vulnerable to attacks. This paper proposes an innovative approach based on the use of decentralized identifiers (DIDs) and distributed ledger technology (DLT) for secure OTA firmware updates of on-vehicle software. By utilizing DIDs for unique vehicle identification, as well as verifiable credentials (VCs) and verifiable presentations (VPs) for secure information exchange and verification, the solution ensures the integrity and authenticity of software updates. It also allows for the revocation of specific updates, if necessary, thereby improving overall security. The security analysis applied the STRIDE methodology, which enabled the identification of potential threats, including spoofing, tampering, and privilege escalation. The results showed that our solution effectively mitigates these threats, while a performance evaluation indicated low latency during operations. Full article
(This article belongs to the Special Issue Advanced Industry 4.0/5.0: Intelligence and Automation)
Show Figures

Figure 1

Figure 1
<p>High-level architecture of the proposed solution.</p>
Full article ">Figure 2
<p>DIDs generation and creation of VC for the vehicle.</p>
Full article ">Figure 3
<p>VP sent by the OEM.</p>
Full article ">Figure 4
<p>Sequence diagram for verifying VP.</p>
Full article ">Figure 5
<p>Sequence diagram for firmware hash validation.</p>
Full article ">Figure 6
<p>Process of downloading and verifying firmware hash values: (<b>a</b>) shows the metadata field in the IOTA explorer where the hash is displayed; (<b>b</b>) illustrates the vehicle comparing its local firmware hash with the hash retrieved from the DLT.</p>
Full article ">
22 pages, 1498 KiB  
Article
Optimizing Microservice Deployment in Edge Computing with Large Language Models: Integrating Retrieval Augmented Generation and Chain of Thought Techniques
by Kan Feng, Lijun Luo, Yongjun Xia, Bin Luo, Xingfeng He, Kaihong Li, Zhiyong Zha, Bo Xu and Kai Peng
Symmetry 2024, 16(11), 1470; https://doi.org/10.3390/sym16111470 - 5 Nov 2024
Cited by 1 | Viewed by 1381
Abstract
Large Language Models (LLMs) have demonstrated impressive capabilities in autogenerating code based on natural language instructions provided by humans. We observed that in the microservice models of edge computing, the problem of deployment latency optimization can be transformed into an NP-hard mathematical optimization [...] Read more.
Large Language Models (LLMs) have demonstrated impressive capabilities in autogenerating code based on natural language instructions provided by humans. We observed that in the microservice models of edge computing, the problem of deployment latency optimization can be transformed into an NP-hard mathematical optimization problem. However, in the real world, deployment strategies at the edge often require immediate updates, while human-engineered code tends to be lagging. To bridge this gap, we innovatively integrated LLMs into the decision-making process for microservice deployment. Initially, we constructed a private Retrieval Augmented Generation (RAG) database containing prior knowledge. Subsequently, we employed meticulously designed step-by-step inductive instructions and used the chain of thought (CoT) technique to enable the LLM to learn, reason, reflect, and regenerate. We decomposed the microservice deployment latency optimization problem into a collection of granular sub-problems (described in natural language), progressively providing instructions to the fine-tuned LLM to generate corresponding code blocks. The generated code blocks underwent integration and consistency assessment. Additionally, we prompted the LLM to generate code without the use of the RAG database for comparative analysis. We executed the aforementioned code and comparison algorithm under identical operational environments and simulation parameters, conducting rigorous result analysis. Our fine-tuned model significantly reduced latencies by 22.8% in handling surges in request flows, 37.8% in managing complex microservice types, and 39.5% in processing increased network nodes compared to traditional algorithms. Moreover, our approach demonstrated marked improvements in latency performance over LLMs not utilizing RAG technology and reinforcement learning algorithms reported in other literature. The use of LLMs also highlights the concept of symmetry, as the symmetrical structure of input-output relationships in microservice deployment models aligns with the LLM’s inherent ability to process and generate balanced and optimized code. Symmetry in this context allows for more efficient resource allocation and reduces redundant operations, further enhancing the model’s effectiveness. We believe that LLMs hold substantial potential in optimizing microservice deployment models. Full article
(This article belongs to the Section Computer)
Show Figures

Figure 1

Figure 1
<p>Our Large language Model Assisted Microservice Deployment framework workflow.</p>
Full article ">Figure 2
<p>An example of the mobile edge computing network. Microservice deployment and request routing policies are constrained by the computing resources of the edge node servers.Dotted arrows of different colors represent different types of routing requests.</p>
Full article ">Figure 3
<p>This is the flowchart of the DDPG algorithm, which uses the Actor-Critic framework as its base. The algorithm employs dual neural networks for both the policy and value functions, comprising an Online network and a Target network. The Critic Target network approximates the Q-value function for the next state-action pair and evaluates the current policy, ensuring slow parameter updates via a soft update mechanism. The Actor Target network provides the policy for the next state. Experience samples (current state <math display="inline"><semantics> <msub> <mi>s</mi> <mi>t</mi> </msub> </semantics></math>, action <math display="inline"><semantics> <msub> <mi>a</mi> <mi>t</mi> </msub> </semantics></math>, reward <math display="inline"><semantics> <msub> <mi>r</mi> <mi>t</mi> </msub> </semantics></math>, next state <math display="inline"><semantics> <msub> <mi>s</mi> <mrow> <mi>t</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </semantics></math>) generated by Actor-environment interactions are stored in a replay buffer. Batch sampling from this buffer removes sample correlation and dependency, facilitating easier algorithm convergence.</p>
Full article ">Figure 4
<p>Our Retrieval Augement Generation flowcharts.</p>
Full article ">Figure 5
<p>Code evaluation acceptance score table.</p>
Full article ">Figure 6
<p>Total delay and Average delay Performance with Increasing Request Flows.</p>
Full article ">Figure 7
<p>Total delay and Average delay Performance with different Microservice Classes.</p>
Full article ">Figure 8
<p>Total delay and Average delay Performance with different number of edge nodes.</p>
Full article ">
15 pages, 5636 KiB  
Article
Sequentialized Virtual File System: A Virtual File System Enabling Address Sequentialization for Flash-Based Solid State Drives
by Inhwi Hwang, Sunggon Kim, Hyeonsang Eom and Yongseok Son
Computers 2024, 13(11), 284; https://doi.org/10.3390/computers13110284 - 2 Nov 2024
Viewed by 840
Abstract
Solid-state drives (SSDs) are widely adopted in mobile devices, desktop PCs, and data centers since they offer higher throughput, lower latency, and lower power consumption to modern computing systems and applications compared with hard disk drives (HDDs). However, the performance of the SSDs [...] Read more.
Solid-state drives (SSDs) are widely adopted in mobile devices, desktop PCs, and data centers since they offer higher throughput, lower latency, and lower power consumption to modern computing systems and applications compared with hard disk drives (HDDs). However, the performance of the SSDs can be degraded depending on the I/O access pattern due to the unique characteristics of SSDs. For example, random I/O operation degrades the SSD performance since it reduces the spatial locality and induces garbage collection (GC) overhead. In this paper, we present an address reshaping scheme in a virtual file system (VFS) called sVFS for improving performance and easy deployment. To do this, it first sequentializes a random access pattern in the VFS layer which is an abstract layer on top of a more concrete file system. Thus, our scheme is independent and easily deployed on any concrete file systems, block layer configuration (e.g., RAID), and devices. Second, we adopt a mapping table for managing sequentialized addresses, which guarantees correct read operations. Third, we support transaction processing for updating the mapping table to avoid sacrificing the consistency. We implement our scheme at the VFS layer in Linux kernel 5.15.34. The evaluation results show that our scheme improve the random write throughput by up to 27%, 36%, 34%, and 2.35× using the microbenchmark and 25%, 22%, 20%, and 3.51× using the macrobenchmark compared with the existing scheme in the case of EXT4, F2FS, XFS, and BTRFS, respectively. Full article
Show Figures

Figure 1

Figure 1
<p>Performance of sequential and random write on SSD.</p>
Full article ">Figure 2
<p>Architecture overview of the proposed scheme (sVFS). (FP: file position, Orig.: original position, Seq.: sequentialized position.)</p>
Full article ">Figure 3
<p>An example of file position sequentialization of sVFS in write operations. When an entry of the original and sequentialized position is inserted in the mapping table, the entries are sorted by the original position. (NFP: next file position, FP: file position, Orig.: original position, Seq.: sequentialized position.)</p>
Full article ">Figure 4
<p>An example of file position sequentialization of sVFS in read operations. (NFP: next file position, FP: file position, Orig.: original position, Seq.: sequentialized position.)</p>
Full article ">Figure 5
<p>An example of the cleaning operation of sVFS. (FP: file position, Orig.: original position, Seq.: sequentialized position.)</p>
Full article ">Figure 6
<p>Random write throughput of existing VFS and sVFS with file systems in FIO benchmark.</p>
Full article ">Figure 7
<p>Sequential write, sequential read, and random read throughput of existing VFS and sVFS with file systems in FIO benchmark.</p>
Full article ">Figure 8
<p>Throughput of existing VFS and sVFS with file systems in FFSB.</p>
Full article ">
17 pages, 532 KiB  
Article
Fault-Tolerant Scheduling Mechanism for Dynamic Edge Computing Scenarios Based on Graph Reinforcement Learning
by Yuze Zhang, Geming Xia, Chaodong Yu, Hongcheng Li and Hongfeng Li
Sensors 2024, 24(21), 6984; https://doi.org/10.3390/s24216984 - 30 Oct 2024
Viewed by 889
Abstract
With the proliferation of Internet of Things (IoT) devices and edge nodes, edge computing has taken on much of the real-time data processing and low-latency response tasks which were previously managed by cloud computing. However, edge computing often encounters challenges such as network [...] Read more.
With the proliferation of Internet of Things (IoT) devices and edge nodes, edge computing has taken on much of the real-time data processing and low-latency response tasks which were previously managed by cloud computing. However, edge computing often encounters challenges such as network instability and dynamic resource variations, which can lead to task interruptions or failures. To address these issues, developing a fault-tolerant scheduling mechanism is crucial to ensure that a system continues to operate efficiently even when some nodes experience failures. In this paper, we propose an innovative fault-tolerant scheduling model based on asynchronous graph reinforcement learning. This model incorporates a deep reinforcement learning framework built upon a graph neural network, allowing it to accurately capture the complex communication relationships between computing nodes. The model generates fault-tolerant scheduling actions as output, ensuring robust performance in dynamic environments. Additionally, we introduce an asynchronous model update strategy, which enhances the model’s capability of real-time dynamic scheduling through multi-threaded parallel interactions with the environment and frequent model updates via running threads. The experimental results demonstrate that the proposed method outperformed the baseline algorithms in terms of quality of service (QoS) assurance and fault-tolerant scheduling capabilities. Full article
(This article belongs to the Section Internet of Things)
Show Figures

Figure 1

Figure 1
<p>Edge computing architecture.</p>
Full article ">Figure 2
<p>Task scheduling model.</p>
Full article ">Figure 3
<p>Graph modeling process.</p>
Full article ">Figure 4
<p>Dynamic update process.</p>
Full article ">Figure 5
<p>Algorithm comparison.</p>
Full article ">Figure 6
<p>Stability across five experimental rounds.</p>
Full article ">Figure 7
<p>Impact of learning rate on optimization.</p>
Full article ">Figure 8
<p>Task cost dispersion and unloading balance.</p>
Full article ">Figure 9
<p>Failure rate trends.</p>
Full article ">Figure 10
<p>Model performance in dynamic environments.</p>
Full article ">
21 pages, 991 KiB  
Article
A Novel Online Position Estimation Method and Movement Sonification System: The Soniccup
by Thomas H. Nown, Madeleine A. Grealy, Ivan Andonovic, Andrew Kerr and Christos Tachtatzis
Sensors 2024, 24(19), 6279; https://doi.org/10.3390/s24196279 - 28 Sep 2024
Viewed by 3406
Abstract
Existing methods to obtain position from inertial sensors typically use a combination of multiple sensors and orientation modeling; thus, obtaining position from a single inertial sensor is highly desirable given the decreased setup time and reduced complexity. The dead reckoning method is commonly [...] Read more.
Existing methods to obtain position from inertial sensors typically use a combination of multiple sensors and orientation modeling; thus, obtaining position from a single inertial sensor is highly desirable given the decreased setup time and reduced complexity. The dead reckoning method is commonly chosen to obtain position from acceleration; however, when applied to upper limb tracking, the accuracy of position estimates are questionable, which limits feasibility. A new method of obtaining position estimates through the use of zero velocity updates is reported, using a commercial IMU, a push-to-make momentary switch, and a 3D printed object to house the sensors. The generated position estimates can subsequently be converted into sound through sonification to provide audio feedback on reaching movements for rehabilitation applications. An evaluation of the performance of the generated position estimates from a system labeled ‘Soniccup’ is presented through a comparison with the outputs from a Vicon Nexus system. The results indicate that for reaching movements below one second in duration, the Soniccup produces positional estimates with high similarity to the same movements captured through the Vicon system, corresponding to comparable audio output from the two systems. However, future work to improve the performance of longer-duration movements and reduce the system latency to produce real-time audio feedback is required to improve the acceptability of the system. Full article
Show Figures

Figure 1

Figure 1
<p>Rudimentary example of a movement sonification system. The stages of the system occur sequentially, starting with the capture of performed movement, the extraction and processing of data, translation into the auditory domain, and the playback of audio as a mode of feedback to the movement performer.</p>
Full article ">Figure 2
<p>Images showing the hardware components used in the Soniccup system. Image (<b>a</b>) shows the Soniccup placed on the table. An NGIMU sensor plus stripboard are attached to the top of the 3D printed object. The stripboard contains analogue electronic components used to connect a push-to-make switch to the NGIMU. Image (<b>b</b>) shows the protruded segment of the push-to-make switch at the bottom of the Soniccup.</p>
Full article ">Figure 3
<p>Block diagram showing the signal conditioning steps of the sonification stage, starting from analogue input and Earth acceleration.</p>
Full article ">Figure 4
<p>Figure depicting the recording of mechanical bouncing. Two events are shown with orange and green circles, corresponding to a momentary placement and momentary lift of the Soniccup, respectively.</p>
Full article ">Figure 5
<p>Figure showing associated data prior to and with the first designed Kalman filter: (<b>top</b>) plot of analogue voltage obtained through NGIMU, (<b>middle</b>) plot of raw data values corresponding to acceleration in Earth reference frame obtained through NGIMU sensor, (<b>bottom</b>) output estimated velocity from first Kalman filter.</p>
Full article ">Figure 6
<p>Figure showing velocity data before and after the first stage of processing; the orange trace corresponds to the estimated velocity plot through the first Kalman filter, and the green trace is the processed velocity data with ZUPT.</p>
Full article ">Figure 7
<p>Figure showing velocity data before and after the second stage of processing; the green trace corresponds to the estimated velocity plot immediately after the application of ZUPT, and the red trace corresponds to the velocity data after further error mitigation to remove the intermediary accumulation error that occurs during stationary periods.</p>
Full article ">Figure 8
<p>Figure showing associated position data as output of the second Kalman filter used in this algorithm. The purple trace corresponds to position data as output of the second Kalman filter, without integration error mitigation. The blue trace corresponds to the same position data with the inclusion of a function to reset the starting position to zero at every second placement.</p>
Full article ">Figure 9
<p>Figure showing associated position data in the <span class="html-italic">Z</span>-axis as output of the second Kalman filter used in this algorithm. The purple trace corresponds to position data as output of the second Kalman filter, without integration error mitigation. The olive trace corresponds to the same position data with the inclusion of a function to reset starting position to zero at every second placement.</p>
Full article ">Figure 10
<p>Figure showing the effect of the additional correction mechanism implemented for data associated with the cranial/caudal (<span class="html-italic">Z</span>) axis. The olive trace represents the data before the correction mechanism, and the blue trace represents data after the correction mechanism.</p>
Full article ">Figure 11
<p>Figure containing four plots corresponding to the estimated position from the Soniccup. The top plot corresponds to the frontal/parietal (<span class="html-italic">X</span>) axis, the second plot corresponds to the medial/lateral (<span class="html-italic">Y</span>) axis, the third plot corresponds to the cranial/caudal (<span class="html-italic">Z</span>) axis, and the bottom corresponds to the radial distance.</p>
Full article ">Figure 12
<p>Scatter plot presenting the calculated MSE for each movement. Data points with a positive velocity correspond to the extension phase of the reaching movement, whilst data points with negative velocity correspond to the retraction phase. Boxes enclose plot segments and are labeled with association to the movement set: ‘Movement 1’ for normal speed movement, ‘Movement 2’ for slow speed movement, and ‘Movement 3’ for fast speed movement.</p>
Full article ">Figure 13
<p>Plot presenting the radial distance obtained through the Soniccup (blue) and Vicon (orange) systems for four movements within Movement Set 2. Data associated with each trace have been normalized so that the maximum data value in the 15 captured reaching movements is equal to one, resulting in the trace associated with the Soniccup showing all data points in the first four reaching movements to be &lt;0.7.</p>
Full article ">Figure A1
<p>Figure showing six plots corresponding to the effect of altering the audio resolution parameter as stated in Equation (<a href="#FD9-sensors-24-06279" class="html-disp-formula">A3</a>) on ‘Movement Set 1’. Labels (<b>a</b>–<b>f</b>) correspond to the numeric values 1, 2, 3, 4, 6, and 9 used for the <math display="inline"><semantics> <msub> <mi>n</mi> <mrow> <mi>s</mi> <mi>t</mi> <mi>e</mi> <mi>p</mi> <mi>s</mi> </mrow> </msub> </semantics></math> parameter. Dark green traces correspond to generated MIDI notes from position estimates shown through light blue traces.</p>
Full article ">Figure A2
<p>Figure displaying the calculated velocity obtained from the Vicon system, and the analogue voltage recordings corresponding to the switch state obtained through the Soniccup system, with magnitude reduction in this trace by a third.</p>
Full article ">Figure A3
<p>Figure illustrating the variation in the sample offset between the theoretical start of movement and the change in switch state due to the lifting of the Soniccup for ‘Movement Set 1’ (<b>top</b>) and ‘Movement Set 2’ (<b>bottom</b>). A density plot is shown in both plots as a black trace. The positive offset indicates that the movement began before the switch changed state.</p>
Full article ">Figure A4
<p>Flowchart presenting sources of delay associated with the start of movement that accumulate during the Soniccup methodology. This figure shows <a href="#sensors-24-06279-f003" class="html-fig">Figure 3</a> with added annotations corresponding to sources of delay. The total delay is shown as 23 samples, with one sample’s worth of delay equaling 10 ms.</p>
Full article ">
26 pages, 3882 KiB  
Article
A Network Performance Analysis of MQTT Security Protocols with Constrained Hardware in the Dark Net for DMS
by Antonio Francesco Gentile, Davide Macrì, Domenico Luca Carnì, Emilio Greco and Francesco Lamonaca
Appl. Sci. 2024, 14(18), 8501; https://doi.org/10.3390/app14188501 - 20 Sep 2024
Viewed by 1237
Abstract
In the context of the internet of things, and particularly within distributed measurement systems that are subject to high privacy risks, it is essential to emphasize the need for increasingly effective privacy protections. The idea presented in this work involves managing critical traffic [...] Read more.
In the context of the internet of things, and particularly within distributed measurement systems that are subject to high privacy risks, it is essential to emphasize the need for increasingly effective privacy protections. The idea presented in this work involves managing critical traffic through an architectural proposal aimed at solving the problem of communications between nodes by optimizing both the confidentiality to be guaranteed to the payload and the transmission speed. Specifically, data such as a typical sensor on/off signal could be sent via a standard encrypted channel, while a sensitive aggregate could be transmitted through a dedicated private channel. Additionally, this work emphasizes the critical importance of optimizing message sizes to 5 k-bytes (small payload messages) for transmission over the reserve channel, enhancing both privacy and system responsiveness, a mandatory requirement in distributed measurement systems. By focusing on small, encrypted payloads, the study facilitates secure, timely updates and summaries of network conditions, maintaining the integrity and privacy of communications in even the most challenging and privacy-sensitive environments. This study provides a comprehensive performance analysis of IoT networks using Dark Net technologies and MQTT protocols, with a focus on privacy and anonymity. It highlights the trade-offs between enhanced security and performance, noting increased latency, reduced bandwidth, and network instability when using TOR, particularly with cipher suites like AES256-GCM-SHA384 and DHE-RSA-CHACHA20-POLY1305. The research emphasizes the need for further exploration of alternative protocols like LWM2M in secure IoT environments and calls for optimization to balance privacy with performance in Dark-Net-based IoT deployments. Full article
Show Figures

Figure 1

Figure 1
<p>MQTTs Over TOR Network Encryption Flow Architecture.</p>
Full article ">Figure 2
<p>Overview of the Proposed MQTT over TOR Architecture for IoT.</p>
Full article ">Figure 3
<p>MQTT Benchmarking Architecture.</p>
Full article ">Figure 4
<p>Algorithm flowchart.</p>
Full article ">Figure 5
<p>Physical Deploy for 3GPP-4G, IEEE 802.3ab, and IEEE 802.11n/ac testbeds.</p>
Full article ">Figure 6
<p>Latency Patterns Analysis for MQTT V3.11 over IEEE 802.3ab Connection: Examining TLS v1.2 Encryption Protocols at QoS0 Priority Level. The × represents the median value.</p>
Full article ">Figure 7
<p>The percentage difference in bandwidth between the dark web and the web using TLSv1. With MQTT V3.11 and IEEE 802.3ab Link, two cipher suites and all QoS levels are supported with a fixed payload size of 1 MB.</p>
Full article ">Figure 8
<p>Percentage difference in bandwidth used to transmit a 1 Mb payload versus a 5 Kb payload over an IEEE 802.3ab link on the Dark Web with the TLSv1.2 cipher suite for all levels of QoS and MQTT V3.11.</p>
Full article ">Figure 9
<p>Performance Analysis of Data Throughput: MQTT V3.11 over IEEE 802.3ab Connections with TLSv1.2 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 10
<p>Performance Analysis of Data Throughput: MQTT V5.0 over IEEE 802.3ab Connections with TLSv1.2 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 11
<p>Performance Analysis of Data Throughput: MQTT V3.11 over IEEE 802.11n/ac Connections with TLSv1.2 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 12
<p>Performance Analysis of Data Throughput: MQTT V5.0 over IEEE 802.11n/ac Connections with TLSv1.2 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 13
<p>Performance Analysis of Data Throughput: MQTT V3.11 over 3GPP-4G Connections with TLSv1.2 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 14
<p>Performance Analysis of Data Throughput: MQTT V5.0 over 3GPP-4G Connections with TLSv1.2 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 15
<p>Latency Patterns Analysis for MQTT V3.11 over 3GPP-4G Connection: Examining TLS v1.2 Encryption Protocols at QoS0 Priority Level. × represents the median value.</p>
Full article ">Figure 16
<p>Performance Analysis of Data Throughput: MQTT V3.11 over IEEE 802.3ab Connections with TLSv1.3 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 17
<p>Performance Analysis of Data Throughput: MQTT V5.0 over IEEE 802.3ab Connections with TLSv1.3 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 18
<p>Performance Analysis of Data Throughput: MQTT V3.11 over IEEE 802.11n/ac Connections with TLSv1.3 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 19
<p>Performance Analysis of Data Throughput: MQTT V5.0 over IEEE 802.11n/ac Connections with TLSv1.3 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 20
<p>Performance Analysis of Data Throughput: MQTT V3.11 over 3GPP-4G Connections with TLSv1.3 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 21
<p>Performance Analysis of Data Throughput: MQTT V5.0 over 3GPP-4G Connections with TLSv1.3 Encryption Protocols across Quality of Service Tiers.</p>
Full article ">Figure 22
<p>Statistical Distribution of Delays for TLS v1.2 cipher suites and QoS0 level on IEEE 802.11n/ac Link and MQTT V3.11. × represents the median value.</p>
Full article ">
Back to TopTop