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}
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.
期刊介绍:
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.