Research Article
Distributed Joint Channel Assignment and Power Control for Sum Rate Maximization of D2D-Enabled Massive MIMO System
@ARTICLE{10.4108/eetmca.v7i3.2028, author={Abi Abate Dejen and Anna F\o{}rster and Yihenew Wondie }, title={Distributed Joint Channel Assignment and Power Control for Sum Rate Maximization of D2D-Enabled Massive MIMO System}, journal={EAI Endorsed Transactions on Mobile Communications and Applications}, volume={7}, number={3}, publisher={EAI}, journal_a={MCA}, year={2023}, month={1}, keywords={Device-to-Device (D2D), massive MIMO communication, interference management, channel assignment, power control}, doi={10.4108/eetmca.v7i3.2028} }
- Abi Abate Dejen
Anna Förster
Yihenew Wondie
Year: 2023
Distributed Joint Channel Assignment and Power Control for Sum Rate Maximization of D2D-Enabled Massive MIMO System
MCA
EAI
DOI: 10.4108/eetmca.v7i3.2028
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.
Copyright © 2022 Abi A. Dejen et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.