Network Allocation Research Articles

Resource Allocation in UAV-D2D Networks: A Scalable Heterogeneous Multi-Agent Deep Reinforcement Learning Approach

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.

Dynamic energy efficient resource allocation in multi-user multi-IRS mmWave 6G networks

Dynamic energy efficient resource allocation in multi-user multi-IRS mmWave 6G networks

Joint Resource Allocation and Trajectory Optimization in Multi-Cell UAV and Sidelink Heterogeneous Networks

Joint Resource Allocation and Trajectory Optimization in Multi-Cell UAV and Sidelink Heterogeneous Networks

Molecular Absorption-Aware User Assignment, Spectrum, and Power Allocation in Dense THz Networks With Multi-Connectivity

Molecular Absorption-Aware User Assignment, Spectrum, and Power Allocation in Dense THz Networks With Multi-Connectivity

Using intelligence in resource allocation and task off-loading for the IoE-edge networks

Using intelligence in resource allocation and task off-loading for the IoE-edge networks

Layout design of densest weakly coupled multi-core fibers to minimize the network blocking rate

The suppression of inter-core crosstalk (IC-XT) that affects each lightpath is crucial for resource allocation in space-division multiplexing elastic optical networks (SDM-EONs) with multi-core fibers (MCFs). Resource allocation approaches that limit the simultaneous use of adjacent cores in the same frequency band to the MCFs composing each lightpath have been widely adopted to suppress IC-XT. However, in principle, such methods are inefficient because they cannot fully utilize all cores. This study examines the core density from the perspective of the core layout in weakly coupled MCFs and the IC-XT suppression requirement. The densest MCF layout maximizes the network capacity while restricting the amount of IC-XT within the tolerance threshold for each lightpath. Specifically, we propose an XT-free condition, maintaining the IC-XT to each lightpath within the acceptable tolerance level. In addition, we evaluated numerous MCFs that satisfy or do not satisfy the XT-free condition with various network topologies and cladding diameters. This evaluation also validates the IC-XT reduction performance of the proposed framework compared with that of the conventional resource-allocation approach. Here, we incorporate our indirect IC-XT calculation method that affects lightpaths from other cores via its nearest cores, which was overlooked in the resource allocation problem. Based on these comprehensive examinations, we propose a method to determine the densest core layout for a given network topology and route and modulation format selection algorithm.

Game-based computation offloading and resource allocation in stochastic geometry-modeling vehicular networks

Game-based computation offloading and resource allocation in stochastic geometry-modeling vehicular networks

Optimizing urban bus network based on spatial matching patterns for sustainable transportation: A case study in Harbin, China.

The rapid economic development and accelerating urbanization have led to a significant mismatch between the urban bus network allocation and the population flow. Therefore, this paper investigates this challenge by exploring the intricate relationship between the population flow dynamics, traffic congestion conditions, and the efficient allocation of bus resources. In response, two key indexes were introduced based on spatial matching patterns to assess the urban bus network: the Population-Bus Match Index evaluates the matching degree between supply and demand, and the Population-Congestion Match Index evaluates the matching degree between utilization and saturation. Additionally, two distinct optimization strategies have been proposed to enhance the urban bus network. The first optimization strategy considers the bus network's current status, while the second aspires to an idealized scenario. Subsequently, the potential contributions of each bus station in reducing CO2 emission reduction after implementing the two optimization strategies are quantified. Utilizing a case study focused on Harbin, the proposed methods are validated. The findings unveil a substantial misalignment between supply and demand within the bus network during peak periods, with nearly half of the bus stations experiencing a disparity between utilization and saturation. Comparative experiments across different optimization strategies reveal that the second optimization strategy significantly outperforms the first, but the first optimization strategy has a higher degree of CO2 emission reduction contribution. The results of this study provide decision-makers with an environmentally oriented vantage point for the discerning selection of optimization strategies and leave valuable insights for urban areas confronting transportation challenges.

An efficient Protocol for Enhanced Flynet Communication in Presence of Partitioning

This paper presents an adaptive fault-tolerant resource allocation protocol tailored for FlyNet, a dynamic aerial network characterized by its mobility and three-dimensional operational space. Addressing the challenges of network partitioning and resource allocation in aerial networks, the proposed algorithm dynamically adjusts to the network's changing topology, ensuring consistent and efficient resource management. Through robust fault tolerance mechanisms, the protocol enhances FlyNet's reliability, maintaining seamless communication and optimal resource utilization even amid node mobility and disruptions. Simulation results demonstrate the algorithm's effectiveness in adapting to dynamic environments, maximizing resource utilization, and minimizing communication delays.

