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
Abordamos o problema de agendamento de interferência co-canal multiusuário em redes multicelulares com interferência limitada. Nosso objetivo é otimizar a capacidade da rede sob a política de controle de potência balanceada por SIR. Como é difícil otimizar o problema original, derivamos um novo problema que maximiza o limite inferior da capacidade da rede. Com base na análise deste novo problema, propomos um algoritmo de escalonamento com correspondência de interferências. Este algoritmo considera a interferência co-canal causada e as condições do canal para agendar os usuários “casados” ao mesmo tempo. Provamos que este algoritmo de escalonamento combinado com interferência otimiza o limite inferior da capacidade da rede para qualquer número arbitrário de células e usuários. Além disso, este método de escalonamento é de baixa complexidade e pode ser implementado de forma totalmente distribuída. Os resultados da simulação revelam que o desempenho do algoritmo proposto atinge capacidade próxima da ideal, embora não otimize diretamente a capacidade da rede. Finalmente, o algoritmo proposto apresenta um grande ganho em relação ao método de escalonamento round robin e power matched proposto anteriormente, especialmente quando a escala da rede é grande.
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.
Copiar
Xingzai LV, Jinkang ZHU, Ling QIU, "Distributed Interference Matched Scheduling for Multicell Environment" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 6, pp. 2112-2121, June 2009, doi: 10.1587/transcom.E92.B.2112.
Abstract: We address the problem of multiuser co-channel interference scheduling in multicell interference-limited networks. Our target is to optimize the network capacity under the SIR-balanced power control policy. Since it's difficult to optimize the original problem, we derive a new problem which maximizes the lower bound of the network capacity. Based on the analysis of this new problem, we propose an interference matched scheduling algorithm. This algorithm considers the caused co-channel interference and the channel conditions to schedule the "matched" users at the same time. We prove that this interference matched scheduling algorithm optimizes the lower bound of the network capacity for any arbitrary numbers of cells and users. Moreover, this scheduling method is low-complexity and can be implemented in a fully distributed fashion. Simulation results reveal that the performance of the proposed algorithm achieves near optimal capacity, even though it does not optimize the network capacity directly. Finally, the proposed algorithm holds a great gain over formerly proposed round robin and power matched scheduling method, especially when the scale of the network is large.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2112/_p
Copiar
@ARTICLE{e92-b_6_2112,
author={Xingzai LV, Jinkang ZHU, Ling QIU, },
journal={IEICE TRANSACTIONS on Communications},
title={Distributed Interference Matched Scheduling for Multicell Environment},
year={2009},
volume={E92-B},
number={6},
pages={2112-2121},
abstract={We address the problem of multiuser co-channel interference scheduling in multicell interference-limited networks. Our target is to optimize the network capacity under the SIR-balanced power control policy. Since it's difficult to optimize the original problem, we derive a new problem which maximizes the lower bound of the network capacity. Based on the analysis of this new problem, we propose an interference matched scheduling algorithm. This algorithm considers the caused co-channel interference and the channel conditions to schedule the "matched" users at the same time. We prove that this interference matched scheduling algorithm optimizes the lower bound of the network capacity for any arbitrary numbers of cells and users. Moreover, this scheduling method is low-complexity and can be implemented in a fully distributed fashion. Simulation results reveal that the performance of the proposed algorithm achieves near optimal capacity, even though it does not optimize the network capacity directly. Finally, the proposed algorithm holds a great gain over formerly proposed round robin and power matched scheduling method, especially when the scale of the network is large.},
keywords={},
doi={10.1587/transcom.E92.B.2112},
ISSN={1745-1345},
month={June},}
Copiar
TY - JOUR
TI - Distributed Interference Matched Scheduling for Multicell Environment
T2 - IEICE TRANSACTIONS on Communications
SP - 2112
EP - 2121
AU - Xingzai LV
AU - Jinkang ZHU
AU - Ling QIU
PY - 2009
DO - 10.1587/transcom.E92.B.2112
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2009
AB - We address the problem of multiuser co-channel interference scheduling in multicell interference-limited networks. Our target is to optimize the network capacity under the SIR-balanced power control policy. Since it's difficult to optimize the original problem, we derive a new problem which maximizes the lower bound of the network capacity. Based on the analysis of this new problem, we propose an interference matched scheduling algorithm. This algorithm considers the caused co-channel interference and the channel conditions to schedule the "matched" users at the same time. We prove that this interference matched scheduling algorithm optimizes the lower bound of the network capacity for any arbitrary numbers of cells and users. Moreover, this scheduling method is low-complexity and can be implemented in a fully distributed fashion. Simulation results reveal that the performance of the proposed algorithm achieves near optimal capacity, even though it does not optimize the network capacity directly. Finally, the proposed algorithm holds a great gain over formerly proposed round robin and power matched scheduling method, especially when the scale of the network is large.
ER -