TY - GEN
T1 - Interference management by exploiting cached files at users
AU - Guo, Kaiyang
AU - Yang, Chenyang
AU - Liu, Tingting
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - In this paper, we strive to improve the throughput of wireless networks by exploiting the pre-cached files at user end to manage interference. We employ network-coded multicast (NCM) to help cancel multi-user interference, and reconstructed interference cancellation (RIC) to help cancel inter-cell interference. Because inter-cell interference may not be thoroughly canceled by RIC, base station (BS) muting is used to coordinate the residual strong interference. We jointly optimize user association and BS muting to maximize the number of users simultaneously served by a system using NCM and RIC with any given caching policy. Owing to the complex relation among BS muting, user association, NCM, and RIC, the formulated problem is NP-hard. By transforming the problem into the well-known maximal independent set problem with constructed conflict graph, the global optimal solution can be found efficiently with graph theory methods. Simulation results show that the proposed transmission strategy achieves a remarkable performance gain.
AB - In this paper, we strive to improve the throughput of wireless networks by exploiting the pre-cached files at user end to manage interference. We employ network-coded multicast (NCM) to help cancel multi-user interference, and reconstructed interference cancellation (RIC) to help cancel inter-cell interference. Because inter-cell interference may not be thoroughly canceled by RIC, base station (BS) muting is used to coordinate the residual strong interference. We jointly optimize user association and BS muting to maximize the number of users simultaneously served by a system using NCM and RIC with any given caching policy. Owing to the complex relation among BS muting, user association, NCM, and RIC, the formulated problem is NP-hard. By transforming the problem into the well-known maximal independent set problem with constructed conflict graph, the global optimal solution can be found efficiently with graph theory methods. Simulation results show that the proposed transmission strategy achieves a remarkable performance gain.
KW - BS muting
KW - Conflict graph
KW - Network-coded multicast
KW - Reconstructed interference cancellation
KW - User association
UR - https://www.scopus.com/pages/publications/85045254715
U2 - 10.1109/PIMRC.2017.8292446
DO - 10.1109/PIMRC.2017.8292446
M3 - 会议稿件
AN - SCOPUS:85045254715
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
SP - 1
EP - 6
BT - 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2017
Y2 - 8 October 2017 through 13 October 2017
ER -