Forward Data Research Articles

High‐speed end‐to‐edge data caching and forwarding architecture based on field programmable gate array

AbstractThe application of the Internet of Things generates massive end‐device data. Traditional end‐to‐edge data caching methods lack parallelism, consume numerous resources, and lack data backup mechanisms. We propose a lightweight high‐speed data caching and forwarding architecture based on a field‐programmable gate array. In the basic scheme, a double‐data‐rate memory read/write mixed control method is proposed to efficiently cache massive amounts of data. To improve reliability, we propose address‐space virtualization to forward data to backup devices. To satisfy the demand for higher performance scenarios, we propose a real‐time data shunting mechanism to realize an optimized scheme that supports higher data rates. These two schemes support single‐link high‐speed data caching and forwarding at 10 and 40 Gbps. Compared with the existing method, the basic and optimized schemes improve the performance by 25% and four times and save 66% and 40% of the resources, respectively. Thus, we provide a lightweight and reliable high‐performance end‐to‐edge data caching solution for resource‐constrained edge devices.

Optimizing Parameters for Enhanced Iterative Image Reconstruction Using Extended Power Divergence

In this paper, we propose a method for optimizing the parameter values in iterative reconstruction algorithms that include adjustable parameters in order to optimize the reconstruction performance. Specifically, we focus on the power divergence-based expectation-maximization algorithm, which includes two power indices as adjustable parameters. Through numerical and physical experiments, we demonstrate that optimizing the evaluation function based on the extended power-divergence and weighted extended power-divergence measures yields high-quality image reconstruction. Notably, the optimal parameter values derived from the proposed method produce reconstruction results comparable to those obtained using the true image, even when using distance functions based on differences between forward projection data and measured projection data, as verified by numerical experiments. These results suggest that the proposed method effectively improves reconstruction quality without the need for machine-learning techniques in parameter selection. Our findings also indicate that this approach is useful for enhancing the performance of iterative reconstruction algorithms, especially in medical imaging, where high-accuracy reconstruction under noisy conditions is required.

Review of 3D electromagnetic modeling and inversion for mineral exploration

Many mineral deposits have low resistivity. This property makes the electromagnetic (EM) method a very useful tool for mineral exploration. In the past few decades, the application of EM exploration technologies has been reviewed by many researchers. However, most reviews focused on EM exploration methods, the development of equipment, or their applications. Three-dimensional forward modeling and inversions are high-accuracy EM interpretation techniques in which great progress has been made in recent years in mineral exploration. We review the development of EM technology for mineral exploration with a focus on 3D EM forward modeling, inversion technology, and its applications. We first briefly introduce the EM methods for mineral exploration. Next, we give a comprehensive review of 3D EM forward modeling, inversion, and data interpretation, with special attention paid to the development of EM theory and applications in mineral exploration. We hope this review can promote the application of 3D EM numerical simulation and inversion in mineral exploration.

Decision Transformer-Based Efficient Data Offloading in LEO-IoT.

Recently, the Internet of Things (IoT) has witnessed rapid development. However, the scarcity of computing resources on the ground has constrained the application scenarios of IoT. Low Earth Orbit (LEO) satellites have drawn people's attention due to their broader coverage and shorter transmission delay. They are capable of offloading more IoT computing tasks to mobile edge computing (MEC) servers with lower latency in order to address the issue of scarce computing resources on the ground. Nevertheless, it is highly challenging to share bandwidth and power resources among multiple IoT devices and LEO satellites. In this paper, we explore the efficient data offloading mechanism in the LEO satellite-based IoT (LEO-IoT), where LEO satellites forward data from the terrestrial to the MEC servers. Specifically, by optimally selecting the forwarding LEO satellite for each IoT task and allocating communication resources, we aim to minimize the data offloading latency and energy consumption. Particularly, we employ the state-of-the-art Decision Transformer (DT) to solve this optimization problem. We initially obtain a pre-trained DT through training on a specific task. Subsequently, the pre-trained DT is fine-tuned by acquiring a small quantity of data under the new task, enabling it to converge rapidly, with less training time and superior performance. Numerical simulation results demonstrate that in contrast to the classical reinforcement learning approach (Proximal Policy Optimization), the convergence speed of DT can be increased by up to three times, and the performance can be improved by up to 30%.

