Search Results (52)

Low-latency content delivery is essential in the Internet of Vehicles (IoV) to support autonomous driving, cooperative perception, and infotainment services. However, rapidly changing vehicular mobility and demand patterns limit the effectiveness of existing content prediction and caching strategies, which often capture either short-term temporal trends or long-range dependencies, but not both. This paper proposes a hybrid deep learning architecture that integrates Long Short-Term Memory (LSTM) networks with Transformer encoders to jointly model fine-grained temporal dynamics and global correlations in content requests. The resulting popularity predictions are incorporated into a reinforcement learning (RL)-based caching policy, enabling proactive and adaptive cache placement at roadside units (RSUs) within an end-to-end optimization framework. Simulation results across representative IoV scenarios show that the proposed approach consistently improves cache hit ratio, retrieval latency, and prediction accuracy compared with LSTM-only, Transformer-only, Least Frequently Used (LFU), and Least Recently Used (LRU) baselines. Ablation studies further demonstrate the complementary strengths of the hybrid components, highlighting improved convergence behavior and robustness under varying demand distributions. Full article

Protecting the privacy of users’ data while maintaining reliability and accuracy in crowded events remains an open issue, especially with the growing capabilities and resources of attackers. This challenge becomes more difficult in dynamic environments with moving users/devices. Unfortunately, the current privacy-preserving methods suffer from several drawbacks that include reliability and accuracy of results, the need to fully trust a third party, or the incurrence of heavy overheads. This research presents a novel approach that is enhanced by peer cooperation, which is one of the most suitable techniques for crowded environments. The proposed approach is called “Smart Monikers with Multi-Peer Cooperation (SM2Peer)”. The SM2Peer addresses all the drawbacks of the traditional peer cooperation approach through two scenarios. In addition, the SM2Peer exploits the fog computing layer to control the cooperation among peers effectively, where each fog node manages several peers with smart moniker management. Moreover, SM2Peer provides multiple caches to relax the total overhead. The simulation and comparison with other common privacy approaches show the superiority of the SM2Peer in many aspects and metrics of privacy without a significant effect on performance. Full article

The space–air–ground integrated network (SAGIN) is a key 6G architecture that provides seamless three-dimensional connectivity, exhibiting hierarchical structural symmetry between LEO satellite and HAP layers. Integrating information-centric networking (ICN) with caching on Low Earth Orbit (LEO) satellites and high-altitude platforms (HAPs) significantly enhances content distribution efficiency. Existing studies on caching mechanisms have made progress but lack optimized cache resource allocation and accurate popular content identification. Thus, an interest-aware caching scheme (ICRL) based on reinforcement learning is proposed to optimize the SAGIN’s popular content caching decisions, aiming to achieve rational symmetric allocation of cache resources across LEO and HAP layers. Different from existing RL-based caching methods, the proposed ICRL scheme considers the LEO-HAP hierarchical architecture and designs an improved reinforcement learning mechanism to adapt to the dynamic characteristics of the SAGIN. First, an air–space two-tier caching architecture is constructed to enable collaborative caching between LEO satellites and HAPs. Second, to select high-value nodes intelligently, the proposed scheme leverages a comprehensive importance model that quantitatively analyzes HAP and LEO indicators such as topology, transmission capacity, and location. Finally, a reinforcement learning-based dynamic cache mechanism is developed. It captures real-time network requests and cache states to select optimal actions and adapt to network dynamics for better content popularity matching. Extensive evaluations based on NDNSIM demonstrate that ICRL outperforms baseline schemes in terms of cache hit ratio, server load, and request latency and achieves a symmetric balance of network load and service performance in the whole SAGIN. Full article

UAV path planning in complex 3D terrain faces the dual challenges of computational efficiency and reliable obstacle avoidance. To address these issues, this paper proposes a Keypoint–Sparse Cache (KSC) strategy and a hierarchical KSC-PPO (Proximal Policy Optimization) framework for mountainous environments with both static terrain and dynamic obstacles. The KSC strategy reduces search complexity through orthogonal slice-based sparse keypoint extraction and path caching reuse, thereby improving the efficiency of global path planning. On this basis, PPO-based local obstacle avoidance is activated only when safety thresholds are exceeded, while the remaining path is replanned globally after threat clearance, which confines avoidance computation to a local scope while preserving global path quality. Experiments in static mountainous environments show that KSC requires substantially less computation time than RRT* and Informed RRT* while maintaining competitive path efficiency, and it also outperforms four bio-inspired optimization algorithms across terrains of increasing complexity. Hybrid navigation validation experiments further show that KSC-PPO achieves high mission success, low collision rates, and low avoidance overhead in dynamic mountainous environments. Experiments demonstrate that KSC-PPO decomposes exponential global search space into controllable linear subproblems, significantly enhancing efficiency while ensuring path quality, providing an effective solution for UAV navigation in complex terrain. Full article

