Multi Agent DeepRL based Joint Power and Subchannel Allocation in IAB
networks
- URL: http://arxiv.org/abs/2309.00144v1
- Date: Thu, 31 Aug 2023 21:30:25 GMT
- Title: Multi Agent DeepRL based Joint Power and Subchannel Allocation in IAB
networks
- Authors: Lakshya Jagadish, Banashree Sarma, R. Manivasakan
- Abstract summary: Integrated Access and Backhauling (IRL) is a viable approach for meeting the unprecedented need for higher data rates of future generations.
In this paper, we show how we can use Deep Q-Learning Network to handle problems with huge action spaces associated with fractional nodes.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Integrated Access and Backhauling (IAB) is a viable approach for meeting the
unprecedented need for higher data rates of future generations, acting as a
cost-effective alternative to dense fiber-wired links. The design of such
networks with constraints usually results in an optimization problem of
non-convex and combinatorial nature. Under those situations, it is challenging
to obtain an optimal strategy for the joint Subchannel Allocation and Power
Allocation (SAPA) problem. In this paper, we develop a multi-agent Deep
Reinforcement Learning (DeepRL) based framework for joint optimization of power
and subchannel allocation in an IAB network to maximize the downlink data rate.
SAPA using DDQN (Double Deep Q-Learning Network) can handle computationally
expensive problems with huge action spaces associated with multiple users and
nodes. Unlike the conventional methods such as game theory, fractional
programming, and convex optimization, which in practice demand more and more
accurate network information, the multi-agent DeepRL approach requires less
environment network information. Simulation results show the proposed scheme's
promising performance when compared with baseline (Deep Q-Learning Network and
Random) schemes.
Related papers
- Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems [10.434368470402935]
optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime.
This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems.
arXiv Detail & Related papers (2025-01-17T15:10:22Z) - GDSG: Graph Diffusion-based Solution Generator for Optimization Problems in MEC Networks [109.17835015018532]
We present a Graph Diffusion-based Solution Generation (GDSG) method.
This approach is designed to work with suboptimal datasets while converging to the optimal solution large probably.
We build GDSG as a multi-task diffusion model utilizing a Graph Neural Network (GNN) to acquire the distribution of high-quality solutions.
arXiv Detail & Related papers (2024-12-11T11:13:43Z) - DiffSG: A Generative Solver for Network Optimization with Diffusion Model [75.27274046562806]
Diffusion generative models can consider a broader range of solutions and exhibit stronger generalization by learning parameters.
We propose a new framework, which leverages intrinsic distribution learning of diffusion generative models to learn high-quality solutions.
arXiv Detail & Related papers (2024-08-13T07:56:21Z) - Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning [69.00997996453842]
We propose a deep Reinforcement Learning approach to learn a joint Admission Control and Resource Allocation policy for virtual network embedding.
We show that HRL-ACRA outperforms state-of-the-art baselines in terms of both the acceptance ratio and long-term average revenue.
arXiv Detail & Related papers (2024-06-25T07:42:30Z) - Learning RL-Policies for Joint Beamforming Without Exploration: A Batch
Constrained Off-Policy Approach [1.0080317855851213]
We consider the problem of network parameter cancellation optimization for networks.
We show that deploying an algorithm in the real world for exploration and learning can be achieved with the data without exploring.
arXiv Detail & Related papers (2023-10-12T18:36:36Z) - Federated Multi-Level Optimization over Decentralized Networks [55.776919718214224]
We study the problem of distributed multi-level optimization over a network, where agents can only communicate with their immediate neighbors.
We propose a novel gossip-based distributed multi-level optimization algorithm that enables networked agents to solve optimization problems at different levels in a single timescale.
Our algorithm achieves optimal sample complexity, scaling linearly with the network size, and demonstrates state-of-the-art performance on various applications.
arXiv Detail & Related papers (2023-10-10T00:21:10Z) - Hierarchical Multi-Marginal Optimal Transport for Network Alignment [52.206006379563306]
Multi-network alignment is an essential prerequisite for joint learning on multiple networks.
We propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment.
Our proposed HOT achieves significant improvements over the state-of-the-art in both effectiveness and scalability.
arXiv Detail & Related papers (2023-10-06T02:35:35Z) - A Reinforcement Learning Approach to Optimize Available Network
Bandwidth Utilization [3.254879465902239]
We present a novel approach to finding the optimum number of parallel TCP streams using deep reinforcement learning (RL)
Our RL-based algorithm can find near-optimal solutions 40% faster while achieving up to 15% higher throughput.
arXiv Detail & Related papers (2022-11-22T02:00:05Z) - A Heuristically Assisted Deep Reinforcement Learning Approach for
Network Slice Placement [0.7885276250519428]
We introduce a hybrid placement solution based on Deep Reinforcement Learning (DRL) and a dedicated optimization based on the Power of Two Choices principle.
The proposed Heuristically-Assisted DRL (HA-DRL) allows to accelerate the learning process and gain in resource usage when compared against other state-of-the-art approaches.
arXiv Detail & Related papers (2021-05-14T10:04:17Z) - Data-Driven Random Access Optimization in Multi-Cell IoT Networks with
NOMA [78.60275748518589]
Non-orthogonal multiple access (NOMA) is a key technology to enable massive machine type communications (mMTC) in 5G networks and beyond.
In this paper, NOMA is applied to improve the random access efficiency in high-density spatially-distributed multi-cell wireless IoT networks.
A novel formulation of random channel access management is proposed, in which the transmission probability of each IoT device is tuned to maximize the geometric mean of users' expected capacity.
arXiv Detail & Related papers (2021-01-02T15:21:08Z) - DeepSlicing: Deep Reinforcement Learning Assisted Resource Allocation
for Network Slicing [20.723527476555574]
Network slicing enables multiple virtual networks run on the same physical infrastructure to support various use cases in 5G and beyond.
These use cases have very diverse network resource demands, e.g., communication and computation, and various performance metrics such as latency and throughput.
We propose DeepSlicing that integrates the alternating direction method of multipliers (ADMM) and deep reinforcement learning (DRL)
arXiv Detail & Related papers (2020-08-17T20:52:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.