New Trust Based Smart Data Forwarding Mechanism in Vehicular Delay Tolerant Network

Vehicular Delay Tolerant Network (VDTN) is the growing field with a considerable possibility to handle future wireless application’s requirements. Using vehicles for the data communication purpose can be contemplated as a substitute for the wired and wireless systems. This paper proposes a trust-based data forwarding mechanism for Vehicular Delay Tolerant Network (VDTN). Data forwarding in VDTN requires every vehicular or stationary node to participate in data forwarding. But some time malicious nodes show non-cooperative behaviour in data forwarding. Therefore, malicious nodes must be identified specifically to accelerate the data forwarding. A threshold based social skeleton membership process along with new trust-based data forwarding mechanism is proposed in this paper. We reveal that the social skeleton members perform better in data forwarding in terms of data delivery ratio, data delay and data overhead. Simulation results demonstrate that the trust-based data forwarding improves the data delivery ratio with trust-based data forwarding approach. After simulation a comparative analysis of two different scenarios is presented with epidemic routing, prophet routing and spray and wait routing.

2D magnetotelluric imaging method based on visionary self-attention mechanism and data science

2D magnetotelluric (MT) imaging detects underground structures by measuring electromagnetic fields. This study tackles two issues in the field: traditional methods’ limitations due to insufficient forward modeling data, and the challenge of multiple solutions in complex scenarios. We introduce an enhanced 2D MT imaging approach with a novel self-attention mechanism, involving: 1. Generating diverse geophysical models and responses to increase data variety and volume. 2. Creating a Swin–Unet-based 2D MT Imaging network with self-attention for better modeling and relation capture, incorporating a MT sample generator using real data to lessen large-scale supervised training dependence, and refining the loss function for optimal validation. This method also includes eliminating MT background response to boost training efficiency and reduce training time. 3. Applying a transverse electric/transverse magnetic method for comprehensive 2D MT data response. Tests show that our method greatly improves 2D MT imaging’s accuracy and efficiency, with excellent generalization.

Designing a Multi-Level Caching Forward Index for Recommendation System Services

This paper introduces a forward index based on microservices, which effectively addresses the issue of forward read amplification in recommendation systems through a multi-layer caching mechanism. This allows the forward service to handle a large number of concurrent requests with limited resources while ensuring service stability and final value rate. The paper provides a detailed description of the forward index's data structure design, traffic penetration calculation, and overall service architecture design, dividing the system into three parts: SDK, proxy service, and storage, corresponding to data query, data processing, and data storage respectively. In the SDK design, three components are employed: Cache Slot, synchronous queue, and timer, supporting synchronous, asynchronous, and flexible request forms. The proxy service design handles heterogeneous data and online computation, supporting batch and asynchronous designs, and provides a dynamic data protocol to adapt to the characteristic needs of different microservices. The storage layer design considers performance, cost, and maintainability, utilizing a Cache & SSD model to cope with high-concurrency scenarios.

Coal-gangue recognition for top coal caving face based on electromagnetic detection

Identifying the coal-gangue mixing ratio during top coal caving is essential for automating the coal caving process efficiently. In this article, a block impression reconstruction method is proposed to create 3D models of coal-gangue mixtures with varying gangue ratios and morphological distributions, based on real coal-gangue blocks that reflect actual coal-falling conditions. These 3D models are then input into CST software for electromagnetic forward simulation. The relationship between electromagnetic signal propagation characteristics and gangue ratio is analyzed, resulting in the creation of a coal-gangue mixture electromagnetic signal dataset. An Optuna-XGBoost-based model is then designed to identify the coal-gangue mixing ratio and the recognition performance is firstly verified by using the electromagnetic forward simulation data. Finally, to verify the method’s practicality, a microwave detection test bench for top coal caving is set up and some comparative experiments are conducted. The experimental results indicate that the electromagnetic signals of coal and rock with different gangue contents exhibit significant differences, and the proposed coal-gangue identification model has significant advantages in accuracy and overall performance compared to other competing models.