Improving the efficiency of resource allocation in educational content delivery networks using the 1C:ESB integration bus

Learning Management Systems (LMS) play a key role in the educational process by providing students with various educational content and instructors with tools to monitor student knowledge and assess progress. However, as the number of students increases, the load on data transmission channels increases, which can lead to a decrease in the quality of learning. To solve this problem, Content Delivery Networks (CDN) are used to speed up the loading of websites and reduce the load on servers. CDN ensure the availability and security of websites and improve their scalability (resistance to smooth load growth) by distributing content across a network of servers around the world, allowing users to access content faster and more efficiently.Integration data exchange bus (Enterprise Service Bus, ESB) can be an effective tool for optimizing CDN content distribution algorithm. It allows integration of different systems and applications, enabling data exchange between them. This is particularly useful in the context of distance learning, which requires fast and reliable delivery of educational content, feedback, learning analytics, etc. Implementing an integration bus of data exchange with LMS-based distance learning system can be a key factor in ensuring an efficient and quality educational process. The article considers the properties and characteristics of the integration bus and justifies the use of the integration bus to optimize the algorithm of CDN content distribution, in particular in LMS.

On mitigating reactive jamming with dynamic resource allocation in optical IRS and UAV-assisted FSO-based networks

Free space optics (FSO) offers a promising opportunity to enhance next-generation network’s capacity with its unlicensed spectrum and wide bandwidth. However, jamming attacks, coupled with inherent anomalies in the FSO-based channel, threaten the performance of these networks. This is especially problematic for security-sensitive applications that demand a resilient communication infrastructure. To address this issue, optical intelligent reflecting surfaces (IRS) and unmanned aerial vehicles (UAVs) can provide promising solutions. This work introduces an efficient approach for mirror element assignment in UAV-assisted FSO-based networks, aimed at mitigating reactive jamming attacks while satisfying users’ quality-of-service (QoS) requirements. To ensure network reliability, we formulate an optimization problem that enhances overall network performance by simultaneously allocating resources such as mirror elements with awareness of jamming attacks. The formulated optimization problem is a binary linear programming problem, which is generally NP-hard. To address this, we introduce a batch-based sequential fixing linear programming procedure called the Reactive Jamming-Aware Mirror Element Allocation (RJA-MEA) scheme. This scheme optimally assigns mirror elements to satisfy the users’ rate demands. In this paper, the performance of the RJA-MEA scheme is compared with reference schemes such as Reactive Jamming Unaware-Mirror Element Allocation (RJU-MEA), Reactive Jamming-Aware Equal Mirror Element Allocation (RJA-EMEA), and Reactive Jamming Unaware-Equal Mirror Element Allocation (RJU-EMEA) schemes. The simulation results reveal that the proposed RJA-MEA scheme surpasses existing reference schemes, thereby significantly improving the overall network sumrate performance.

A guided twin delayed deep deterministic reinforcement learning for vaccine allocation in human contact networks

This manuscript introduces an innovative approach to optimizing the distribution of a limited vaccine resource within a population modeled as a contact network, aiming to mitigate the spread of infectious diseases. The study develops a novel methodology that combines reinforcement learning and graph neural networks. To understand the dynamics of disease propagation, the study constructs an analytical model that outlines conditions for disease eradication or endemic states. This model supports a series of simulation experiments across various scenarios, demonstrating the proposed method’s superiority over random and centrality-based approaches in reducing the average number of infections per individual during an outbreak. The adaptability of the proposed method is further emphasized by its robust performance across networks of diverse sizes and configurations, highlighting its real-world applicability. The findings of this study have significant implications for public health policy and resource allocation, offering a promising framework for managing infectious disease outbreaks in complex and dynamic environments.

Retraction Note: Channel allocation and spectrum use in optical networks using machine learning a 5G application analysis

Retraction Note: Channel allocation and spectrum use in optical networks using machine learning a 5G application analysis

Research and Application of Emergency Logistics Resource Allocation Algorithm based on Supply Chain Network

