[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

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (642)

Search Parameters:
Keywords = multi-hop

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
18 pages, 926 KiB  
Article
Delay-Sensitive Multi-Sensor Routing Scheduling Method for Underground IoT in Mines
by Yinghui Zhang, Mingli Liu and Aiping Tan
Sensors 2025, 25(2), 369; https://doi.org/10.3390/s25020369 - 10 Jan 2025
Viewed by 397
Abstract
Recently, there has been a growing interest in underground construction safety, during activities such as subway construction, underground mining, and tunnel excavation. While Internet of Things (IoT) sensors help to monitor these conditions, large-scale deployment is limited by high power needs and complex [...] Read more.
Recently, there has been a growing interest in underground construction safety, during activities such as subway construction, underground mining, and tunnel excavation. While Internet of Things (IoT) sensors help to monitor these conditions, large-scale deployment is limited by high power needs and complex tunnel layouts, making real-time response a critical challenge. A delay-sensitive multi-sensor multi-base-station routing scheduling method is proposed for the IoT in underground mining. First, a mixed network topology of wireless and wired networks is formed based on the irregular distribution characteristics of multiple tunnels in the mine construction environment. Based on this topology, a multi-sensor and multi-base-station real-time routing scheduling problem is proposed, proving that the problem is NP-hard. Secondly, the corresponding solving algorithms are designed based on the greedy strategy and the heuristic strategy. Finally, an experimental platform is built, and the performance of the proposed algorithm is compared and analyzed. Full article
(This article belongs to the Section Internet of Things)
Show Figures

Figure 1

Figure 1
<p>The hardware deployment diagram of the IoT under the mine.</p>
Full article ">Figure 2
<p>Hybrid topological structure of mesh and star.</p>
Full article ">Figure 3
<p>A special case of the multi-sensor real-time routing scheduling problem.</p>
Full article ">Figure 4
<p>Comparison of fitness when Station is 10 and Package is 100.</p>
Full article ">Figure 5
<p>Comparison of fitness when Station is 15 and Package is 100.</p>
Full article ">Figure 6
<p>Comparison of fitness when Station is 20 and Package is 100.</p>
Full article ">Figure 7
<p>Comparison of fitness when Station is 15 and Package is 150.</p>
Full article ">Figure 8
<p>Comparison of fitness when Station is 15 and Package is 200.</p>
Full article ">Figure 9
<p>Comparison of fitness when Station is 15 and Package is 250.</p>
Full article ">Figure 10
<p>Comparison of completion rates when Station is 10 and Package is 200.</p>
Full article ">Figure 11
<p>Comparison of completion rates when Station is 10 and Package is 250.</p>
Full article ">
21 pages, 7450 KiB  
Article
Developing a Fire Monitoring System Based on MQTT, ESP-NOW, and a REM in Industrial Environments
by Miracle Udurume, Taewoong Hwang, Raihan Uddin, Toufiq Aziz and Insoo Koo
Appl. Sci. 2025, 15(2), 500; https://doi.org/10.3390/app15020500 - 7 Jan 2025
Viewed by 409
Abstract
Fires and fire hazards in industrial environments pose a significant risk to safety, infrastructure, and the operational community. The need for real-time monitoring systems capable of detecting fires early and transmitting alerts promptly is crucial. This paper presents a fire monitoring system utilizing [...] Read more.
Fires and fire hazards in industrial environments pose a significant risk to safety, infrastructure, and the operational community. The need for real-time monitoring systems capable of detecting fires early and transmitting alerts promptly is crucial. This paper presents a fire monitoring system utilizing lightweight communication protocols, a multi-hop wireless network, and anomaly detection techniques. The system leverages Message Queue Telemetry Transport (MQTT) for efficient message exchange, the ESP-NOW for low-latency and reliable multi-hop wireless communications, and a radio environment map for optimal node placement, eliminating packet loss and ensuring robust data transmission. The proposed system addresses the limitations of traditional fire monitoring systems, providing flexibility, scalability, and robustness in detecting fire. Data collected by ESP32-CAM sensors, which are equipped with pre-trained YOLOv5-based fire detection modules, are processed and transmitted to a central monitoring server. Experimental results demonstrate a 100% success rate in fire detection transmissions, a significant reduction in latency to 150ms, and zero packet loss under REM-guided configuration. These findings validate the system’s suitability for real-time monitoring in high-risk industrial settings. Future work will focus on enhancing the anomaly detection model for greater accuracy, expanding scalability through additional communication protocols, like LoRaWAN, and incorporating adaptive algorithms for real-time network optimization. Full article
Show Figures

Figure 1

Figure 1
<p>Overview of the proposed fire monitoring system.</p>
Full article ">Figure 2
<p>Illustration of the MQTT messaging protocol.</p>
Full article ">Figure 3
<p>Application of fire detection using YOLOv5 on the Raspberry Pi 4 module.</p>
Full article ">Figure 4
<p>Devices used for the REM.</p>
Full article ">Figure 5
<p>2D map of the test environment at the University of Ulsan.</p>
Full article ">Figure 6
<p>The proposed ML-based indoor REM construction framework.</p>
Full article ">Figure 7
<p>Node-RED flow configuration for real-time monitoring.</p>
Full article ">Figure 8
<p>Node placement in the multi-hop network, detailing the source, relay, and gateway nodes’ interactions without a REM.</p>
Full article ">Figure 9
<p>REM-Based Signal Distribution.</p>
Full article ">Figure 10
<p>Node placement in the multi-hop network, detailing the following (<b>a</b>) source node, (<b>b</b>) relay node 1, (<b>c</b>) relay node 2, and (<b>d</b>) gateway nodes’ interactions with REM.</p>
Full article ">Figure 11
<p>The user interface of the Node-RED server showing fire alerts.</p>
Full article ">
25 pages, 1011 KiB  
Article
Relay Node Selection Methods for UAV Navigation Route Constructions in Wireless Multi-Hop Network Using Smart Meter Devices
by Shuto Ohkawa, Kiyoshi Ueda, Takumi Miyoshi, Taku Yamazaki, Ryo Yamamoto and Nobuo Funabiki
Information 2025, 16(1), 22; https://doi.org/10.3390/info16010022 - 5 Jan 2025
Viewed by 510
Abstract
Unmanned aerial vehicles (UAVs) offer solutions to issues like traffic congestion and labor shortages. We developed a distributed UAV management system inspired by virtual circuit and datagram methods in packet-switching networks. By installing houses with wireless terminals, UAVs navigate routes in a multi-hop [...] Read more.
Unmanned aerial vehicles (UAVs) offer solutions to issues like traffic congestion and labor shortages. We developed a distributed UAV management system inspired by virtual circuit and datagram methods in packet-switching networks. By installing houses with wireless terminals, UAVs navigate routes in a multi-hop network, communicating with ground nodes. UAVs are treated as network packets, ground devices are treated as routers, and their connections are treated as links. Activating all nodes as relays increases control message traffic and node load. To optimize connectivity, we minimize relay nodes, connecting non-relay nodes to the nearest relay. This study proposes four relay node selection methods: random selection, two adjacency-based methods, and our innovative approach using Multipoint Relay (MPR) from the Optimized Link State Routing Protocol (OLSR). We evaluated these methods according to their route construction success rates, relay node counts, route lengths, and so on. The MPR-based method proved most effective for UAV route construction. However, fewer relay nodes increase link collisions, and we identify the minimum relay density needed to balance efficiency and conflict reduction. Full article
(This article belongs to the Special Issue Feature Papers in Information in 2024–2025)
Show Figures

Figure 1

Figure 1
<p>UAV navigation route construction by wireless multi-hop network.</p>
Full article ">Figure 2
<p>Network configuration suitable for UAV routing.</p>
Full article ">Figure 3
<p>Method for constructing optimal routes based on OLSR.</p>
Full article ">Figure 4
<p>Models of each node location.</p>
Full article ">Figure 5
<p>Image of simplified network.</p>
Full article ">Figure 6
<p>Method of selecting nodes that connect to more adjacent nodes.</p>
Full article ">Figure 7
<p>Method of selecting nodes that connect to fewer adjacent nodes.</p>
Full article ">Figure 8
<p>Method using MPR.</p>
Full article ">Figure 9
<p>Random node arrangement model.</p>
Full article ">Figure 10
<p>“Cluster split ratio” for “relay function activation cut-off value” in “randomly selecting”.</p>
Full article ">Figure 11
<p>“The number of isolated nodes” for “relay function activation cut-off value” in “randomly selecting”.</p>
Full article ">Figure 12
<p>“Relay node ratio” for “relay function activation cut-off value” in “randomly selecting”.</p>
Full article ">Figure 13
<p>“Cluster split ratio” for “the number of relay nodes” in “more adjacent nodes”.</p>
Full article ">Figure 14
<p>“Relay node ratio” for “the number of relay nodes on” in “more adjacent nodes”.</p>
Full article ">Figure 15
<p>“Cluster split ratio” for “the number of relay nodes” in “fewer adjacent nodes”.</p>
Full article ">Figure 16
<p>“Relay node ratio” for “the number of relay nodes” in “fewer adjacent nodes”.</p>
Full article ">Figure 17
<p>“Relay node ratio” for relay node density in “using MPR”.</p>
Full article ">Figure 18
<p>“Relay node ratio” in each method.</p>
Full article ">Figure 19
<p>“Total distance” in each method.</p>
Full article ">Figure 20
<p>“Population-dense regions distance” in each method.</p>
Full article ">Figure 21
<p>“Route conflicts ratio” for relay node density (between sparsely populated regions nodes).</p>
Full article ">Figure 22
<p>“Route conflicts ratio” for relay node density (between population-dense regions nodes).</p>
Full article ">
34 pages, 1416 KiB  
Article
CRP-RAG: A Retrieval-Augmented Generation Framework for Supporting Complex Logical Reasoning and Knowledge Planning
by Kehan Xu, Kun Zhang, Jingyuan Li, Wei Huang and Yuanzhuo Wang
Electronics 2025, 14(1), 47; https://doi.org/10.3390/electronics14010047 - 26 Dec 2024
Viewed by 755
Abstract
The Retrieval-Augmented Generation (RAG) framework enhances Large Language Models (LLMs) by retrieving relevant knowledge to broaden their knowledge boundaries and mitigate factual hallucinations stemming from knowledge gaps. However, the RAG Framework faces challenges in effective knowledge retrieval and utilization; invalid or misused knowledge [...] Read more.
The Retrieval-Augmented Generation (RAG) framework enhances Large Language Models (LLMs) by retrieving relevant knowledge to broaden their knowledge boundaries and mitigate factual hallucinations stemming from knowledge gaps. However, the RAG Framework faces challenges in effective knowledge retrieval and utilization; invalid or misused knowledge will interfere with LLM generation, reducing reasoning efficiency and answer quality. Existing RAG methods address these issues by decomposing and expanding queries, introducing special knowledge structures, and using reasoning process evaluation and feedback. However, the linear reasoning structures limit complex thought transformations and reasoning based on intricate queries. Additionally, knowledge retrieval and utilization are decoupled from reasoning and answer generation, hindering effective knowledge support during answer generation. To address these limitations, we propose the CRP-RAG framework, which employs reasoning graphs to model complex query reasoning processes more comprehensively and accurately. CRP-RAG guides knowledge retrieval, aggregation, and evaluation through reasoning graphs, dynamically adjusting the reasoning path based on evaluation results and selecting knowledge-sufficiency paths for answer generation. CRP-RAG outperforms the best LLM and RAG baselines by 2.46 in open-domain QA, 7.43 in multi-hop reasoning, and 4.2 in factual verification. Experiments also show the superior factual consistency and robustness of CRP-RAG over existing RAG methods. Extensive analyses confirm its accurate and fact-faithful reasoning and answer generation for complex queries. Full article
(This article belongs to the Section Computer Science & Engineering)
Show Figures

Figure 1

Figure 1
<p>Two challenges faced by the RAG Framework: (i) <b>Left</b>: The inference process is disturbed by irrelevant knowledge in the retrieved results. (ii) <b>Right</b>: The complex associations among the knowledge in the retrieved results cannot be analyzed and understood.</p>
Full article ">Figure 2
<p>Overview of CRP-RAG framework. The CRP-RAG consists of three modules: (i) The GC module constructs the reasoning graph based on the query. (ii) The KRA module performs knowledge retrieval and aggregation based on the nodes of the reasoning graph. (iii) The AG module generates a query-based answer leveraging the reasoning graph and the relevant knowledge.</p>
Full article ">Figure 3
<p>Robustness analysis of CRP-RAG. <span style="color: #87CEFA">The blue line</span> represents the experimental results of introducing false reasoning graph nodes into CRP-RAG, while <span style="color: #FF0000">the red line</span> indicates the experimental results of introducing knowledge-irrelevant reasoning graph nodes into CRP-RAG.</p>
Full article ">Figure 4
<p>CRP-RAG discards distracted reasoning paths and abstains from answering when no valid reasoning path is available.</p>
Full article ">Figure 5
<p>Impact of different reasoning structures on CRP-RAG behavior.</p>
Full article ">Figure 6
<p>Average time consumption of CRP-RAG under different levels of reasoning complexity.</p>
Full article ">
14 pages, 480 KiB  
Article
Routing Enhancement in MANET Using Particle Swarm Algorithm
by Ohood Almutairi, Enas Khairullah, Abeer Almakky and Reem Alotaibi
Automation 2024, 5(4), 630-643; https://doi.org/10.3390/automation5040036 - 22 Dec 2024
Viewed by 304
Abstract
A Mobile ad hoc Network (MANET) is a collection of wireless mobile nodes that temporarily establish a network without centralized administration or fixed infrastructure. Designing the routing of adequate routing protocols is a major challenge given the constraints of battery, bandwidth, multi-hop, mobility, [...] Read more.
A Mobile ad hoc Network (MANET) is a collection of wireless mobile nodes that temporarily establish a network without centralized administration or fixed infrastructure. Designing the routing of adequate routing protocols is a major challenge given the constraints of battery, bandwidth, multi-hop, mobility, and enormous network sizes. Recently, Swarm Intelligence (SI) methods have been employed in MANET routing due to similarities between swarm behavior and routing. These methods are applied to obtain ideal solutions that ensure flexibility. This paper implements an enhanced Particle Swarm Optimization (EPSO) algorithm that improves MANET performance by enhancing the routing protocol. The proposed algorithm selects the stable path by considering multiple metrics such as short distance, delay of the path, and energy consumption. The simulation results illustrate that the EPSO outperforms other existing approaches regarding throughput, PDR, and number of valid paths. Full article
Show Figures

Figure 1

Figure 1
<p>Demo network.</p>
Full article ">Figure 2
<p>Network after the third particle is updated.</p>
Full article ">Figure 3
<p>Packet delivery ratio for proposed PSO, Fixed-PSO, and AODV.</p>
Full article ">Figure 4
<p>Throughput of proposed PSO, Fixed-PSO, and AODV.</p>
Full article ">Figure 5
<p>E2E delay of proposed PSO, Fixed-PSO, and AODV.</p>
Full article ">Figure 6
<p>Number of valid paths for proposed PSO, Fixed-PSO, and AODV.</p>
Full article ">Figure 7
<p>Execution time of proposed PSO and Fixed-PSO.</p>
Full article ">Figure 8
<p>Average different fitness functions comparison.</p>
Full article ">Figure 9
<p>Average different particles number comparison.</p>
Full article ">
18 pages, 1071 KiB  
Article
PMHR: Path-Based Multi-Hop Reasoning Incorporating Rule-Enhanced Reinforcement Learning and KG Embeddings
by Ang Ma, Yanhua Yu, Chuan Shi, Shuai Zhen, Liang Pang and Tat-Seng Chua
Electronics 2024, 13(23), 4847; https://doi.org/10.3390/electronics13234847 - 9 Dec 2024
Viewed by 609
Abstract
Multi-hop reasoning provides a means for inferring indirect relationships and missing information from knowledge graphs (KGs). Reinforcement learning (RL) was recently employed for multi-hop reasoning. Although RL-based methods provide explainability, they face challenges such as sparse rewards, spurious paths, large action spaces, and [...] Read more.
Multi-hop reasoning provides a means for inferring indirect relationships and missing information from knowledge graphs (KGs). Reinforcement learning (RL) was recently employed for multi-hop reasoning. Although RL-based methods provide explainability, they face challenges such as sparse rewards, spurious paths, large action spaces, and long training and running times. In this study, we present a novel approach that combines KG embeddings and RL strategies for multi-hop reasoning called path-based multi-hop reasoning (PMHR). We address the issues of sparse rewards and spurious paths by incorporating a well-designed reward function that combines soft rewards with rule-based rewards. The rewards are adjusted based on the target entity and the path to it. Furthermore, we perform action filtering and utilize the vectors of entities and relations acquired through KG embeddings to initialize the environment, thereby significantly reducing the runtime. Experiments involving a comprehensive performance evaluation, efficiency analysis, ablation studies, and a case study were performed. The experimental results on benchmark datasets demonstrate the effectiveness of PMHR in improving KG reasoning accuracy while preserving interpretability. Compared to existing state-of-the-art models, PMHR achieved Hit@1 improvements of 0.63%, 2.02%, and 3.17% on the UMLS, Kinship, and NELL-995 datasets, respectively. PMHR provides not only improved reasoning accuracy and explainability but also optimized computational efficiency, thereby offering a robust solution for multi-hop reasoning. Full article
(This article belongs to the Special Issue Future Technologies for Data Management, Processing and Application)
Show Figures

Figure 1

Figure 1
<p>An example of a KG. Solid edges are observed and the dashed edge is a query.</p>
Full article ">Figure 2
<p>An overview of PMHR model.</p>
Full article ">Figure 3
<p>The distribution of the shortest path lengths.</p>
Full article ">Figure 4
<p>The efficiency comparison between PMHR and path-based models.</p>
Full article ">Figure 5
<p>Ablation study on key parts of PMHR.</p>
Full article ">
30 pages, 11462 KiB  
Article
Revealing Occult Malignancies in Mammograms Through GAN-Driven Breast Density Transformation
by Dionysios Anyfantis, Athanasios Koutras, George Apostolopoulos and Ioanna Christoyianni
Electronics 2024, 13(23), 4826; https://doi.org/10.3390/electronics13234826 - 6 Dec 2024
Viewed by 531
Abstract
Breast cancer remains one of the primary causes of cancer-related deaths among women globally. Early detection via mammography is essential for improving prognosis and survival rates. However, mammogram diagnostic accuracy is severely hindered by dense breast tissue, which can obstruct potential malignancies, complicating [...] Read more.
Breast cancer remains one of the primary causes of cancer-related deaths among women globally. Early detection via mammography is essential for improving prognosis and survival rates. However, mammogram diagnostic accuracy is severely hindered by dense breast tissue, which can obstruct potential malignancies, complicating early detection. To tackle this pressing issue, this study introduces an innovative approach that leverages Generative Adversarial Networks (GANs), specifically CycleGAN and GANHopper, to transform breast density in mammograms. The aim is to diminish the masking effect of dense tissue, thus enhancing the visibility of underlying malignancies. The method uses unsupervised image-to-image translation to gradually alter breast density (from high (ACR-D) to low (ACR-A)) in mammographic images, detecting obscured lesions while preserving original diagnostic features. We applied this approach to multiple mammographic datasets, demonstrating its effectiveness in diverse contexts. Experimental results exhibit substantial improvements in detecting potential malignancies concealed by dense breast tissue. The method significantly improved precision, recall, and F1-score metrics across all datasets, revealing previously obscured malignancies and image quality assessments confirmed the diagnostic relevance of transformed images. The study introduces a novel mammogram analysis method using advanced machine-learning techniques, enhancing diagnostic accuracy in dense breasts and potentially improving early breast cancer detection and patient outcomes. Full article
Show Figures

Figure 1

Figure 1
<p>Network architecture overview. Image patch transformation of ACR-A to ACR-D and vice versa.</p>
Full article ">Figure 2
<p>A typical CycleGAN Framework for image translation. Here, ACR-X and ACR-Y are real original patches (denoted with green line border) from the ACR-A and ACR-C domains, respectively, ACR-X<sub>GEN</sub> are artificial patches produced by Generator G1, while ACR-X<sub>GEN-CON</sub> are double-passed patches from the two Generators G1, G2 consecutively.</p>
Full article ">Figure 3
<p>Generator/Discriminator and Total Loss during gGANHopper model training. Insertion of the updated middle node CycleGAN model and continuation of training.</p>
Full article ">Figure 4
<p>ACR-C to ACR-B translation via middle node. The dotted areas display patches generated via middle mode CycleGAN when fed with appropriate patches from ACR-B or ACR-C. These patches are propagated to the next hops towards the ACR-A or ACR-D domains.</p>
Full article ">Figure 5
<p>ACR-D to ACR-A translation. Histogram Visualization of input/output images on input/output.</p>
Full article ">Figure 6
<p>Total Statistics for all mammographic datasets used.</p>
Full article ">Figure 7
<p>System Block Overview.</p>
Full article ">Figure 8
<p>UNet 3+ architecture used for Breast Tissue Segmentation. (SP: denotes supervision by ground truth. Colored arrows represent two types of skip connections: downward arrows for full-scale intra connections and upward arrows for full-scale inter-connections. Black arrows indicate standard downsampling paths. The central dotted line separates encoder-decoder sections while highlighting the symmetrical UNet topology).</p>
Full article ">Figure 9
<p>Fréchet Score variation during training and model checkpoints.</p>
Full article ">Figure 10
<p>Fréchet Score variation during training and model checkpoints. The red circle marks the best FID found at epoch 6 (each epoch is limited in the area between the red arrow areas) and model checkpoint 54 during training.</p>
Full article ">Figure 11
<p>Precision, Recall, F1-score for MIAS dataset, before and after GAN-based model Breast Density transformations.</p>
Full article ">Figure 12
<p>Precision, Recall, F1-score for CBIS-DDSM dataset, before and after GAN-based model Breast Density transformations.</p>
Full article ">Figure 13
<p>Precision, Recall, F1-score for VinDR dataset, before and after GAN-based model Breast Density transformations.</p>
Full article ">Figure 14
<p>Precision, Recall, F1-score for CDD-CESM dataset, before and after GAN-based model Breast Density transformations.</p>
Full article ">Figure 15
<p>Precision, Recall, F1-score for INbreast dataset, before and after GAN-based model Breast Density transformations.</p>
Full article ">Figure 16
<p>Precision, Recall, F1-score for SuReMaPP dataset, before and after GAN-based model Breast Density transformations.</p>
Full article ">Figure 17
<p>Impact of breast density transformations on classification performance. Top: CNN false report distribution by ACR class (<b>left</b>) and improvement after gGANHopper transformations (<b>right</b>). Bottom: Distribution of remaining misclassified cases by ACR type and malignancy class (<b>left</b>) and relative proportions across ACR categories (<b>right</b>).</p>
Full article ">Figure 18
<p>Visualization of system response before and after ROI-based breast density transformations. The CNN response is depicted for nine annotated ROIs. ACR transformations are performed for the faulty CNN verdict, marking the final CNN decision.</p>
Full article ">Figure 19
<p>Annotated ROI with ACR-D characteristics, histogram, and heatmap for the ROI before and after ACR transformations.</p>
Full article ">Figure 20
<p>Visualization via heat maps of the application of ACR Transformations in all ROI patches rather than only to the faults of the classifier.</p>
Full article ">
23 pages, 2184 KiB  
Article
Research on High-Dynamic Tracking Algorithms for FH-BOC Signals
by Xue Li, Shun Zhao, Xinyue Hou, Lulu Wang and Yinsen Zhang
Aerospace 2024, 11(12), 987; https://doi.org/10.3390/aerospace11120987 - 28 Nov 2024
Viewed by 434
Abstract
The rapid development of Low Earth Orbit (LEO) satellite navigation systems requires modulation schemes with strong anti-jamming capabilities, high spectral efficiency, and the ability to achieve precise tracking in high-dynamic environments. Traditional Binary Offset Carrier (BOC) modulation suffers from multi-peak ambiguity, leading to [...] Read more.
The rapid development of Low Earth Orbit (LEO) satellite navigation systems requires modulation schemes with strong anti-jamming capabilities, high spectral efficiency, and the ability to achieve precise tracking in high-dynamic environments. Traditional Binary Offset Carrier (BOC) modulation suffers from multi-peak ambiguity, leading to false lock issues. To address this, FH-BOC modulation, which integrates BOC modulationand frequency hopping, significantly improves both anti-jamming performance and spectral efficiency. Against this background, this paper proposes a comprehensive high-dynamic tracking algorithm for FH-BOC signals. (1) Based on the adaptive Kalman filter algorithm, high-precision carrier tracking was achieved in high-dynamic environments. (2) By leveraging the correlation between the ranging code and frequency-hopping offset carrier, a composite pseudo-code is generated through the XOR operation, and a corresponding composite code-tracking loop is introduced. (3) Based on code loop tracking results, the frequency-hopping moments of the subcarrier are detected, and a phase-locked loop for the frequency-hopping subcarrier is established. Simulation results indicate that the algorithm achieves centimeter-level pseudorange measurement accuracy for FH-BOC navigation signals under the JPL high-dynamic model. Full article
(This article belongs to the Section Astronautics & Space Science)
Show Figures

Figure 1

Figure 1
<p>FH-BOC transmitted signal generation process.</p>
Full article ">Figure 2
<p>The simulation results of the autocorrelation function and power spectral density of the FH-BOC signal.</p>
Full article ">Figure 3
<p>JPL high-dynamic signal model.</p>
Full article ">Figure 4
<p>Linear Kalman carrier tracking model.</p>
Full article ">Figure 5
<p>Flow chart of the linear Kalman carrier tracking algorithm.</p>
Full article ">Figure 6
<p>Linear Kalman tracking simulation results: (<b>a1</b>,<b>a2</b>) carrier tracking error under different CNRs; (<b>b1</b>,<b>b2</b>) carrier Doppler tracking error under different CNRs.</p>
Full article ">Figure 7
<p>Flow chart of the adaptive Kalman carrier tracking algorithm.</p>
Full article ">Figure 8
<p>Adaptive Kalman tracking simulation results: (<b>a1,a2</b>) carrier tracking error under different CNRs; (<b>b1,b2</b>) carrier Doppler tracking error under different CNRs.</p>
Full article ">Figure 8 Cont.
<p>Adaptive Kalman tracking simulation results: (<b>a1,a2</b>) carrier tracking error under different CNRs; (<b>b1,b2</b>) carrier Doppler tracking error under different CNRs.</p>
Full article ">Figure 9
<p>Simulation results of carrier tracking algorithms under different CNRs: (<b>a</b>) Carrier phase tracking and standard error; (<b>b</b>) Carrier Doppler tracking and standard error.</p>
Full article ">Figure 10
<p>FH-BOC modulation composite code-tracking loop.</p>
Full article ">Figure 11
<p>The second-order DLL loop filter.</p>
Full article ">Figure 12
<p>Composite code-tracking loop pseudorange measurement error under different CNRs: (<b>a</b>) CNR = 45 dB·Hz; (<b>b</b>) CNR = 50 dB·Hz; (<b>c</b>) CNR = 55 dB·Hz; (<b>d</b>) CNR = 60 dB·Hz.</p>
Full article ">Figure 13
<p>Frequency-hopping subcarrier phase-locked loop.</p>
Full article ">Figure 14
<p>Simulation results of the frequency-hopping subcarrier tracking loop: (<b>a</b>) pseudorange measurement error with CNR = 50 dB·Hz; (<b>b</b>) pseudorange measurement error with CNR = 60 dB·Hz; (<b>c</b>) FH subcarrier phase tracking error with CNR = 50 dB·Hz r. (<b>d</b>) FH-subcarrier phase tracking error with CNR = 60 dB·Hz.</p>
Full article ">Figure 14 Cont.
<p>Simulation results of the frequency-hopping subcarrier tracking loop: (<b>a</b>) pseudorange measurement error with CNR = 50 dB·Hz; (<b>b</b>) pseudorange measurement error with CNR = 60 dB·Hz; (<b>c</b>) FH subcarrier phase tracking error with CNR = 50 dB·Hz r. (<b>d</b>) FH-subcarrier phase tracking error with CNR = 60 dB·Hz.</p>
Full article ">Figure 15
<p>The standard deviation of pseudorange measurements under different CNRs.</p>
Full article ">
18 pages, 957 KiB  
Article
Layered Query Retrieval: An Adaptive Framework for Retrieval-Augmented Generation in Complex Question Answering for Large Language Models
by Jie Huang, Mo Wang, Yunpeng Cui, Juan Liu, Li Chen, Ting Wang, Huan Li and Jinming Wu
Appl. Sci. 2024, 14(23), 11014; https://doi.org/10.3390/app142311014 - 27 Nov 2024
Viewed by 1036
Abstract
Retrieval-augmented generation (RAG) addresses the problem of knowledge cutoff and overcomes the inherent limitations of pre-trained language models by retrieving relevant information in real time. However, challenges related to efficiency and accuracy persist in current RAG strategies. A key issue is how to [...] Read more.
Retrieval-augmented generation (RAG) addresses the problem of knowledge cutoff and overcomes the inherent limitations of pre-trained language models by retrieving relevant information in real time. However, challenges related to efficiency and accuracy persist in current RAG strategies. A key issue is how to select appropriate methods for user queries of varying complexity dynamically. This study introduces a novel adaptive retrieval-augmented generation framework termed Layered Query Retrieval (LQR). The LQR framework focuses on query complexity classification, retrieval strategies, and relevance analysis, utilizing a custom-built training dataset to train smaller models that aid the large language model (LLM) in efficiently retrieving relevant information. A central technique in LQR is a semantic rule-based approach to distinguish between different levels of multi-hop queries. The process begins by parsing the user’s query for keywords, followed by a keyword-based document retrieval. Subsequently, we employ a natural language inference (NLI) model to assess whether the retrieved document is relevant to the query. We validated our approach on multiple single-hop and multi-hop datasets, demonstrating significant improvements in both accuracy and efficiency compared to existing single-step, multi-step, and adaptive methods. Our method exhibits high accuracy and efficiency, particularly on the HotpotQA dataset, where it outperforms the Adaptive-RAG method by improving accuracy by 9.4% and the F1 score by 16.14%. The proposed approach carefully balances retrieval efficiency with the accuracy of the LLM’s responses. Full article
Show Figures

Figure 1

Figure 1
<p>Workflow of the proposed LQR framework.</p>
Full article ">Figure 2
<p>The complex query process structure. Arrows with solid lines denote the processing step; arrows with dotted lines denote data flow.</p>
Full article ">
24 pages, 1660 KiB  
Article
Performance Study of FSO/THz Dual-Hop System Based on Cognitive Radio and Energy Harvesting System
by Jingwei Lu, Rongpeng Liu, Yawei Wang, Ziyang Wang and Hongzhan Liu
Electronics 2024, 13(23), 4656; https://doi.org/10.3390/electronics13234656 - 26 Nov 2024
Viewed by 499
Abstract
In order to address the problems of low spectrum efficiency in current communication systems and extend the lifetime of energy-constrained relay devices, this paper proposes a novel dual-hop free-space optical (FSO) system that integrates cognitive radio (CR) and energy harvesting (EH). In this [...] Read more.
In order to address the problems of low spectrum efficiency in current communication systems and extend the lifetime of energy-constrained relay devices, this paper proposes a novel dual-hop free-space optical (FSO) system that integrates cognitive radio (CR) and energy harvesting (EH). In this system, the source node communicates with two users at the terminal via FSO and terahertz (THz) hard-switching links, as well as a multi-antenna relay for non-orthogonal multiple access (NOMA). There is another link whose relay acts as both the power beacon (PB) in the EH system and the primary network (PN) in the CR system, achieving the double function of auxiliary transmission. In addition, based on the three possible practical working scenarios of the system, three different transmit powers of the relay are distinguished, thus enabling three different working modes of the system. Closed-form expressions are derived for the interruption outage probability per user for these three operating scenarios, considering the Gamma–Gamma distribution for the FSO link, the αμ distribution for the THz link, and the Rayleigh fading distribution for the radio frequency (RF) link. Finally, the numerical results show that this novel system can be adapted to various real-world scenarios and possesses unique advantages. Full article
(This article belongs to the Section Microwave and Wireless Communications)
Show Figures

Figure 1

Figure 1
<p>Hard-switched FSO/THz-RF dual-hop NOMA link with CR and EH.</p>
Full article ">Figure 2
<p>The comparison between different beamwidth and jitter standard deviations versus OPs.</p>
Full article ">Figure 3
<p>The comparison between <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </semantics></math> link transmission distances and THz frequency cases versus OP. The first row represent <math display="inline"><semantics> <msub> <mi>U</mi> <mn>1</mn> </msub> </semantics></math>, and the second row represent <math display="inline"><semantics> <msub> <mi>U</mi> <mn>2</mn> </msub> </semantics></math>, respectively.</p>
Full article ">Figure 4
<p>SNR versus OP under the comparison between different visibility.</p>
Full article ">Figure 5
<p>SNR versus OP for different turbulence conditions and pointing errors when <math display="inline"><semantics> <mrow> <mi>L</mi> <mi>F</mi> </mrow> </semantics></math> = <math display="inline"><semantics> <mrow> <mi>D</mi> <mi>T</mi> </mrow> </semantics></math> = 350 m among three working scenarios.</p>
Full article ">Figure 6
<p>OP versus <span class="html-italic">N</span> among three working scenarios.</p>
Full article ">Figure 7
<p>OP versus <math display="inline"><semantics> <mrow> <msub> <mi>g</mi> <mi>u</mi> </msub> <mn>1</mn> </mrow> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mi>ξ</mi> </semantics></math> = 1, <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>B</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> </mrow> </semantics></math> = 2 dB, <math display="inline"><semantics> <mrow> <mi>η</mi> <mo>/</mo> <msub> <mi>P</mi> <mi>B</mi> </msub> </mrow> </semantics></math> =-1.9 dB, <math display="inline"><semantics> <msub> <mi>g</mi> <mrow> <mi>R</mi> <mi>n</mi> <msub> <mi>U</mi> <mn>1</mn> </msub> </mrow> </msub> </semantics></math> = 3 dB, <math display="inline"><semantics> <msub> <mi>g</mi> <mrow> <mi>R</mi> <mi>n</mi> <msub> <mi>U</mi> <mn>2</mn> </msub> </mrow> </msub> </semantics></math> = 5 dB, <math display="inline"><semantics> <msub> <mi>α</mi> <mn>1</mn> </msub> </semantics></math> = 0.77, and <math display="inline"><semantics> <msub> <mi>γ</mi> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </msub> </semantics></math> = 15 dB.</p>
Full article ">Figure 8
<p>OP versus <math display="inline"><semantics> <msub> <mi>α</mi> <mn>1</mn> </msub> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>ξ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>B</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> </mrow> </semantics></math> = 2 dB, <math display="inline"><semantics> <mrow> <mi>η</mi> <mo>/</mo> <msub> <mi>P</mi> <mi>B</mi> </msub> </mrow> </semantics></math> = -1.9 dB, <math display="inline"><semantics> <msub> <mi>g</mi> <mrow> <mi>R</mi> <mi>n</mi> <msub> <mi>U</mi> <mn>1</mn> </msub> </mrow> </msub> </semantics></math> = 3 dB, <math display="inline"><semantics> <msub> <mi>g</mi> <mrow> <mi>R</mi> <mi>n</mi> <msub> <mi>U</mi> <mn>2</mn> </msub> </mrow> </msub> </semantics></math> = 5 dB, <math display="inline"><semantics> <mi>α</mi> </semantics></math> = 2.902, <math display="inline"><semantics> <mi>β</mi> </semantics></math> = 2.510, and <math display="inline"><semantics> <msub> <mi>γ</mi> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </msub> </semantics></math> = 8 dB.</p>
Full article ">Figure 9
<p>OP versus <math display="inline"><semantics> <mrow> <mi>η</mi> <mo>/</mo> <msub> <mi>P</mi> <mi>B</mi> </msub> </mrow> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>ξ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>P</mi> <mi>B</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mn>0</mn> </msub> </mrow> </semantics></math> = 2 dB, <math display="inline"><semantics> <msub> <mi>g</mi> <mrow> <mi>R</mi> <mi>n</mi> <msub> <mi>U</mi> <mn>1</mn> </msub> </mrow> </msub> </semantics></math> = 3 dB, <math display="inline"><semantics> <msub> <mi>g</mi> <mrow> <mi>R</mi> <mi>n</mi> <msub> <mi>U</mi> <mn>2</mn> </msub> </mrow> </msub> </semantics></math> = 5 dB, <math display="inline"><semantics> <mi>α</mi> </semantics></math>= 2.902, <math display="inline"><semantics> <mi>β</mi> </semantics></math> = 2.510, <math display="inline"><semantics> <msub> <mi>α</mi> <mn>1</mn> </msub> </semantics></math> = 0.77, and <math display="inline"><semantics> <msub> <mi>γ</mi> <mrow> <mi>S</mi> <mi>R</mi> </mrow> </msub> </semantics></math> = 15 dB.</p>
Full article ">Figure 10
<p>A comparison of the power of the SN network and OP at different <span class="html-italic">I</span>.</p>
Full article ">
20 pages, 10700 KiB  
Article
A 2.4 GHz IEEE 802.15.4 Multi-Hop Network for Mountainous Forest and Watercourse Environments: Sensor Node Deployment and Performance Evaluation
by Apidet Booranawong, Puwasit Hirunkitrangsri, Dujdow Buranapanichkit, Charernkiat Pochaiya, Nattha Jindapetch and Hiroshi Saito
Signals 2024, 5(4), 774-793; https://doi.org/10.3390/signals5040043 - 20 Nov 2024
Viewed by 704
Abstract
In this paper, we demonstrate the realistic test of a 2.4 GHz multi-hop wireless network for mountainous forest and watercourse environments. A multi-hop network using IEEE 802.15.4 XBee3 micro-modules and a communication protocol among nodes were developed. A wireless node deployment solution was [...] Read more.
In this paper, we demonstrate the realistic test of a 2.4 GHz multi-hop wireless network for mountainous forest and watercourse environments. A multi-hop network using IEEE 802.15.4 XBee3 micro-modules and a communication protocol among nodes were developed. A wireless node deployment solution was introduced for practical testing. The proposed system’s communication reliability was tested in two different scenarios: a mountainous forest with sloping areas and trees and a watercourse, which referred to environmental and flooding monitoring applications. Wireless network performances were evaluated through the received signal strength indicator (RSSI) level of each wireless link, a packet delivery ratio (PDR), as the successful rate of packet transmission, and the end-to-end delay (ETED) of all data packets from the transmitter to the receiver. The experimental results demonstrate the success of the multi-hop WSN deployment and communication in both scenarios, where the RSSI of each link was kept at the accepted level and the PDR achieved the highest result. Furthermore, as a real-time response, the data from the source could be sent to the sink with a small ETED. Full article
Show Figures

Figure 1

Figure 1
<p>A multi-hop WSN with the communication protocol among the nodes.</p>
Full article ">Figure 2
<p>Example of the proposed sensor node deployment process (before the data collection phase.</p>
Full article ">Figure 2 Cont.
<p>Example of the proposed sensor node deployment process (before the data collection phase.</p>
Full article ">Figure 2 Cont.
<p>Example of the proposed sensor node deployment process (before the data collection phase.</p>
Full article ">Figure 3
<p>Test scenarios #1 and #2.</p>
Full article ">Figure 4
<p>The test field layouts.</p>
Full article ">Figure 5
<p>Illustration of sensor node deployment and environments.</p>
Full article ">Figure 6
<p>An example of water flooding during the rainy season for field #2.</p>
Full article ">Figure 7
<p>Examples of raw RSSI signals collected from test scenario #1 (test times 5 and 15). The signals could be displayed in real time during the test in the GUI window. Note that the y-axis is the RSSI level in dBm, and RSSI B, C, and D refer to hops 3, 2, and 1.</p>
Full article ">Figure 8
<p>Average RSSIs of hops 1 to 3 for test scenarios #1 and #2.</p>
Full article ">Figure 9
<p>PDR results.</p>
Full article ">Figure 10
<p>ETED results.</p>
Full article ">Figure 10 Cont.
<p>ETED results.</p>
Full article ">Figure 11
<p>The XBee3 micro-module with the GY-521 accelerometer/gyro sensor and 5 V battery.</p>
Full article ">Figure 12
<p>Examples of three-axis acceleration and gyro signals.</p>
Full article ">Figure 12 Cont.
<p>Examples of three-axis acceleration and gyro signals.</p>
Full article ">Figure 12 Cont.
<p>Examples of three-axis acceleration and gyro signals.</p>
Full article ">
33 pages, 1638 KiB  
Article
Enhancing Communication Security in Drones Using QRNG in Frequency Hopping Spread Spectrum
by J. de Curtò, I. de Zarzà, Juan-Carlos Cano and Carlos T. Calafate
Future Internet 2024, 16(11), 412; https://doi.org/10.3390/fi16110412 - 8 Nov 2024
Viewed by 1681
Abstract
This paper presents a novel approach to enhancing the security and reliability of drone communications through the integration of Quantum Random Number Generators (QRNG) in Frequency Hopping Spread Spectrum (FHSS) systems. We propose a multi-drone framework that leverages QRNG technology to generate truly [...] Read more.
This paper presents a novel approach to enhancing the security and reliability of drone communications through the integration of Quantum Random Number Generators (QRNG) in Frequency Hopping Spread Spectrum (FHSS) systems. We propose a multi-drone framework that leverages QRNG technology to generate truly random frequency hopping sequences, significantly improving resistance against jamming and interception attempts. Our method introduces a concurrent access protocol for multiple drones to share a QRNG device efficiently, incorporating robust error handling and a shared memory system for random number distribution. The implementation includes secure communication protocols, ensuring data integrity and confidentiality through encryption and Hash-based Message Authentication Code (HMAC) verification. We demonstrate the system’s effectiveness through comprehensive simulations and statistical analyses, including spectral density, frequency distribution, and autocorrelation studies of the generated frequency sequences. The results show a significant enhancement in the unpredictability and uniformity of frequency distributions compared to traditional pseudo-random number generator-based approaches. Specifically, the frequency distributions of the drones exhibited a relatively uniform spread across the available spectrum, with minimal discernible patterns in the frequency sequences, indicating high unpredictability. Autocorrelation analyses revealed a sharp peak at zero lag and linear decrease to zero values for other lags, confirming a general absence of periodicity or predictability in the sequences, which enhances resistance to predictive attacks. Spectral analysis confirmed a relatively flat power spectral density across frequencies, characteristic of truly random sequences, thereby minimizing vulnerabilities to spectral-based jamming. Statistical tests, including Chi-squared and Kolmogorov-Smirnov, further confirm the unpredictability of the frequency sequences generated by QRNG, supporting enhanced security measures against predictive attacks. While some short-term correlations were observed, suggesting areas for improvement in QRNG technology, the overall findings confirm the potential of QRNG-based FHSS systems in significantly improving the security and reliability of drone communications. This work contributes to the growing field of quantum-enhanced wireless communications, offering substantial advancements in security and reliability for drone operations. The proposed system has potential applications in military, emergency response, and secure commercial drone operations, where enhanced communication security is paramount. Full article
(This article belongs to the Section Internet of Things)
Show Figures

Figure 1

Figure 1
<p>Flowchart of the frequency hopping sequence generation and synchronization process.</p>
Full article ">Figure 2
<p>Diagram illustrating the methodology of using a Randomness Processing Unit (RPU) for true random frequency hopping in an FHSS system.</p>
Full article ">Figure 3
<p>Diagram of the drone cloud with ring topology implementing FHSS with true random frequency hopping.</p>
Full article ">Figure 4
<p>Reference front panel for the QRNG Module ETH powered by the FMC 400 quantum entropy source by Quside.</p>
Full article ">Figure 5
<p>Diagram illustrating the methodology of using a QRNG for true random frequency hopping in a multi-drone FHSS system. The QRNG generates truly random numbers, which are distributed to multiple drones through a shared memory system. A concurrent access protocol manages access to the QRNG, ensuring efficient use of the device. Each drone implements its own FHSS system using the shared random numbers, enhancing anti-jamming capabilities and resistance to eavesdropping across the entire network.</p>
Full article ">Figure 6
<p>Drone 0: Autocorrelation.</p>
Full article ">Figure 7
<p>Drone 0: Frequency Distribution, where a noticeable dip around 5500 Hz indicates a reduced frequency count in the jammed region.</p>
Full article ">Figure 8
<p>Drone 0: Frequency Sequence over 100 hops of the total 100,000 hops.</p>
Full article ">Figure 9
<p>Drone 0: Spectral Analysis.</p>
Full article ">Figure 10
<p>Drone 1: Autocorrelation.</p>
Full article ">Figure 11
<p>Drone 1: Frequency Distribution, where a noticeable dip around 5500 Hz indicates a reduced frequency count in the jammed region.</p>
Full article ">Figure 12
<p>Drone 1: Frequency Sequence over 100 hops of the total 100,000 hops.</p>
Full article ">Figure 13
<p>Drone 1: Spectral Analysis.</p>
Full article ">Figure 14
<p>Drone 2: Autocorrelation.</p>
Full article ">Figure 15
<p>Drone 2: Frequency Distribution, where a noticeable dip around 5500 Hz indicates a reduced frequency count in the jammed region.</p>
Full article ">Figure 16
<p>Drone 2: Frequency Sequence over 100 hops of the total 100,000 hops.</p>
Full article ">Figure 17
<p>Drone 2: Spectral Analysis.</p>
Full article ">
15 pages, 3866 KiB  
Article
Distributed Passive Positioning and Sorting Method for Multi-Network Frequency-Hopping Time Division Multiple Access Signals
by Jiaqi Mao, Feng Luo and Xiaoquan Hu
Sensors 2024, 24(22), 7168; https://doi.org/10.3390/s24227168 - 8 Nov 2024
Viewed by 628
Abstract
When there are time division multiple access (TDMA) signals with large bandwidth, waveform aliasing, and fast frequency-hopping in space, current methods have difficulty achieving the accurate localization of radiation sources and signal-sorting from multiple network stations. To solve the above problems, a distributed [...] Read more.
When there are time division multiple access (TDMA) signals with large bandwidth, waveform aliasing, and fast frequency-hopping in space, current methods have difficulty achieving the accurate localization of radiation sources and signal-sorting from multiple network stations. To solve the above problems, a distributed passive positioning and network stations sorting method for broadband frequency-hopping signals based on two-level parameter estimation and joint clustering is proposed in this paper. Firstly, a two-stage filtering structure is designed to achieve control filtering for each frequency point. After narrowing down the parameter estimation range through adaptive threshold detection, the time difference of arrival (TDOA) and the velocity difference of arrival (VDOA) can be obtained via coherent accumulating based on the cross ambiguity function (CAF). Then, a multi-station positioning method based on the TDOA/VDOA is used to estimate the position of the target. Finally, the distributed joint eigenvectors of the multi-stations are constructed, and the signals belonging to different network stations are effectively classified using the improved K-means method. Numerical simulations indicate that the proposed method has a better positioning and sorting effect in low signal-to-noise (SNR) and low snapshot conditions compared with current methods. Full article
(This article belongs to the Section Communications)
Show Figures

Figure 1

Figure 1
<p>Location scenario of a distributed reconnaissance system.</p>
Full article ">Figure 2
<p>The framework of the proposed method.</p>
Full article ">Figure 3
<p>Broadband receiving structure based on RF direct acquisition.</p>
Full article ">Figure 4
<p>Preprocessing structure based on narrowband mixing.</p>
Full article ">Figure 5
<p>Experimental scenario.</p>
Full article ">Figure 6
<p>Coherent accumulation peak of CAF.</p>
Full article ">Figure 7
<p>Target positioning results.</p>
Full article ">Figure 8
<p>Signal sorting results.</p>
Full article ">Figure 9
<p>Comparison of the parameter estimation accuracy among various algorithms: (<b>a</b>) the TDOA error; (<b>b</b>) the VDOA error.</p>
Full article ">Figure 10
<p>Comparison of the positioning accuracy of different algorithms.</p>
Full article ">Figure 11
<p>Comparison of the sorting accuracy of the K-means algorithm, the improved K-means algorithms in [<a href="#B17-sensors-24-07168" class="html-bibr">17</a>,<a href="#B18-sensors-24-07168" class="html-bibr">18</a>,<a href="#B19-sensors-24-07168" class="html-bibr">19</a>], and the improved K-means method proposed in this paper.</p>
Full article ">
22 pages, 1556 KiB  
Article
Mobility-Based Multi-Hop Content Precaching Scheme in Content-Centric Vehicular Networks
by Hyunseok Choi, Youngju Nam, Gayeong Kim and Euisin Lee
Electronics 2024, 13(22), 4367; https://doi.org/10.3390/electronics13224367 - 7 Nov 2024
Viewed by 438
Abstract
Due to the rapid development of smart vehicles, such as self-driving cars, the demand for mobile data traffic by vehicle users has increased so much that base stations cannot handle it, causing delays in content provision. The burden on the base station can [...] Read more.
Due to the rapid development of smart vehicles, such as self-driving cars, the demand for mobile data traffic by vehicle users has increased so much that base stations cannot handle it, causing delays in content provision. The burden on the base station can be alleviated through roadside units (RSUs) to distribute the demand. However, outage zones, which fall outside the communication range of RSUs, still exist due to their high deployment cost. Existing schemes for covering outage zones have only considered single-hop precaching vehicles to provide precached content, which is insufficient to reduce outage zones effectively. Therefore, we propose a scheme to reduce outage zones by maximizing the amount of precached content using multi-hop precaching vehicles. The proposed scheme optimally selects precaching vehicles through a numerical model that calculates the amount of precached content. It enhances the process of multi-hop precaching by comparing the connection time of vehicles with the dark area time in the outage zone. To prevent excessive overheads due to frequent precaching vehicle handovers, the proposed scheme limits the selection to vehicles with a longer communication time, based on a precaching restriction indicator in the multi-hop precaching vehicle selection process. The simulation results show that our scheme outperforms representative schemes based on single-hop precaching. Full article
(This article belongs to the Special Issue Advances in Wireless Communication Performance Analysis)
Show Figures

Figure 1

Figure 1
<p>An overview of the proposed scheme.</p>
Full article ">Figure 2
<p>The connectionless time for the minimum selection time.</p>
Full article ">Figure 3
<p>The dark area time for the minimum selection time.</p>
Full article ">Figure 4
<p>The process of first-hop precaching vehicle selection.</p>
Full article ">Figure 5
<p>The process of second-hop precaching vehicle selection.</p>
Full article ">Figure 6
<p>The process of third-hop precaching vehicle selection.</p>
Full article ">Figure 7
<p>The dark area time according to (<b>a</b>) the density of vehicles; (<b>b</b>) the distance between RSUs.</p>
Full article ">Figure 8
<p>The connectionless time according to (<b>a</b>) the density of vehicles; (<b>b</b>) the distance between RSUs.</p>
Full article ">Figure 9
<p>The dark area time according to (<b>a</b>) the data rate; (<b>b</b>) the size of the requested content; (<b>c</b>) the average speed of vehicles.</p>
Full article ">Figure 10
<p>The connectionless time according to (<b>a</b>) the data rate; (<b>b</b>) the size of the requested content; (<b>c</b>) the average speed of vehicles.</p>
Full article ">
30 pages, 945 KiB  
Article
Multi-Phase Adaptive Recoding: An Analogue of Partial Retransmission in Batched Network Coding
by Hoover H. F. Yin, Mehrdad Tahernia and Hugo Wai Leung Mak
Network 2024, 4(4), 468-497; https://doi.org/10.3390/network4040024 - 30 Oct 2024
Viewed by 634
Abstract
Batched network coding (BNC) is a practical realization of random linear network coding (RLNC) designed for reliable network transmission in multi-hop networks with packet loss. By grouping coded packets into batches and restricting the use of RLNC within the same batch, BNC resolves [...] Read more.
Batched network coding (BNC) is a practical realization of random linear network coding (RLNC) designed for reliable network transmission in multi-hop networks with packet loss. By grouping coded packets into batches and restricting the use of RLNC within the same batch, BNC resolves the issue of RLNC that has high computational and storage costs at the intermediate nodes. A simple and common way to apply BNC is to fire and forget the recoded packets at the intermediate nodes, as BNC can act as an erasure code for data recovery. Due to the finiteness of batch size, the recoding strategy is a critical design that affects the throughput, the storage requirements, and the computational cost of BNC. The gain of the recoding strategy can be enhanced with the aid of a feedback mechanism, however the utilization and development of this mechanism is not yet standardized. In this paper, we investigate a multi-phase recoding mechanism for BNC. In each phase, recoding depends on the amount of innovative information remained at the current node after the transmission of the previous phases was completed. Relevant information can be obtained via hop-by-hop feedback; then, a more precise recoding scheme that allocates networking resources can be established. Unlike hop-by-hop retransmission schemes, the reception status of individual packets does not need to be known and packets to be sent in the next phase may not be the lost packets in the previous phase. Further, due to the loss-tolerance feature of BNC, it is unnecessary to pass all innovative information to the next node. This study illustrates that multi-phase recoding can significantly boost the throughput and reduce the decoding time as compared with the traditional single-phase recoding approach This opens a new window in developing better strategies for designing BNC rather than sending more batches in a blind manner. Full article
Show Figures

Figure 1

Figure 1
<p>An example of three-phase recoding. Each arrow corresponds to the flow of a packet. The crosses represent the lost packets.</p>
Full article ">Figure 2
<p>The flowchart highlighting the flow of this research.</p>
Full article ">Figure 3
<p>An example of two-phase variation of systematic recoding. Each arrow corresponds to the flow of a packet. The crosses represent the lost packets.</p>
Full article ">Figure 4
<p>An example flow of the protocol without adopting multi-phase systematic recoding. The hyphen in the feedback BID–phase–rank triple means that the value will not be used by the previous node.</p>
Full article ">Figure 5
<p>An example flow of the protocol with two-phase systematic recoding. The hyphen in the feedback BID–phase–rank triple means that the value will not be used by the previous node.</p>
Full article ">Figure 6
<p>The throughput of BNC when <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <msub> <mi>t</mi> <mi>avg</mi> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math> with various <span class="html-italic">p</span>. (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>20</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>30</mn> <mo>%</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>The throughput of BNC when <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <msub> <mi>t</mi> <mi>avg</mi> </msub> <mo>=</mo> <mn>8</mn> </mrow> </semantics></math> with various <span class="html-italic">p</span>. (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>20</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>30</mn> <mo>%</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>The decoding time when <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <msub> <mi>t</mi> <mi>avg</mi> </msub> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>F</mi> <mo>=</mo> <mn>1000</mn> </mrow> </semantics></math> with various <span class="html-italic">p</span>. (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>20</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>30</mn> <mo>%</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p>The decoding time when <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <msub> <mi>t</mi> <mi>avg</mi> </msub> <mo>=</mo> <mn>8</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>F</mi> <mo>=</mo> <mn>1000</mn> </mrow> </semantics></math> with various <span class="html-italic">p</span>. (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>20</mn> <mo>%</mo> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>30</mn> <mo>%</mo> </mrow> </semantics></math>.</p>
Full article ">
Back to TopTop