Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:2309.00144

Help | Advanced Search

Electrical Engineering and Systems Science > Systems and Control

arXiv:2309.00144 (eess)
[Submitted on 31 Aug 2023 ]

Title: Multi Agent DeepRL based Joint Power and Subchannel Allocation in IAB networks

Title: 基于多智能体深度强化学习的IAB网络联合功率和子信道分配

Authors:Lakshya Jagadish, Banashree Sarma, R. Manivasakan
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.
Abstract: 集成接入和回传(IAB)是一种可行的方法,用于满足未来一代对更高数据速率的前所未有的需求,作为密集光纤有线链路的成本效益替代方案。 在约束条件下设计此类网络通常会导致非凸和组合性质的优化问题。 在这些情况下,获得联合子信道分配和功率分配(SAPA)问题的最优策略具有挑战性。 在本文中,我们开发了一个基于多智能体深度强化学习(DeepRL)的框架,用于IAB网络中功率和子信道分配的联合优化,以最大化下行数据速率。 使用DDQN(双深度Q学习网络)的SAPA可以处理与多个用户和节点相关的计算成本高昂、动作空间庞大的问题。 与传统方法如博弈论、分数规划和凸优化不同,这些方法在实践中需要越来越多的准确网络信息,而多智能体DeepRL方法所需的环境网络信息较少。 仿真结果表明,与基线(深度Q学习网络和随机)方案相比,所提出的方案表现出良好的性能。
Comments: 7 pages, 6 figures, Accepted at the European Conference on Communication Systems (ECCS) 2023
Subjects: Systems and Control (eess.SY) ; Machine Learning (cs.LG)
Cite as: arXiv:2309.00144 [eess.SY]
  (or arXiv:2309.00144v1 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.2309.00144
arXiv-issued DOI via DataCite

Submission history

From: Lakshya Jagadish [view email]
[v1] Thu, 31 Aug 2023 21:30:25 UTC (739 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
eess.SY
< prev   |   next >
new | recent | 2023-09
Change to browse by:
cs
cs.LG
cs.SY
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号