Multi-dimensional Resource Allocation Research Articles

Multi-dimensional resource allocation strategy for LEO satellite communication uplinks based on deep reinforcement learning

In the LEO satellite communication system, the resource utilization rate is very low due to the constrained resources on satellites and the non-uniform distribution of traffics. In addition, the rapid movement of LEO satellites leads to complicated and changeable networks, which makes it difficult for traditional resource allocation strategies to improve the resource utilization rate. To solve the above problem, this paper proposes a resource allocation strategy based on deep reinforcement learning. The strategy takes the weighted sum of spectral efficiency, energy efficiency and blocking rate as the optimization objective, and constructs a joint power and channel allocation model. The strategy allocates channels and power according to the number of channels, the number of users and the type of business. In the reward decision mechanism, the maximum reward is obtained by maximizing the increment of the optimization target. However, during the optimization process, the decision always focuses on the optimal allocation for current users, and ignores QoS for new users. To avoid the situation, current service beams are integrated with high- traffic beams, and states of beams are refactored to maximize long-term benefits to improve system performance.Simulation experiments show that in scenarios with a high number of users, the proposed resource allocation strategy reduces the blocking rate by at least 5% compared to reinforcement learning methods, effectively enhancing resource utilization.

Multi-Objective Multi-Dimensional Resource Allocation for Categorized QoS Provisioning in Beyond 5G and 6G Radio Access Networks

Multi-Objective Multi-Dimensional Resource Allocation for Categorized QoS Provisioning in Beyond 5G and 6G Radio Access Networks

Joint optimization of multi-dimensional resource allocation and task offloading for QoE enhancement in Cloud-Edge-End collaboration

Cloud-Edge-End Collaboration (CEEC) computing architecture inherits many merits from both edge computing and cloud computing and thus is considered as a promising candidate for future network services. In CEEC, user’s QoE is impacted by offload performance which should consider offload strategy, computational resources and network status simultaneously. However, previous offload optimization studies neglect the joint consideration of dependent task offloading, computational resources and channel resources, which may not produce potential performance improvement. In this paper, we investigate the joint optimization of dependent task offloading, computational resource allocation, user transmission power control, and channel resource allocation in the CEEC scenario, with the goal of maximizing user’s QoE. Initially, a new QoE metric is defined to capture the impacts of delay and energy consumption on user’s QoE. Following this definition, we formulate the joint optimization problem as a Mixed Integer Nonlinear Programming (MINLP) problem and introduce a method of multi-agent deep reinforcement learning to solve our MINLP problem with high computation complexity. Extensive experiments are performed, and experimental results show that our proposed scheme outperforms baselines in a series of metrics.

Computation Offloading and Resource Allocation for E2E Tasks in Satellite Edge Computing Networks

Satellite edge computing shows promise in delivering seamless, low-latency services in challenging contexts such as deserts, oceans, and during natural disasters. Previous studies focused on the selection of suitable offloading nodes for task processing and result transmission to the original node. However, for end-to-end tasks, exemplified by applications like satellite-based remote sensing and forestry monitoring, the disparity between source and destination nodes emphasizes the importance of routing selection in data transmission. This aspect substantially limits the effectiveness of traditional computation offloading methods. In this paper, we formulate a joint computation offloading, routing, and multiple resource allocation optimization problem for end-to-end tasks in satellite edge computing networks. Moreover, to reduce the complexity of this nondeterministic polynomial-time hard (NP-hard) problem, we decompose it into the multidimensional resource allocation in fixed offloading and routing condition and the computation offloading and routing selection problem. An algorithm based on binary particle swarm optimization for joint computation offloading, routing, and multiple resource allocation optimization problem is proposed. Simulation results are presented to demonstrate the performance of our scheme compared with other baseline schemes.

Improved DDPG Based Two-Timescale Multi-Dimensional Resource Allocation for Multi-Access Edge Computing Networks

Improved DDPG Based Two-Timescale Multi-Dimensional Resource Allocation for Multi-Access Edge Computing Networks

Dynamics Spectrum Sharing Environment Using Deep Learning Techniques

The recent fast expansion of mobile communication services has resulted in a scarcity of spectrum resources. The challenge of multidimensional resource allocation in cognitive radio systems is addressed in this work. Complicated and dynamic Spectrum Sharing SS systems might be vulnerable to a variety of possible security and privacy vulnerabilities, necessitating protection techniques that are adaptable, dependable, and scalable. Methods based on machine learning (ML) have repeatedly been proposed to overcome these challenges. We present a complete assessment of the current progress of ML-based SS approaches, the most crucial security challenges, and the accompanying protection mechanisms in this paper. We develop cutting-edge methodologies for improving the performance of SS communication systems in a variety of critical areas, such as ML-based cognitive radio networks (CRNs), ML-based database assisted SS networks, ML-based LTE-U networks, ML-based ambient backscatter networks, and other ML-based SS solutions. The results of the simulation trials show that the suggested strategy may successfully boost the user's incentive while reducing collisions. In terms of reward, the suggested strategy beats opportunistic multichannel ALOHA by around 10% and 30%, respectively, for the single SU and multi-SU scenarios.