Research on the refinement of atmospheric weighted average temperature model in Xi’an based on machine learning

One of the most important parameters for calculating the atmospheric precipitable water vapor (PWV) is the atmospheric weighted mean temperature (Tm). Meteorological parameters that are measured typically constrain the accuracy and regional applicability of commonly used empirical models. When precipitable water is inverted using the Global Navigation Satellite System (GNSS), it results in erroneous Tm being obtained. Thus, in this paper, a small-scale Tm model for Xi’an is proposed by least squares method based on data provided by the European Centre for Mesoscale Weather Forecasts (ECMWF) from 2019 to 2022, while improving the functional model’s capacity to fit nonlinear residuals through the Random Forest method and enabling it to predict peaks more accurately. It is based on a random forest to confirm the weighted average temperature model’s correctness (RF Tm). When comparing the RF Tm model’s projected Tm accuracy to the GPT3, UNB3, and regional Bevis models, using the 2023 ERA5 data as the experimental data, the improvements are 23.6 %, 18.6 %, and 11.4 %, respectively. With the sounding station data as the reference value, the BIAS of RF Tm is only 1.51 K. In determining the atmospheric weighted average temperatures, the two models’ accuracy was comparable to that of the Long Short-Term Memory neural network model (LSTM). However, the LSTM model requires short-term forward data for practical usage, the RF Tm model compensated for the shortfall. The RF Tm model is used to invert the atmospheric precipitable water vapor at the appropriate monitoring stations using data from GNSS monitoring stations in Xi’an. It was demonstrated that the RF Tm model’s PWV inversion accuracy outperformed the PWV inverted by the GPT3 model by at least 30 %. Moreover, Xi’an rainfall data integration shows that the PWV inverted by the RF Tm model reacts to brief rainfall episodes efficiently. To sum up, this study’s RF Tm model provides a dependable and effective approach to meteorological observation and climate research.

Enhanced synthetic generation of channel state information for millimeter‐wave networks in 5G communication systems

AbstractIn 5G communication systems, millimeter‐wave networks are pivotal, relying heavily on Channel State Information (CSI) for effective user‐to‐base station (BS) transmission. However, the acquisition of genuine CSI data remains a hurdle, often due to the expenses associated with simulations or physical experiments. This paper introduces an innovative method for generating artificial CSI data from real datasets, aiming to closely replicate authentic CSI samples. The procedure begins with an initial clustering analysis, followed using Principal Component Analysis and Uniform Manifold Approximation and Projection to reduce dimensionality. Then, the data distributions are transformed into multivariate normal distributions using Probability Integral Transformations (PIT). For data synthesis, Multilayer Perceptron based regression models are utilized, followed by inverse PIT transformations to return the data to its original space. Our method is compared against KDE‐based algorithms, demonstrating superior fidelity in reproducing real CSI samples. Additionally, we stress the importance of capturing CSI correlations among different BSs to refine data synthesis. This research propels forward data synthesis techniques, offering potential solutions for mitigating interference challenges in dense MMW networks and advancing 5G communication systems.

Towards forward secure verifiable data streaming with support for keyword query

