ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Achieving Fair Cell-Edge Performance: Low-Complexity Interference Coordination in OFDMA Networks
Cited 3 time in scopus Download 6 time Share share facebook twitter linkedin kakaostory
저자
김승현, 좌혜경, 문정모, 나지현
발행일
201802
출처
International Conference on Advanced Communications Technology (ICACT) 2018, pp.6-11
DOI
https://dx.doi.org/10.23919/ICACT.2018.8323626
초록
We propose a low-complexity downlink interference coordination algorithm in OFDMA networks. The algorithm aims to achieve high proportional fairness among cell-edge users, as the effects of inter-cell interference are most noticeable in cell-edge areas where users are interfered by signals from neighbor base-stations. We demonstrate that the performance of our algorithm is greater than that of a decentralized algorithm which aims at interference randomization. Our algorithm consists of two stages. In the first stage, it constructs a bipartite graph that describes which set of base-stations imposes significant interference on each cell-edge user. In the second stage, exploiting the structure of the constructed graph, it solves an optimization problem to attain high proportional fairness.
KSP 제안 키워드
Bipartite graph, Coordination Algorithm, Decentralized algorithm, First stage, OFDMA networks, Optimization problem, Proportional Fairness, cell-edge users, downlink interference, inter-cell interference(ICI), interference coordination