多跳综合接入回程(IAB)网络的联合关联与资源分配

IF 2.9 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Byungju Lim;Ju-Hyung Lee;Jae-Hong Kwon;Ki-Hun Kim;Jong-Man Lee;Hyun Park;Young-Seok Ha;Young-Jin Han;Young-Chai Ko
{"title":"多跳综合接入回程(IAB)网络的联合关联与资源分配","authors":"Byungju Lim;Ju-Hyung Lee;Jae-Hong Kwon;Ki-Hun Kim;Jong-Man Lee;Hyun Park;Young-Seok Ha;Young-Jin Han;Young-Chai Ko","doi":"10.23919/JCN.2022.000041","DOIUrl":null,"url":null,"abstract":"Integrated access and backhaul (IAB) network is envisioned as a novel network architecture for increasing the network capacity and coverage. To facilitate the IAB network, the appropriate methods of wireless link association and resource management are required. In this paper, we investigate the joint optimization problem of association and resource allocation in terms of subchannel and power for IAB network. In particular, we handle the association and resource allocation problems for wireless backhaul and access links considering multi-hop backhauling. Since the optimization problem for IAB network is formulated as a mixed integer non-linear programming (MINLP), we divide it into three subproblems for association, subchannel allocation, and power allocation, respectively, and these subproblems are solved alternatively to obtain a local optimal solution. For the association problem, we adopt the Lagrangian duality approach to configure the backhaul and access links and successive convex approximation (SCA) approach is used to solve the subchannel and power allocation problems efficiently. Simulation results demonstrate that the proposed algorithm achieves better performance than single-hop (SH) backhauling based network and enhances the capacity and coverage by configuring the multi-hop (MH) backhauling.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"440-455"},"PeriodicalIF":2.9000,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10190213.pdf","citationCount":"2","resultStr":"{\"title\":\"Joint association and resource allocation for multi-hop integrated access and backhaul (IAB) network\",\"authors\":\"Byungju Lim;Ju-Hyung Lee;Jae-Hong Kwon;Ki-Hun Kim;Jong-Man Lee;Hyun Park;Young-Seok Ha;Young-Jin Han;Young-Chai Ko\",\"doi\":\"10.23919/JCN.2022.000041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Integrated access and backhaul (IAB) network is envisioned as a novel network architecture for increasing the network capacity and coverage. To facilitate the IAB network, the appropriate methods of wireless link association and resource management are required. In this paper, we investigate the joint optimization problem of association and resource allocation in terms of subchannel and power for IAB network. In particular, we handle the association and resource allocation problems for wireless backhaul and access links considering multi-hop backhauling. Since the optimization problem for IAB network is formulated as a mixed integer non-linear programming (MINLP), we divide it into three subproblems for association, subchannel allocation, and power allocation, respectively, and these subproblems are solved alternatively to obtain a local optimal solution. For the association problem, we adopt the Lagrangian duality approach to configure the backhaul and access links and successive convex approximation (SCA) approach is used to solve the subchannel and power allocation problems efficiently. Simulation results demonstrate that the proposed algorithm achieves better performance than single-hop (SH) backhauling based network and enhances the capacity and coverage by configuring the multi-hop (MH) backhauling.\",\"PeriodicalId\":54864,\"journal\":{\"name\":\"Journal of Communications and Networks\",\"volume\":\"25 4\",\"pages\":\"440-455\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2023-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/iel7/5449605/10251734/10190213.pdf\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Communications and Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10190213/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10190213/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 2

摘要

集成接入和回程(IAB)网络被设想为一种用于增加网络容量和覆盖范围的新型网络架构。为了促进IAB网络,需要适当的无线链路关联和资源管理方法。在本文中,我们从子信道和功率的角度研究了IAB网络的关联和资源分配的联合优化问题。特别地,我们处理考虑多跳回程的无线回程和接入链路的关联和资源分配问题。由于IAB网络的优化问题被公式化为混合整数非线性规划(MINLP),我们将其分为三个子问题,分别用于关联、子信道分配和功率分配,并交替求解这些子问题以获得局部最优解。对于关联问题,我们采用拉格朗日对偶方法来配置回程和接入链路,并使用逐次凸近似(SCA)方法来有效地解决子信道和功率分配问题。仿真结果表明,该算法比基于单跳(SH)回程的网络具有更好的性能,并通过配置多跳(MH)回程来提高容量和覆盖率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint association and resource allocation for multi-hop integrated access and backhaul (IAB) network
Integrated access and backhaul (IAB) network is envisioned as a novel network architecture for increasing the network capacity and coverage. To facilitate the IAB network, the appropriate methods of wireless link association and resource management are required. In this paper, we investigate the joint optimization problem of association and resource allocation in terms of subchannel and power for IAB network. In particular, we handle the association and resource allocation problems for wireless backhaul and access links considering multi-hop backhauling. Since the optimization problem for IAB network is formulated as a mixed integer non-linear programming (MINLP), we divide it into three subproblems for association, subchannel allocation, and power allocation, respectively, and these subproblems are solved alternatively to obtain a local optimal solution. For the association problem, we adopt the Lagrangian duality approach to configure the backhaul and access links and successive convex approximation (SCA) approach is used to solve the subchannel and power allocation problems efficiently. Simulation results demonstrate that the proposed algorithm achieves better performance than single-hop (SH) backhauling based network and enhances the capacity and coverage by configuring the multi-hop (MH) backhauling.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.60
自引率
5.60%
发文量
66
审稿时长
14.4 months
期刊介绍: The JOURNAL OF COMMUNICATIONS AND NETWORKS is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks. Theoretical research contributions presenting new techniques, concepts, or analyses, applied contributions reporting on experiences and experiments, and tutorial expositions of permanent reference value are welcome. The subjects covered by this journal include all topics in communication theory and techniques, communication systems, and information networks. COMMUNICATION THEORY AND SYSTEMS WIRELESS COMMUNICATIONS NETWORKS AND SERVICES.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信