Space–air–ground integrated networks (SAGINs) enable flexible content delivery through satellite–UAV–ground cooperation, yet time-varying user demand and dynamic backhaul conditions pose significant challenges to efficient UAV caching. To address these challenges, this paper proposes PCICaching, a backhaul-aware and prediction-driven UAV caching framework that integrates LSTM-based popularity forecasting, cache-aware user association, and conditionally activated cooperative caching. Under normal satellite backhaul conditions, PCICaching operates in a latency-oriented mode and reduces average content delivery latency by up to 33.9% and 38.9% compared with representative GTGA-based and history-based baselines, respectively. When backhaul connectivity degrades, the proposed C3 mechanism enlarges cluster-level content coverage and maintains service continuity with only a moderate latency increase of approximately 14.2%. Moreover, the proposed sequential decomposition enables scalable online operation with per-update execution time below 100 ms. These results demonstrate that PCICaching provides a structurally adaptive and computationally efficient solution for UAV-assisted caching in SAGINs, effectively balancing latency efficiency and content availability under time-varying demand and infrastructure uncertainty. Full article

In the development of multi-vehicle cooperative hardware-in-the-loop (HIL) simulation platforms based on machine vision, accurate vehicle pose estimation is crucial for achieving efficient cooperative control. However, monocular vision systems inevitably suffer from limited fields of view and insufficient image resolution during target detection, making it difficult to meet the requirements of large-scale, multi-target real-time perception. To address these challenges, this paper proposes an engineering-oriented multi-camera cooperative vision detection method, designed to maximize processing efficiency and real-time performance while maintaining detection accuracy. The proposed approach first projects the imaging results from multiple cameras onto a unified physical plane. By precomputing and caching the image stitching parameters, the method enables fast and parallelized image mosaicking. Experimental results demonstrate that, under typical vehicle speeds and driving angles, the stitched images achieve a 93.41% identification code recognition rate and a 99.08% recognition accuracy. Moreover, with high-resolution image (1440 × 960) inputs, the system can stably output 30 frames per second of stitched image streams, fully satisfying the dual requirements of detection precision and real-time processing for engineering applications. Full article

The highly directional narrow-beam operation in mmWave networks, while effective at suppressing interference, lacks adaptability to dynamic traffic variations and blockages compared to D-TDD and JT schemes. D-TDD efficiently mitigates DL–UL cross-interference during asymmetric traffic. At the same time, joint transmission coordinates multiple base stations to deliver phase-aligned signals, converting interference into useful combined power and ensuring stable links under dynamic slot changes. However, these adaptive regimes are often overlooked in recent mmWave designs, leading to degraded communication performance. This work proposes D-TDD-based cooperative caching (DTCC) mmWave networks, where randomly distributed base stations with local caches enhance reliability and reduce backhaul load. Closed-form expressions for the cache hit probability and the average content success probability (ASP) are derived under the proposed DTCC framework. Popularity-based caching strategies with both equal and variable file sizes are analysed to maximise network-level performance. The simulation results validate that the proposed DTCC framework consistently enhances ASP in dense small-cell deployments, offering notable reliability gains over conventional single-BS (SBS) and static TDD (S-TDD)-based cooperative caching approaches. Full article

Content Delivery Networks (CDNs) have evolved to meet surging data demands and stringent low-latency requirements driven by emerging applications like high-definition video streaming, virtual reality, and IoT. This paper proposes a hybrid CDN architecture that synergistically combines edge caching, Multi-access Edge Computing (MEC) offloading, and reinforcement learning (Q-learning) for adaptive routing. In the proposed system, popular content is cached at radio access network edges (e.g., base stations) and computation-intensive tasks are offloaded to MEC servers, while a Q-learning agent dynamically routes user requests to the optimal service node (cache, MEC server, or origin) based on the network state. The study presented detailed system design and provided comprehensive simulation-based evaluation. The results demonstrate that the proposed hybrid approach significantly improves cache hit ratios and reduces end-to-end latency compared to traditional CDNs and simpler edge architectures. The Q-learning-enabled routing adapts to changing load and content popularity, converging to efficient policies that outperform static baselines. The proposed hybrid model has been tested against variants lacking MEC, edge caching, or the RL-based controller to isolate each component’s contributions. The paper concludes with a discussion on practical considerations, limitations, and future directions for intelligent CDN networking at the edge. Full article

