Distributed Joint Channel Assignment and Power Control for Sum Rate Maximization of D2D-Enabled Massive MIMO System

A. Dejen, Anna Förster, Y. Wondie
{"title":"Distributed Joint Channel Assignment and Power Control for Sum Rate Maximization of D2D-Enabled Massive MIMO System","authors":"A. Dejen, Anna Förster, Y. Wondie","doi":"10.4108/eetmca.v7i3.2028","DOIUrl":null,"url":null,"abstract":"Device-to-device (D2D) communications underlaid massive multiple-input multiple-output (MIMO) systems have been recognized as a promising candidate technology to achieve the challenging fifth-generation (5G) network requirements. This integration enhances network throughput, improves spectral efficiency, and offloads the traffic load of base stations. However, the co/cross-tier interferences between cellular and D2D communications caused by resource sharing is a significant challenge, especially when dense D2D users exist in an underlay mode. In this paper, we jointly optimize the channel assignment and power allocation to maximize the sum data rate while maintaining the interference constraints of cellular links. Due to the lack of network-wide information in large scale networks, resource management and interference coordination is hard to be implemented in a centralized way. Therefore, we propose a three-stage stable and distributed resource allocation and interference management scheme based on local information and requires little coordination and communication between devices. We model the channel allocation optimization problem in the first stage as a many-to-one matching game. In the second stage, the algorithm adopts a cost charging policy to solve each user’s power control problem as a non-cooperative game. In the third stage, the algorithm search for swap blocking pairs until stable matching exist. It is shown in this paper that the proposed algorithm converges to a stable matching and terminates after finite iterations. Simulation results show that the proposed algorithm can achieve more than 86% of the average transmission rate performance of the optimal matching with lower complexity.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"414 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EAI Endorsed Trans. Mob. Commun. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/eetmca.v7i3.2028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Device-to-device (D2D) communications underlaid massive multiple-input multiple-output (MIMO) systems have been recognized as a promising candidate technology to achieve the challenging fifth-generation (5G) network requirements. This integration enhances network throughput, improves spectral efficiency, and offloads the traffic load of base stations. However, the co/cross-tier interferences between cellular and D2D communications caused by resource sharing is a significant challenge, especially when dense D2D users exist in an underlay mode. In this paper, we jointly optimize the channel assignment and power allocation to maximize the sum data rate while maintaining the interference constraints of cellular links. Due to the lack of network-wide information in large scale networks, resource management and interference coordination is hard to be implemented in a centralized way. Therefore, we propose a three-stage stable and distributed resource allocation and interference management scheme based on local information and requires little coordination and communication between devices. We model the channel allocation optimization problem in the first stage as a many-to-one matching game. In the second stage, the algorithm adopts a cost charging policy to solve each user’s power control problem as a non-cooperative game. In the third stage, the algorithm search for swap blocking pairs until stable matching exist. It is shown in this paper that the proposed algorithm converges to a stable matching and terminates after finite iterations. Simulation results show that the proposed algorithm can achieve more than 86% of the average transmission rate performance of the optimal matching with lower complexity.
基于d2d的大规模MIMO系统的分布式联合信道分配与功率控制
基于大规模多输入多输出(MIMO)系统的设备对设备(D2D)通信已被认为是实现具有挑战性的第五代(5G)网络要求的有前途的候选技术。这种融合不仅提高了网络吞吐量,提高了频谱效率,还减轻了基站的业务负担。然而,由资源共享引起的蜂窝和D2D通信之间的co/跨层干扰是一个重大挑战,特别是当密集的D2D用户以底层模式存在时。在本文中,我们共同优化信道分配和功率分配,以最大限度地提高总数据速率,同时保持蜂窝链路的干扰约束。在大规模网络中,由于缺乏全网信息,资源管理和干扰协调难以集中实施。因此,我们提出了一种基于本地信息的三阶段稳定分布式资源分配和干扰管理方案,该方案不需要设备之间的协调和通信。我们将第一阶段的信道分配优化问题建模为一个多对一的匹配博弈。在第二阶段,算法采用成本收费策略将每个用户的功率控制问题作为非合作博弈来解决。在第三阶段,算法搜索交换块对,直到存在稳定匹配。结果表明,该算法收敛于稳定匹配,并在有限次迭代后终止。仿真结果表明,该算法能够以较低的复杂度达到最优匹配平均传输速率的86%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信