Verifiable data streaming (VDS) allows users to continuously upload their encrypted data items to untrusted cloud servers to reduce the burden of local storage. Meanwhile, it enables users to update outsourced data and initiate queries to verify data integrity. However, most previous works focus on queries for a certain index and are not compatible with general keyword queries. To this end, we propose a VDS protocol that supports keyword queries. Specifically, we first present an efficient dynamic symmetric searchable encryption (DSSE) with range query, which can represent multiple queried keywords within a range as the concise query token, thereby achieving communication-optimized keyword queries while achieving unbounded data appending. Furthermore, we construct a new VDS protocol supporting keyword queries by integrating the proposed range DSSE. Specifically, suppose the user searches for multiple keywords within a certain range. In that case, cloud servers can match the corresponding data items based on the user's query token, and users can verify the integrity of these data items. Security analysis demonstrates that our VDS protocol achieves forward security. Experimental results show that it sacrifices acceptable costs in exchange for keyword retrieval capability.

Multi-level emotion propagation in natural disaster events: diverse leadership of super-spreaders in different levels of hierarchy

PurposeIn social media, crisis information susceptible of generating different emotions could be spread at exponential pace via multilevel super-spreaders. This study aims to interpret the multi-level emotion propagation in natural disaster events by analyzing information diffusion capacity and emotional guiding ability of super-spreaders in different levels of hierarchy.Design/methodology/approachWe collected 47,042 original microblogs and 120,697 forwarding data on Weibo about the “7.20 Henan Rainstorm” event for empirical analysis. Emotion analysis and emotion network analysis were used to screen emotional information and identify super-spreaders. The number of followers is considered as the basis for classifying super-spreaders into five levels.FindingsOfficial media and ordinary users can become the super-spreaders with different advantages, creating a new emotion propagation environment. The number of followers becomes a valid basis for classifying the hierarchy levels of super-spreaders. The higher the level of users, the easier they are to become super-spreaders. And there is a strong correlation between the hierarchy level of super-spreaders and their role in emotion propagation.Originality/valueThis study has important significance for understanding the mode of social emotion propagation and making decisions in maintaining social harmony.Peer reviewThe peer review history for this article is available at: https://publons.com/publon/10.1108/OIR-03-2024-0192.

Optimized Resource Management and Dynamic Routing Protocol for Wireless Sensor Networks Through Load Balancing, Packet Scheduling, and Intelligent Clustering

Heterogeneous Wireless Sensor Networks (HWSNs) are pivotal for providing weather-related event data, enabling universal location access, and facilitating remote monitoring through multi-hop transmission. Efficient energy utilization is critical in ensuring the optimal functioning of HWSNs. Previously, Compressive Sensing (CS) technology was established to enhance communication efficiency within HWSNs. While previous methods were effective in managing energy consumption and reducing transmission delays across network devices, the increased number of devices has impacted their efficacy. Consequently, energy becomes a vital limitation in constructing HWSNs. In order to address these challenges, this study introduces Load Balancing and Packet Scheduling with Intelligent Clustering based Improved Routing Protocol (LPICR). This integrates load balancing, packet scheduling, intelligent clustering, and enhanced routing techniques. The protocol is structured into three main categories: intelligent route selection, load balancing-based Cluster Head (CH) selection, and path scheduling. Initially, an efficient opportunistic routing is conducted by the intelligent route selection process. This routing method minimizes data forwarding during communication and significantly decreases energy consumption in the HWSN. Furthermore, by using a load balancing-oriented procedure for selecting cluster heads, the system achieves efficient determination of cluster heads and construction of clusters, resulting in the most efficient use of energy in communication. Path scheduling reduces the probability of delays by facilitating effective data flow between the source and destination in the HWSN. The NS2 platform is used to implement the proposed LPICR-HWSN protocol. The calculation of the result and comparison analysis is considered for the parameters are Data loss rate, communication time, packet success rate, malicious detection ratio, throughput, Routing overhead and energy efficiency. The results are thoroughly investigated by accounting for factors like the quantity of nodes and the varying speed of the network. To assess the efficacy of this proposed protocol, we conduct a comparative analysis using established methodologies such as CDAS-WSN, EEPC-WSN, TCCS-WSN, and MTODS-HWSN. The results suggest that the proffered LPICR-HWSN model demonstrates superior performance compared to previous methods.

