Coalition Formation-Based Sub-Channel Allocation in Full-Duplex-Enabled mmWave IABN With D2D

IF 3 3区计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

IEEE/ACM Transactions on Networking Pub Date : 2024-07-09 DOI:10.1109/TNET.2024.3423775

Zhongyu Ma;Yajing Wang;Zijun Wang;Guangjie Han;Zhanjun Hao;Qun Guo

{"title":"Coalition Formation-Based Sub-Channel Allocation in Full-Duplex-Enabled mmWave IABN With D2D","authors":"Zhongyu Ma;Yajing Wang;Zijun Wang;Guangjie Han;Zhanjun Hao;Qun Guo","doi":"10.1109/TNET.2024.3423775","DOIUrl":null,"url":null,"abstract":"One of the key techniques for future wireless network is full-duplex-enabled millimeter wave integrated access and backhaul network underlaying device-to-device communication, which is a 3GPP-inspired comprehensive paradigm for higher spectral efficiency and lower latency. However, the multi-user interference (MUI) and residual self-interference (RSI) become the major bottleneck before the commercial application of the system. To this end, we investigate the sub-channel allocation problem for this networking paradigm. To maximize the overall achievable rate under the considerations of MUI and RSI, the sub-channel allocation problem is firstly formulated as an integer nonlinear programming problem, which is intractable to search an optimal solution in polynomial time. Secondly, a coalition formation based sub-channel allocation (CFSA) algorithm is proposed, where the final partition of the sub-channel coalition is iteratively formed by the concurrent link players according to the two defined switching criterions. Thirdly, the properties of the proposed CFSA algorithm are analyzed from the perspectives of Nash stability and uniform convergence. Fourthly, the proposed CFSA algorithm is compared with other reference algorithms through abundant simulations, and superiorities including effectiveness, convergence and sub-optimality of the proposed CFSA algorithm are demonstrated through the kernel indicators.","PeriodicalId":13443,"journal":{"name":"IEEE/ACM Transactions on Networking","volume":"32 5","pages":"4503-4518"},"PeriodicalIF":3.0000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/ACM Transactions on Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10591725/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

Abstract

One of the key techniques for future wireless network is full-duplex-enabled millimeter wave integrated access and backhaul network underlaying device-to-device communication, which is a 3GPP-inspired comprehensive paradigm for higher spectral efficiency and lower latency. However, the multi-user interference (MUI) and residual self-interference (RSI) become the major bottleneck before the commercial application of the system. To this end, we investigate the sub-channel allocation problem for this networking paradigm. To maximize the overall achievable rate under the considerations of MUI and RSI, the sub-channel allocation problem is firstly formulated as an integer nonlinear programming problem, which is intractable to search an optimal solution in polynomial time. Secondly, a coalition formation based sub-channel allocation (CFSA) algorithm is proposed, where the final partition of the sub-channel coalition is iteratively formed by the concurrent link players according to the two defined switching criterions. Thirdly, the properties of the proposed CFSA algorithm are analyzed from the perspectives of Nash stability and uniform convergence. Fourthly, the proposed CFSA algorithm is compared with other reference algorithms through abundant simulations, and superiorities including effectiveness, convergence and sub-optimality of the proposed CFSA algorithm are demonstrated through the kernel indicators.

查看原文本刊更多论文

支持 D2D 的全双工毫米波 IABN 中基于联盟形成的子信道分配

未来无线网络的关键技术之一是全双工毫米波集成接入和回程网络，下层是设备到设备通信，这是一种受 3GPP 启发的综合范例，可实现更高的频谱效率和更低的延迟。然而，多用户干扰（MUI）和残余自干扰（RSI）成为该系统商业应用前的主要瓶颈。为此，我们研究了这种网络范例的子信道分配问题。为了在考虑 MUI 和 RSI 的情况下最大化总体可实现速率，首先将子信道分配问题表述为整数非线性编程问题，该问题难以在多项式时间内找到最优解。其次，提出了一种基于联盟形成的子信道分配（CFSA）算法，由并发链路参与者根据两个定义的切换标准迭代形成子信道联盟的最终分区。第三，从纳什稳定性和均匀收敛性角度分析了所提 CFSA 算法的特性。第四，通过大量仿真将所提出的CFSA算法与其他参考算法进行比较，通过内核指标证明了所提出的CFSA算法的有效性、收敛性和次优性等优越性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE/ACM Transactions on Networking 工程技术-电信学

CiteScore

8.20

自引率

5.40%

发文量

246

审稿时长

4-8 weeks

期刊介绍： The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking, covering all sorts of information transport networks over all sorts of physical layer technologies, both wireline (all kinds of guided media: e.g., copper, optical) and wireless (e.g., radio-frequency, acoustic (e.g., underwater), infra-red), or hybrids of these. The journal welcomes applied contributions reporting on novel experiences and experiments with actual systems.