The ”Fuzzy-Enhanced for Emergency Logistics Resource Allocation in Supply Chain Networks (FEM-ELRAS)” presents a novel approach to optimizing emergency logistics and resource allocation in supply chain networks, especially during critical disaster response scenarios. This research integrates fuzzy logic with the improve Multi Agent Genetic Algorithm (MAGA), creating a more adaptive and efficient framework capable of handling the uncertainties and complexities inherent in emergency situations. FEM-ELRAS employs fuzzy decision variables to represent ambiguous and fluctuating parameters like demand at disaster sites, supply availability, and variable transportation conditions. It incorporates a fuzzy inference system, utilizing expert-derived rules to guide the allocation process amidst uncertain and rapidly changing conditions. The algorithm’s evaluation mechanism is enhanced with fuzzy logic, offering a refined assessment of solution effectiveness, balancing multiple logistical objectives such as minimizing response time, optimizing costs, and maximizing resource utilization and delivery precision. Moreover, fuzzy logic principles are integrated into the genetic algorithm’s operators, enabling more context-sensitive and flexible solution adaptations. FEM-ELRAS is particularly designed to navigate the trade-offs between different logistical goals in emergency scenarios, making it a robust tool for decision-makers in disaster management. Its application promises significant improvements in emergency response efficiency, showcasing a step forward in the field of emergency logistics and supply chain management.

A hierarchical adaptive federated reinforcement learning for efficient resource allocation and task scheduling in hierarchical IoT network

The increasing demand for processing numerous data from IoT devices in a hierarchical IoT network drives researchers to propose different resource allocation methods in the edge hosts efficiently. Traditional approaches often compromise on one of these aspects: either prioritizing local decision-making at the edge, which lacks global system insights or centralizing decisions in cloud systems, which raises privacy concerns. Additionally, most solutions do not consider scheduling tasks at the same time to effectively complete the prioritized task accordingly. This study introduces the hierarchical adaptive federated reinforcement learning (HAFedRL) framework for robust resource allocation and task scheduling in hierarchical IoT networks. At the local edge host level, a primal–dual update based deep deterministic policy gradient (DDPG) method is introduced for effective individual task resource allocation and scheduling. Concurrently, the central server utilizes an adaptive multi-objective policy gradient (AMOPG) which integrates a multi-objective policy adaptation (MOPA) with dynamic federated reward aggregation (DFRA) method to allocate resources across connected edge hosts. An adaptive learning rate modulation (ALRM) is proposed for faster convergence and to ensure high performance output from HAFedRL. Our proposed HAFedRL enables the effective integration of reward from edge hosts, ensuring the alignment of local and global optimization goals. The experimental results of HAFedRL showcase its efficacy in improving system-wide utility, average task completion rate, and optimizing resource utilization, establishing it as a robust solution for hierarchical IoT networks.

Resource learning aware algorithm for route prediction and resources allocation in elastic optical networks with network analytics

We have proposed two algorithms in this paper for dynamic traffic in elastic optical networks (EON). Algorithm1 considers the spatial access blocking probability metric (SABPM) during dynamic operation and route traffic to a path with lower SABPM. Therefore, it considers a path with more contiguous blocks to support heterogeneous bandwidths (BW) and modulation schemes. Algorithm1 keeps a balance of fragmentation on available routes. Algorithm2 makes routing decision for dynamic traffic based on the maximum idle slots as well as minimum SABPM. Therefore, it selects a less fragmented path with more number of available contiguous blocks to support heterogeneous BW. Algorithm2 balances the path utilization and avoids over utilization of congested route. We have evaluated the performance of both algorithms in terms of spatial external fragmentation, contiguity ratio, contiguous aligned spectrum ratio, SABPM, and BW blocking probability (BwBP). Python with seaborn, pandas, and other libraries are used for network analytics. Results show that resource utilization improves with the proposed algorithms. It has been shown that algorithm2 and algorithm1 achieve 27% and 18% traffic gains respectively over the alternate routing.

Cross-User Dependent Task Offloading and Resource Allocation in Spatial-Temporal Dynamic MEC Networks

Cross-User Dependent Task Offloading and Resource Allocation in Spatial-Temporal Dynamic MEC Networks

Matching Combined Heterogeneous Multi-Agent Reinforcement Learning for Resource Allocation in NOMA-V2X Networks

Matching Combined Heterogeneous Multi-Agent Reinforcement Learning for Resource Allocation in NOMA-V2X Networks

Resource Allocation for Dynamic Platoon Digital Twin Networks: A Multi-Agent Deep Reinforcement Learning Method

Resource Allocation for Dynamic Platoon Digital Twin Networks: A Multi-Agent Deep Reinforcement Learning Method

Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell-Free User-Centric Massive MIMO Networks

Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell-Free User-Centric Massive MIMO Networks