SD-GPSR: A Software-Defined Greedy Perimeter Stateless Routing Method Based on Geographic Location Information

To mitigate the control overhead of Software-Defined Mobile Ad Hoc Networks (SD-MANETs), this paper proposes a novel approach, termed Software-Defined Greedy Perimeter Stateless Routing (SD-GPSR), which integrates geographical location information. SD-GPSR optimizes routing functions by decentralizing them within the data plane of SD-MANET, utilizing the geographic location information of nodes to enhance routing efficiency. The controller is primarily responsible for providing location services and facilitating partial centralized decision-making. Within the data plane, nodes employ an enhanced distance and angle-based greedy forwarding algorithm, denoted as GPSR_DA, to efficiently forward data. Additionally, to address the issue of routing voids in the data plane, we employ the A* algorithm to compute an optimal routing path that circumvents such voids. Finally, we conducted a comparative analysis with several state-of-the-art approaches. The evaluation experiments demonstrate that SD-GPSR significantly reduces the control overhead of the network. Simultaneously, there is a notable improvement in both end-to-end latency and packet loss rate across the network.

A Power-Efficient Envelope-Detector-Less Amplitude-Shift-Keying Forward Telemetry for Wirelessly Powered Biomedical Devices.

This paper proposes an envelope-detector-less (EDL) amplitude-shift-keying (ASK) forward telemetry (FT) demodulator for wireless power/data transfer (WPDT) systems. The EDL ASK FT demodulator can substitute bulky and power-hungry components, which are an envelope detector and an analog comparator in the conventional ASK FT demodulator, with a digital controller, reducing both power dissipation and chip area. The proposed demodulator shares the gate control signals of pass transistors, which are used in an ac-dc regulator for wireless power reception, to maintain a constant load voltage while efficiently demodulating the forward telemetry data. Also, a proposed digital cleaner in the EDL demodulator refines this control signal into a wide pulse without suffering from resonant frequency noise, while a synchronizer can align its frequency with the data rate and resonant frequency. The 0.25-μm CMOS prototype chip of the proposed power-path-less EDL ASK FT demodulator, equipped with the ac-dc regulator, demonstrates a significant 38.2% reduction in power dissipation compared to the conventional ASK FT demodulator. Moreover, the EDL ASK FT demodulator occupies only 0.023-mm2 silicon area and achieves a low bit error rate (BER) less than 10-4 while maintaining a regulated voltage of 4.5 V on the load.

RECAR: Robust and efficient collision-avoiding routing for 3D underwater named data networking

Internet of Underwater Things (IoUT) has important application prospects in fields of both scientific research and commercial business. As a future network architecture, Named Data Networking (NDN) is starting to be applied to IoUT. Although Underwater Named Data Networking (UNDN) has unique advantages in dealing with bandwidth usage, multi-path forwarding, and node mobility, there is still no specific routing protocol for UNDN. The existing underwater routing protocols are either difficult to combine with NDN, or are limited by channel collision and redundant forwarding, especially broadcast suppression routing. In this paper, we propose a routing method named Robust and Efficient Collision-Avoiding Routing (RECAR) for 3D UNDN. RECAR consists of three combined forwarding modes: Directive Mode (DM), Directive Flooding Mode (DFM), and Flooding Mode (FM). In DFM, we propose Segmentation Suppression for Optimal Position (SSOP), an elaborate waiting time algorithm of broadcast suppression which can effectively reduce channel collisions and redundant forwarding. For DM, failure path recovery and unreliable path elimination are proposed to address failure paths. Additionally, several forwarding efficient mechanisms are designed including flexible mode shift, unified data forwarding and scope control. Simulation results show that RECAR has excellent and robust performance, even in the cases of node failure and void hole. Compared with a recent underwater routing method (adaptive location-based routing protocol), RECAR improves the average interest satisfied rate by 19.57% while reducing the request time, collisions, redundant forwarding, total traffic, and energy consumption by 19.5%, 91.7%, 71.4%, 78.4%, and 27.3%, respectively.