The exponential growth of wireless traffic has imposed new technical challenges on the Internet and defined new approaches to dealing with its intensive use. Caching, especially cooperative caching, has become a revolutionary paradigm shift to advance environments based on wireless technologies to enable efficient data distribution and support the mobility, scalability, and manageability of wireless networks. Mobile ad hoc networks (MANETs), wireless mesh networks (WMNs), Wireless Sensor Networks (WSNs), and Vehicular ad hoc Networks (VANETs) have adopted caching practices to overcome these hurdles progressively. In this paper, we discuss the problems and issues in the current wireless ad hoc paradigms as well as spotlight versatile cooperative caching as the potential solution to the increasing complications in ad hoc networks. We classify and discuss multiple cooperative caching schemes in distinct wireless communication contexts and highlight the advantages of applicability. Moreover, we identify research directions to further study and enhance caching mechanisms concerning new challenges in wireless networks. This extensive review offers useful findings on the design of sound caching strategies in the pursuit of enhancing next-generation wireless networks. Full article

In the current mobile edge computing (MEC) system, the user dynamics, diversity of applications, and heterogeneity of services have made cooperative service caching and task offloading decision increasingly important. Service caching and task offloading have a naturally hierarchical structure, and thus, hierarchical reinforcement learning (HRL) can be used to effectively alleviate the dimensionality curse in it. However, traditional HRL algorithms are designed for short-term missions with sparse rewards, while existing HRL algorithms proposed for MEC lack delicate a coupling structure and perform poorly. This article introduces a novel HRL-based algorithm, named hierarchical service caching and task offloading (HSCTO), to solve the problem of the cooperative optimization of service caching and task offloading in MEC. The upper layer of HSCTO makes decisions on service caching while the lower layer is in charge of task offloading strategies. The upper-layer module learns policies by directly utilizing the rewards of the lower-layer agent, and the tightly coupled design guarantees algorithm performance. Furthermore, we adopt a fixed multiple time step method in the upper layer, which eliminates the dependence on the semi-Markov decision processes (SMDPs) theory and reduces the cost of frequent service replacement. We conducted numerical evaluations and the experimental results show that HSCTO improves the overall performance by 20%, and reduces the average energy consumption by 13% compared with competitive baselines. Full article

The integration of unmanned aerial vehicles (UAVs) into vehicular networks offers numerous advantages in enhancing communication and coverage performance. With the ability to move flexibly in three-dimensional space, UAVs can effectively bridge the communication gap between intelligent connected vehicles (ICVs) and infrastructure. However, the rapid movement of UAVs and ICVs poses significant challenges to the stability and reliability of communication links. Motivated by these challenges, integrated UAV–ICV networks can be viewed as vehicular delay-tolerant networks (VDTNs), where data delivery is accomplished through the “store-carry-forward” transmission mechanism. Since VDTNs exhibit social attributes, this paper first investigates the opportunistic transmission problem in the presence of selfish nodes. Then, by enabling node cooperation, this paper proposes an opportunistic transmission scheme for integrated UAV–ICV networks. To address the issue of node selfishness in practical scenarios, the proposed scheme classifies the degree of cooperation and analyzes the encounter probability between nodes. Based on this, information is initially flooded, and the UAV is selected for data distribution by jointly considering the node centrality, energy consumption, and cache size. Finally, simulation results demonstrate that the proposed scheme can effectively improve the delivery ratio and reduce the average delivery delay compared to state-of-the-art schemes. Full article

In unmanned aerial vehicle (UAV)-assisted device-to-device (D2D) caching networks, the uncertainty from unpredictable content demands and variable user positions poses a significant challenge for traditional optimization methods, often making them impractical. Multi-agent deep reinforcement learning (MADRL) offers significant advantages in optimizing multi-agent system decisions and serves as an effective and practical alternative. However, its application in large-scale dynamic environments is severely limited by the curse of dimensionality and communication overhead. To resolve this problem, we develop a scalable heterogeneous multi-agent mean-field actor-critic (SH-MAMFAC) framework. The framework treats ground users (GUs) and UAVs as distinct agents and designs cooperative rewards to convert the resource allocation problem into a fully cooperative game, enhancing global network performance. We also implement a mixed-action mapping strategy to handle discrete and continuous action spaces. A mean-field MADRL framework is introduced to minimize individual agent training loads while enhancing total cache hit probability (CHP). The simulation results show that our algorithm improves CHP and reduces transmission delay. A comparative analysis with existing mainstream deep reinforcement learning (DRL) algorithms shows that SH-MAMFAC significantly reduces training time and maintains high CHP as GU count grows. Additionally, by comparing with SH-MAMFAC variants that do not include trajectory optimization or power control, the proposed joint design scheme significantly reduces transmission delay. Full article

