TY - GEN
T1 - A low-rank approach for interference management in dense wireless networks
AU - Yang, Kai
AU - Shi, Yuanming
AU - Zhang, Jun
AU - Ding, Zhi
AU - Letaief, Khaled B.
PY - 2017/4/19
Y1 - 2017/4/19
N2 - The curse of big data, propelled by the explosive growth of mobile devices, places overwhelming pressures on wireless communications. Network densification is a promising approach to improve the area spectral efficiency, but to acquire massive channel state information (CSI) for effective interference management becomes a formidable task. In this paper, we propose a novel interference management method which only requires the network connectivity information, i.e., the knowledge of the presence of strong links, and statistical information of the weak links. To acquire such mixed network connectivity information incurs significant less overhead than complete CSI, and thus this method is scalable to large network sizes. To maximize the sum-rate with the mixed network connectivity information, we formulate a rank minimization problem to cancel strong interference and suppress weak interference, which is then solved by a Riemannian trust-region algorithm. Such algorithm is robust to initial points and has a fast convergence rate. Simulation result shows that our approach achieves a higher data rate than the state-of-the-art methods.
AB - The curse of big data, propelled by the explosive growth of mobile devices, places overwhelming pressures on wireless communications. Network densification is a promising approach to improve the area spectral efficiency, but to acquire massive channel state information (CSI) for effective interference management becomes a formidable task. In this paper, we propose a novel interference management method which only requires the network connectivity information, i.e., the knowledge of the presence of strong links, and statistical information of the weak links. To acquire such mixed network connectivity information incurs significant less overhead than complete CSI, and thus this method is scalable to large network sizes. To maximize the sum-rate with the mixed network connectivity information, we formulate a rank minimization problem to cancel strong interference and suppress weak interference, which is then solved by a Riemannian trust-region algorithm. Such algorithm is robust to initial points and has a fast convergence rate. Simulation result shows that our approach achieves a higher data rate than the state-of-the-art methods.
KW - Capacity
KW - Interference leakage
KW - Riemannian optimization
KW - Sum-rate
KW - Topological interference management
UR - http://www.scopus.com/inward/record.url?scp=85019264451&partnerID=8YFLogxK
U2 - 10.1109/GlobalSIP.2016.7905934
DO - 10.1109/GlobalSIP.2016.7905934
M3 - Conference article published in proceeding or book
AN - SCOPUS:85019264451
T3 - 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings
SP - 708
EP - 712
BT - 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016
Y2 - 7 December 2016 through 9 December 2016
ER -