Joint Terminal Pairing and Multi-Dimensional Resource Allocation for Cooperative Computation in a WP-MEC System

The combination of multi-access edge computing (MEC) and wireless power transfer (WPT) can potentially improve system performance and prolong terminals’ battery lifetime. In this paper, we study cooperative computation in a wireless powered multi-access edge computing (WP-MEC) system. In this system, there are an access point (AP) deployed with an MEC server and multiple cellular terminals that are powered by harvested energy from a power station. The computational task of each terminal is partially completed locally and partially offloaded to the AP and an nearby idle terminal. In order to minimize energy consumption in the system, we jointly optimize terminal pairing and multi-dimensional resource (i.e., computing power and communication resource) allocation. A non-convex mixed-integer non-linear programming (MINLP) problem is formulated in this paper. To solve this challenging problem, we propose a bilevel optimization approach, in which the multi-dimensional resource allocation scheme is designed under given terminal pairing relationships in the inner level, and then the pairing relationships between terminals are obtained in the outer level based on the obtained multi-dimensional resource allocation scheme. Extensive numerical results show that the proposed bilevel optimization scheme can reduce energy consumption considerably compared to some baseline schemes.

Multi-Dimensional Resource Allocation for Throughput Maximization in CRIoT with SWIPT

To solve the power supply problem of battery-limited Internet of Things devices (IoDs) and the spectrum scarcity problem, simultaneous wireless information and power transfer (SWIPT) and cognitive radio (CR) technology were integrated into the Internet of Things (IoT) network to build a cognitive radio IoT (CRIoT) with SWIPT. In this network, secondary users (SUs) could adaptively switch between spectrum sensing, SWIPT, and information transmission to improve the total throughput. To solve the complicated multi-dimensional resource allocation problem in CRIoT with SWIPT, we propose a multi-dimensional resource allocation algorithm for maximizing the total throughput. Three-dimensional resources were jointly optimized, which are time resource (the duration of each process), power resource (the transmit power and the power splitting ratio of each node), and spectrum resource, under some constraints, such as maximum transmit power constraint and maximum permissible interference constraint. To solve this intractable mixed-integer nonlinear program (MINLP) problem, firstly, the sensing task assignment for cooperative spectrum sensing (CSS) was obtained by using a greedy sensing algorithm. Secondly, the original problem was transformed into a convex problem via some transformations with fixed-power splitting ratio and time switching. The Lagrange dual method and subgradient method were adopted to obtain the optimal power and channel allocation. Then, a one-dimensional search algorithm was used to obtain the optimal power splitting ratio and the time switching ratio. Finally, a heuristic algorithm was adopted to obtain the optimal sensing duration. The simulation results show that the proposed algorithm can achieve higher total system throughput than other benchmark algorithms, such as a greedy algorithm, an average algorithm, and the Kuhn–Munkres (KM) algorithm.

Multi-Dimensional Resource Allocation in Distributed Data Centers Using Deep Reinforcement Learning

With the development of edge-cloud computing technologies, distributed data centers (DCs) have been extensively deployed across the global Internet. Since different users/applications have heterogeneous requirements on specific types of ICT resources in distributed DCs, how to optimize such heterogeneous resources under dynamic and even uncertain environments becomes a challenging issue. Traditional approaches are not able to provide effective solutions for multi-dimensional resource allocation that involves the balanced utilization across different resource types in distributed DC environments. This paper presents a reinforcement learning based approach for multi-dimensional resource allocation (termed as NESRL-MRM) that is able to achieve balanced utilization and availability of resources in dynamic environments. To train NESRL-MRM’s agent with sufficiently quick wall-clock time but without the loss of exploration diversity in the search space, a natural evolution strategy (NES) is employed to approximate the gradient of the reward function. To realistically evaluate the performance of NESRL-MRM, our simulation evaluations are based on real-world workload traces from Amazon EC2 and Google datacenters. Our results show that NESRL-MRM is able to achieve significant improvement over the existing approaches in balancing the utilization of multi-dimensional DC resources, which leads to substantially reduced blocking probability of future incoming workload demands.

EDI-Driven Multi-Dimensional Resource Allocation for Inclusive 6G Communications

EDI-Driven Multi-Dimensional Resource Allocation for Inclusive 6G Communications

