The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
L’ultra-densification du réseau d’accès radio (RAN) est essentielle pour gérer efficacement le trafic de données mobiles en constante augmentation. Dans cet article, un regroupement et une planification d'utilisateurs multicouches conjoints sont proposés en tant que schéma de coordination des interférences inter-clusters pour le RAN ultra-dense utilisant la transmission/réception MIMO distribuée par cluster. Le regroupement et la planification d'utilisateurs multicouches conjoints proposés consistent en un regroupement d'utilisateurs à l'aide de l'algorithme K-means, d'une superposition de clusters d'utilisateurs (appelée multicouche) basée sur la distance de décalage d'interférence (IOD), d'une association cluster-antenne sur chaque couche. et une planification de type round-robin par couche. La capacité utilisateur, la capacité totale et l'équité sont évaluées par des simulations informatiques pour montrer l'efficacité du regroupement et de la planification d'utilisateurs multicouches conjoints proposés. Sont également présentés des comparaisons de capacité de liaison montante et descendante et le réglage optimal de l'IOD en tenant compte du compromis entre l'atténuation des interférences inter-clusters et l'opportunité de transmission.
Ryo TAKAHASHI
Tohoku University
Hidenori MATSUO
Tohoku University
Fumiyuki ADACHI
Tohoku University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Ryo TAKAHASHI, Hidenori MATSUO, Fumiyuki ADACHI, "Joint Multi-Layered User Clustering and Scheduling for Ultra-Dense RAN Using Distributed MIMO" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 9, pp. 1097-1109, September 2021, doi: 10.1587/transcom.2020FGP0010.
Abstract: Ultra-densification of radio access network (RAN) is essential to efficiently handle the ever-increasing mobile data traffic. In this paper, a joint multi-layered user clustering and scheduling is proposed as an inter-cluster interference coordination scheme for ultra-dense RAN using cluster-wise distributed MIMO transmission/reception. The proposed joint multi-layered user clustering and scheduling consists of user clustering using the K-means algorithm, user-cluster layering (called multi-layering) based on the interference-offset-distance (IOD), cluster-antenna association on each layer, and layer-wise round-robin-type scheduling. The user capacity, the sum capacity, and the fairness are evaluated by computer simulations to show the effectiveness of the proposed joint multi-layered user clustering and scheduling. Also shown are uplink and downlink capacity comparisons and optimal IOD setting considering the trade-off between inter-cluster interference mitigation and transmission opportunity.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2020FGP0010/_p
Copier
@ARTICLE{e104-b_9_1097,
author={Ryo TAKAHASHI, Hidenori MATSUO, Fumiyuki ADACHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Joint Multi-Layered User Clustering and Scheduling for Ultra-Dense RAN Using Distributed MIMO},
year={2021},
volume={E104-B},
number={9},
pages={1097-1109},
abstract={Ultra-densification of radio access network (RAN) is essential to efficiently handle the ever-increasing mobile data traffic. In this paper, a joint multi-layered user clustering and scheduling is proposed as an inter-cluster interference coordination scheme for ultra-dense RAN using cluster-wise distributed MIMO transmission/reception. The proposed joint multi-layered user clustering and scheduling consists of user clustering using the K-means algorithm, user-cluster layering (called multi-layering) based on the interference-offset-distance (IOD), cluster-antenna association on each layer, and layer-wise round-robin-type scheduling. The user capacity, the sum capacity, and the fairness are evaluated by computer simulations to show the effectiveness of the proposed joint multi-layered user clustering and scheduling. Also shown are uplink and downlink capacity comparisons and optimal IOD setting considering the trade-off between inter-cluster interference mitigation and transmission opportunity.},
keywords={},
doi={10.1587/transcom.2020FGP0010},
ISSN={1745-1345},
month={September},}
Copier
TY - JOUR
TI - Joint Multi-Layered User Clustering and Scheduling for Ultra-Dense RAN Using Distributed MIMO
T2 - IEICE TRANSACTIONS on Communications
SP - 1097
EP - 1109
AU - Ryo TAKAHASHI
AU - Hidenori MATSUO
AU - Fumiyuki ADACHI
PY - 2021
DO - 10.1587/transcom.2020FGP0010
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2021
AB - Ultra-densification of radio access network (RAN) is essential to efficiently handle the ever-increasing mobile data traffic. In this paper, a joint multi-layered user clustering and scheduling is proposed as an inter-cluster interference coordination scheme for ultra-dense RAN using cluster-wise distributed MIMO transmission/reception. The proposed joint multi-layered user clustering and scheduling consists of user clustering using the K-means algorithm, user-cluster layering (called multi-layering) based on the interference-offset-distance (IOD), cluster-antenna association on each layer, and layer-wise round-robin-type scheduling. The user capacity, the sum capacity, and the fairness are evaluated by computer simulations to show the effectiveness of the proposed joint multi-layered user clustering and scheduling. Also shown are uplink and downlink capacity comparisons and optimal IOD setting considering the trade-off between inter-cluster interference mitigation and transmission opportunity.
ER -