In today’s digital landscape, content delivery networks (CDNs) play a pivotal role in ensuring rapid and seamless access to online content across the globe. By strategically deploying a network of edge servers in close proximity to users, CDNs optimize the delivery of digital content. One key mechanism involves caching frequently requested content at these edge servers, which not only alleviates the load on the source CDN server but also enhances the overall user experience. However, the exponential growth in user demands has led to increased network congestion, subsequently reducing the cache hit ratio within CDNs. To address this reduction, this paper presents an innovative approach for efficient cache replacement in a dynamic caching environment while maximizing the cache hit ratio via a cooperative cache replacement policy based on reinforcement learning. This paper presents an innovative approach to enhance the performance of CDNs through an advanced cache replacement policy based on reinforcement learning. The proposed system model depicts a mesh network of CDNs, with edge servers catering to user requests, and a main source CDN server. The cache replacement problem is initially modeled as a Markov decision process, and it is extended to a multi-agent reinforcement learning problem. We propose a cooperative cache replacement algorithm based on a multi-agent deep-Q network (MADQN), where the edge servers cooperatively learn to efficiently replace the cached content to maximize the cache hit ratio. Experimental results are presented to validate the performance of our proposed approach. Notably, our MADQN policy exhibits superior cache hit ratios and lower average delays compared to traditional caching policies. Full article

With the increasing complexity of applications, many delay-sensitive and compute-intensive services have posed significant challenges to mobile devices. Addressing how to efficiently allocate heterogeneous network resources to meet the computing and delay requirements of terminal services is a pressing issue. In this paper, a new cooperative twin delayed deep deterministic policy gradient and deep-Q network (TD3-DQN) algorithm is introduced to minimize system latency by optimizing computational offloading and caching placement asynchronously. Specifically, the task-partitioning technique divides computing tasks into multiple subtasks, reducing the response latency. A DQN intelligent algorithm is presented to optimize the offloading path to edge servers by perceiving network resource status. Furthermore, a TD3 approach is designed to optimize the cached content in the edge servers, ensuring dynamic popularity content requirements are met without excessive offload decisions. The simulation results demonstrate that the proposed model achieves lower latency and quicker convergence in asymmetrical cloud–edge collaborative networks compared to other benchmark algorithms. Full article

Unmanned Aerial Vehicles (UAVs) have emerged as efficient tools in disaster-stricken areas, facilitating efficient data dissemination for post-disaster rescue operations. However, the limited onboard energy of UAVs imposes significant constraints on their operational lifespan, thereby presenting substantial challenges for efficient data dissemination. Therefore, this work investigates a data dissemination scheme to enhance the UAVs’ bandwidth efficiency in multi-UAV-enabled Internet of Vehicles, thereby reducing UAVs’ energy consumption and improving overall system performance when UAVs hover along designated flight trajectories for data dissemination. Specifically, first, we present a software-defined network-based framework for data dissemination in multi-UAV-enabled IoV. According to this framework, we formulate a problem called C2BS (Coding-based Cooperative Broadcast Scheduling) that focuses on optimizing the UAVs’ bandwidth efficiency by leveraging the combined benefits of coding and caching. Furthermore, we demonstrate the NP-hardness of the C2BS problem by employing a polynomial time reduction technique on the simultaneous matrix completion problem. Then, inspired by the benefits offered by genetic algorithms, we propose a novel approach called the Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to address the C2BS problem. This approach encompasses a coding scheme for representing individuals, a fitness function for assessing individuals, operators (i.e., crossover and mutation) for generating offspring, a local search technique to enhance search performance, and a repair operator employed to rectify infeasible solutions. Additionally, we present an analysis of the time complexity for the GCS algorithm. Finally, we present a simulation model to evaluate the performance. Experimental findings provide evidence of the excellence of the proposed scheme. Full article