Dynamic Spectrum Sharing Based on Deep Reinforcement Learning in Mobile Communication Systems.

The rapid development of mobile communication services in recent years has resulted in a scarcity of spectrum resources. This paper addresses the problem of multi-dimensional resource allocation in cognitive radio systems. Deep reinforcement learning (DRL) combines deep learning and reinforcement learning to enable agents to solve complex problems. In this study, we propose a training approach based on DRL to design a strategy for secondary users in the communication system to share the spectrum and control their transmission power. The neural networks are constructed using the Deep Q-Network and Deep Recurrent Q-Network structures. The results of the conducted simulation experiments demonstrate that the proposed method can effectively improve the user's reward and reduce collisions. In terms of reward, the proposed method outperforms opportunistic multichannel ALOHA by about 10% and about 30% for the single SU scenario and the multi-SU scenario, respectively. Furthermore, we explore the complexity of the algorithm and the influence of parameters in the DRL algorithm on the training.

A dynamic approach for selecting load balancing algorithm in cloud

The collection of interconnected computers that constitutes more than one united computing resource is known as the Cloud. In recent years, the advancement of cloud computing has facilitated the rapid arrangement of interconnected data centers that are geographically dispersed, offering high-quality and dependable services. Scalable traffic management has recently been developed in cloud data centers for traffic load balancing and quality of service provisioning. However, reducing latency during multidimensional resource allocation still remains a challenge. Hence, there is a need for efficient resource scheduling to ensure load optimization in the cloud. The objective of this work is to introduce an integrated resource scheduling and load balancing algorithm for efficient cloud service provisioning. The goal of the proposed system is to select the required load balancing algorithm to enhance resource utilization. Simulations were conducted to evaluate effectiveness using the Cloudsim simulator in cloud data centers, and the results show that the proposed method achieves better performance in terms of the average success rate, resource scheduling efficiency, and response time. The dynamic nature of cloud environments requires constant adaptation in resource allocation strategies. This necessitates the development of algorithms capable of handling diverse workloads efficiently. Additionally, the increasing complexity of applications and services hosted on the cloud demands a comprehensive approach that considers not only load balancing but also the intricacies of resource utilization. Furthermore, the proposed algorithm focuses on predictive analytics to anticipate fluctuations in demand and adjust resource allocation preemptively. By incorporating machine learning techniques, the system can adapt to changing patterns, ensuring optimal performance even in unpredictable scenarios. This holistic approach addresses the evolving challenges in cloud computing, providing a robust foundation for reliable and efficient service provisioning.

A Reverse Auction Mechanism for Time-Varying Multidimensional Resource Allocation in Vehicular Fog Computing with Cloud and Edge Collaboration

A Reverse Auction Mechanism for Time-Varying Multidimensional Resource Allocation in Vehicular Fog Computing with Cloud and Edge Collaboration

Dynamic user-centric multi-dimensional resource allocation for a wide-area coverage signaling cell based on DQN

Dynamic user-centric multi-dimensional resource allocation for a wide-area coverage signaling cell based on DQN

A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing

A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing

An Efficient Multi-Dimensional Resource Allocation Mechanism for Beam-Hopping in LEO Satellite Network

Low Earth Orbit (LEO) satellite communication networks have become an important means to provide internet access services for areas with limited infrastructure. Compared with the Geostationary Earth Orbit (GEO) satellites, the LEO satellites have limited on-board communication caching and calculating resources. Furthermore, the distribution of traffic requests is dynamically changing and uneven due to the relative movement between the LEO satellites and the ground. Therefore, how to schedule the multi-dimensional resources is an important issue for the LEO satellite communication networks. Beam-hopping is an efficient approach to improve the resource utilization by dynamically allocating time, power, and frequency according to the traffic requests. This paper proposes an efficient multi-dimensional resource allocation mechanism for beam-hopping in LEO satellite networks, which simultaneously satisfies the GEO interference avoidance. First, we construct the beam-hopping model of LEO satellites, and formulate the resource optimization problem. Second, we provide the weighted greedy strategy to determine the illumination pattern. In order to reduce the search space, the cells are clustered to non-interference clusters. Then, an improved genetic algorithm is provided to jointly allocate the communication resources. Finally, we construct various simulations to evaluate our proposed mechanism. Compared with the random-BH, polling-BH and traditional genetic algorithm, our algorithm achieves better performance in terms of both system throughput, access success rate, average delay and fairness between cells. The performance improvement is more significant in scenarios where traffic demand is unevenly distributed.

Fairness constraint efficiency optimization for multiresource allocation in a cluster system serving internet of things

