Joint User Association and Resource Allocation for Multi-Stream Carrier Aggregation and Coordinated Multi-Point Enabled MIMO Networks

In this letter, we consider a multi-stream carrier aggregation and coordinated multi-point enabled multi-input multi-output network, where each user can simultaneously associate with multiple base stations and aggregate multiple component carriers (CCs) to achieve wideband data transmission with a high signal-to-interference-plus-noise ratio. To maximize the downlink system throughput, the user association, frequency resource allocation including both CC and resource block (RB) assignment, and power control are jointly optimized under the constraints of the maximum CC and RB aggregation capabilities and the minimum rate requirement for each user. To solve the formulated problem, we propose a particle swarm optimization based hierarchical matching game algorithm. Specifically, a hierarchical matching game with externalities is established to determine the joint user association and frequency resource allocation. Moreover, the particle swarm optimization algorithm is employed to optimize the power control under the determined joint user association and frequency resource allocation strategy. We further prove the stability of the proposed hierarchical matching game. Simulation results are provided to demonstrate the superiority of the proposed scheme.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2025-04-18
DOI
https://doi.org/10.1109/lwc.2025.3562212
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint User Association and Resource Allocation for Multi-Stream Carrier Aggregation and Coordinated Multi-Point Enabled MIMO Networks

Xiao Tang, Peixuan Li, Yichen Wang
IEEE Wireless Communications Letters
Advanced MIMO Systems Optimization
article

Joint User Association and Resource Allocation for Multi-Stream Carrier Aggregation and Coordinated Multi-Point Enabled MIMO Networks

Xiao Tang, Peixuan Li, Yichen Wang
article en

Abstract

In this letter, we consider a multi-stream carrier aggregation and coordinated multi-point enabled multi-input multi-output network, where each user can simultaneously associate with multiple base stations and aggregate multiple component carriers (CCs) to achieve wideband data transmission with a high signal-to-interference-plus-noise ratio. To maximize the downlink system throughput, the user association, frequency resource allocation including both CC and resource block (RB) assignment, and power control are jointly optimized under the constraints of the maximum CC and RB aggregation capabilities and the minimum rate requirement for each user. To solve the formulated problem, we propose a particle swarm optimization based hierarchical matching game algorithm. Specifically, a hierarchical matching game with externalities is established to determine the joint user association and frequency resource allocation. Moreover, the particle swarm optimization algorithm is employed to optimize the power control under the determined joint user association and frequency resource allocation strategy. We further prove the stability of the proposed hierarchical matching game. Simulation results are provided to demonstrate the superiority of the proposed scheme.

IEEE Wireless Communications LettersVol. 14(7)
Xi'an Jiaotong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 94%
Advanced MIMO Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.