Low Complexity Centralized Scheduling Scheme for Downlink CoMP
Summary :
Coordinated multi-point (CoMP) transmission and reception is a promising technique for interference mitigation in cellular systems. The scheduling algorithm for CoMP has a significant impact on the network processing complexity and performance. Performing exhaustive search permits centralized scheduling and thus the optimal global solution; however, it incurs a high level of computational complexity and may be impractical or lead to high cost as well as network instability. In order to provide a more realistic scheduling method while balancing performance and complexity, we propose a low complexity centralized scheduling scheme that adaptively selects users for single-cell transmission or different CoMP scheme transmission to maximize the system weighted sum capacity. We evaluate the computational complexity and system-level simulation performance in this paper. Compared to the optimal scheduling method with exhaustive search, the proposed scheme has a much lower complexity level and achieves near optimal performance.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E98-B No.5 pp.940-948
- Publication Date
- 2015/05/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E98.B.940
- Type of Manuscript
- PAPER
- Category
- Wireless Communication Technologies
Authors
Jing WANG
DOCOMO Beijing Communications Laboratories Co., Ltd.
Satoshi NAGATA
NTT DOCOMO, INC.
Lan CHEN
NTT DOCOMO, INC.
Huiling JIANG
DOCOMO Beijing Communications Laboratories Co., Ltd.
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Jing WANG, Satoshi NAGATA, Lan CHEN, Huiling JIANG, "Low Complexity Centralized Scheduling Scheme for Downlink CoMP" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 5, pp. 940-948, May 2015, doi: 10.1587/transcom.E98.B.940.
Abstract: Coordinated multi-point (CoMP) transmission and reception is a promising technique for interference mitigation in cellular systems. The scheduling algorithm for CoMP has a significant impact on the network processing complexity and performance. Performing exhaustive search permits centralized scheduling and thus the optimal global solution; however, it incurs a high level of computational complexity and may be impractical or lead to high cost as well as network instability. In order to provide a more realistic scheduling method while balancing performance and complexity, we propose a low complexity centralized scheduling scheme that adaptively selects users for single-cell transmission or different CoMP scheme transmission to maximize the system weighted sum capacity. We evaluate the computational complexity and system-level simulation performance in this paper. Compared to the optimal scheduling method with exhaustive search, the proposed scheme has a much lower complexity level and achieves near optimal performance.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.940/_p
Copy
@ARTICLE{e98-b_5_940,
author={Jing WANG, Satoshi NAGATA, Lan CHEN, Huiling JIANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Complexity Centralized Scheduling Scheme for Downlink CoMP},
year={2015},
volume={E98-B},
number={5},
pages={940-948},
abstract={Coordinated multi-point (CoMP) transmission and reception is a promising technique for interference mitigation in cellular systems. The scheduling algorithm for CoMP has a significant impact on the network processing complexity and performance. Performing exhaustive search permits centralized scheduling and thus the optimal global solution; however, it incurs a high level of computational complexity and may be impractical or lead to high cost as well as network instability. In order to provide a more realistic scheduling method while balancing performance and complexity, we propose a low complexity centralized scheduling scheme that adaptively selects users for single-cell transmission or different CoMP scheme transmission to maximize the system weighted sum capacity. We evaluate the computational complexity and system-level simulation performance in this paper. Compared to the optimal scheduling method with exhaustive search, the proposed scheme has a much lower complexity level and achieves near optimal performance.},
keywords={},
doi={10.1587/transcom.E98.B.940},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Low Complexity Centralized Scheduling Scheme for Downlink CoMP
T2 - IEICE TRANSACTIONS on Communications
SP - 940
EP - 948
AU - Jing WANG
AU - Satoshi NAGATA
AU - Lan CHEN
AU - Huiling JIANG
PY - 2015
DO - 10.1587/transcom.E98.B.940
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2015
AB - Coordinated multi-point (CoMP) transmission and reception is a promising technique for interference mitigation in cellular systems. The scheduling algorithm for CoMP has a significant impact on the network processing complexity and performance. Performing exhaustive search permits centralized scheduling and thus the optimal global solution; however, it incurs a high level of computational complexity and may be impractical or lead to high cost as well as network instability. In order to provide a more realistic scheduling method while balancing performance and complexity, we propose a low complexity centralized scheduling scheme that adaptively selects users for single-cell transmission or different CoMP scheme transmission to maximize the system weighted sum capacity. We evaluate the computational complexity and system-level simulation performance in this paper. Compared to the optimal scheduling method with exhaustive search, the proposed scheme has a much lower complexity level and achieves near optimal performance.
ER -
English