SummaryMassive, diverse, and high‐frequency Internet of Things (IoT) applications pose challenges to the operation of cluster systems that serve it. Fair and efficient multidimensional resource allocation is of great significance to the sustainable operation of these systems. However, most of the existing cluster multiresource allocation optimization researches focus too much on the fairness of resource allocation and ignore the efficiency. The unbalanced use of multidimensional system resources reduces the effective utilization of system resources, which seriously affects the service quality of IoT applications. In this paper, we define the multiresource fair and efficient sharing optimization as a fairness‐constrained efficiency optimization problem, which is from dynamics, discrete resources, and heterogeneous perspectives according to the characteristics of cluster system in practical. Moreover, we present a dynamic efficiency‐aware multiresource fair allocation algorithm, DEF, which can improve the ability of the cluster system to serve diverse IoT applications. In the algorithm, large jobs schedule to the servers that expect the least remaining resources. Simulations performed using Google cluster‐usage traces show that DEF can improve system resource utilization and guarantee the fairness of sharing among users.

QoE-Driven Distributed Resource Optimization for Mixed Reality in Dynamic TDD Systems

With the full development of intelligent mobile communications, wireless mixed reality (MR) provides a more visually immersive experience and stronger interaction with environments than virtual reality (VR) and augmented reality (AR). However, the asymmetric characteristic of wireless MR traffic creates a huge challenge to current mobile networks. Dynamic time division duplex (D-TDD) is considered as a promising technology to improve wireless MR users’ quality of experience (QoE) due to its potentials and advantages in delivering asymmetric traffic. Therefore, in this paper, we propose a QoE-driven distributed multidimensional resource allocation (MRA) supplemented by inter-cell interference (ICI) mitigation scheme for wireless MR in multi-cell D-TDD systems. First, to improve QoE of MR users, we formulate the joint optimization of subframe configuration, channel assignment and computation offloading as a mixed-integer nonlinear programming problem. A novel fully-decentralized multi-agent deep Q-network (DQN) algorithm is developed to solve the problem. Then, to mitigate ICI, a water filling based power control algorithm is investigated to minimize the total power of each small base station and its associated MR users. Simulation results demonstrate that our proposed scheme improves QoE of MR users in a realizable way as compared to existing schemes.

Cloud-Edge-End Collaboration in Air–Ground Integrated Power IoT: A Semidistributed Learning Approach

The combination of air–ground integrated power Internet of Things (AGI-PIoT) and cloud-edge-end collaboration enables flexible coverage and real-time data processing. However, how to achieve intelligent cloud-edge-end collaboration in AGI-PIoT faces several challenges such as dynamics of aerial networks, coupling of resource allocation in multiple layers, timescales, and dimensions, incomplete information, and dimensionality curse. In this article, we propose a FEderated Deep rEinforcement leaRning-based multi-lAyer multi-Timescale multi-dImensional resOurce allocatioN algorithm (FEDERATION). The multilayer multitimescale multidimensional resource allocation problem is decomposed into three subproblems based on Lyapunov optimization. For the subproblem of joint task offloading and power control, a federated deep actor-critic-based semidistributed algorithm is developed. The subproblem of admission control is solved by quadratic programming. The third subproblem is addressed through smooth approximation and Lagrange dual decomposition. Simulation results indicate that FEDERATION outperforms existing algorithms in queuing delay, energy consumption, and convergence.

Opportunistic admission and resource allocation for slicing enhanced IoT networks

Network slicing is envisioned as one of the key techniques to meet the extremely diversified service requirements of the Internet of Things (IoT) as it provides an enhanced user experience and elastic resource configuration. In the context of slicing enhanced IoT networks, both the Service Provider (SP) and Infrastructure Provider (InP) face challenges of ensuring efficient slice construction and high profit in dynamic environments. These challenges arise from randomly generated and departed slice requests from end-users, uncertain resource availability, and multi-dimensional resource allocation. Admission and resource allocation for distinct demands of slice requests are the key issues in addressing these challenges and should be handled effectively in dynamic environments. To this end, we propose an Opportunistic Admission and Resource allocation (OAR) policy to deal with the issues of random slicing requests, uncertain resource availability, and heterogeneous multi-resources. The key idea of OAR is to allow the SP to decide whether to accept slice requests immediately or defer them according to the load and price of resources. To cope with the random slice requests and uncertain resource availability, we formulated this issue as a Markov Decision Process (MDP) to obtain the optimal admission policy, with the aim of maximizing the system reward. Furthermore, the buyer-seller game theory approach was adopted to realize the optimal resource allocation, while motivating each SP and InP to maximize their rewards. Our numerical results show that the proposed OAR policy can make reasonable decisions effectively and steadily, and outperforms the baseline schemes in terms of the system reward.