The effects of the antenna power pattern uncertainty within a global 21 cm experiment

ABSTRACT Measuring the redshifted sky-averaged neutral hydrogen 21 cm signal with a wide-band antenna operating at metre wavelengths can probe the thermal history of the Universe and the first star and galaxy formation during the Cosmic Dawn. Measurement of this ‘global 21 cm’ signal is extremely challenging due to foreground signals that are orders of magnitude brighter than the cosmological signal, which must be modelled and removed first. The Radio Experiment for the Analysis of Cosmic Hydrogen (REACH) aims to improve this process by simultaneously fitting the full posterior distribution of both the cosmological and foreground signals with Bayesian inference. The method, however, relies on an informed prior; partially derived from a simulated antenna power pattern. This simulated antenna power pattern will differ from the true antenna power pattern of the deployed instrument, and the impact of this uncertainty is unknown. We investigate this problem by forward modelling mock data with different levels of power pattern uncertainty through the REACH pipeline. We construct perturbed antenna power patterns through truncation of a singular-value-decomposed simulated power pattern; using one to generate mock observation data and the others to inform the prior. The power pattern uncertainty is quantified as ΔD, the absolute mean of the difference between the original and perturbed power patterns. Comparing the evidence and root-mean-square error we find that ΔD better than −35 dB, equivalent to millimetre accuracy in the antennas dimensions, is necessary for confident detection of the global signal. We discuss potential solutions to achieve this high level of accuracy.

RANCANG BANGUN REPEATER UNTUK KOMUNIKASI LORA

Not all situations allow for direct observation of the object being observed. This is due to several factors, such as distances that are too far or terrains that are too dangerous to reach, as well as weather and temperature conditions that are not supportive. Therefore, observation or measurement cannot always be done directly and continuously in these difficult-to-reach locations. To overcome these constraints, telemetry is used for long-distance measurement. However, telemetry requires an adequate transmission range. One efficient method for long-distance transmission is using Long Range (LoRa) technology, which has deficient power consumption. LoRa repeaters are required to forward data from the Node to the Gateway to extend the transmission range. In this study, a LoRa repeater was developed for LoRa communication using the LoRa TTGO ESP32 module. The results of this repeater development demonstrate its ability to forward sensor data from the node to the gateway with a range of up to 2.8 km and a data transmission delay of 0.7 seconds.

Ultraviolet collaborative networking method based on a novel neighbor discovery algorithm

Ultraviolet (UV) optical communication presents several advantages, such as non-line-of-sight propagation, high confidentiality, reliability, and the absence of precise alignment requirements. UV optical communication networks find application in various scenarios in complex electromagnetic environments. In this study, we propose a UV collaborative networking method based on a neighbor discovery algorithm (UVCN–NDA), which establishes neighbor tables within nodes and selects the shortest transmission path between the nodes for frame transmission. During data transmission, nodes dynamically adjust the transmission time of each bit to enhance throughput and use the distance information in the neighbor table for path selection. This strategy prevents ineffective data forwarding and subsequently reduces network power consumption. Simulation results demonstrate that the neighbor discovery algorithm implemented in this protocol exhibits higher efficiency in neighbor discovery and lower message load than existing algorithms. Furthermore, when compared to UV networks based on bit–simultaneous–transmission, the UVCN–NDA–based UV networks achieve an approximate 86.2% reduction in average power consumption and approximately 52% increase in throughput, thereby providing a considerable performance advantage. Finally, the conducted network experiments prove the shortest path selection capability of UVCN–NDA.

Pay it Forward and Free your Data! Fear in the Way of Data Sharing in Management Research

Pay it Forward and Free your Data! Fear in the Way of Data Sharing in Management Research