TY - GEN
T1 - Content caching and user scheduling in heterogeneous wireless networks
AU - Huang, Xueqing
AU - Ansari, Nirwan
N1 - Funding Information:
This work was supported in part by NSF under grant no. CNS-1320468.
Publisher Copyright:
© 2016 IEEE.
PY - 2016
Y1 - 2016
N2 - To facilitate content delivery to mobile users, we propose a content caching and distribution framework for the heterogeneous OFDM networks, where a library of files available at the macro base station (MBS) can be distributively cached in multiple serving nodes (SNs). SNs are capable of both receiving unstored files from MBS and transmitting files to the associated users. For a given group of file downloading requests, the user scheduling scheme is jointly designed with the content caching scheme so that the number of served users is maximized for a given amount of spectrum and time. First, the corresponding downlink throughput maximization problem is shown to be NP-hard. Then, for the system with one MBS and one SN, the design of the joint user scheduling and caching scheme is transformed into a binary linear programming problem. For the system with one MBS and two SNs, the joint scheduling and caching (JSC) algorithm has been proposed to tap on the potential of the coded multicasting scheme between MBS and SNs. The proposed algorithm can be extended to networks with arbitrary number of SNs. Simulation results demonstrate that the JSC algorithm provides a significant sum throughput gain.
AB - To facilitate content delivery to mobile users, we propose a content caching and distribution framework for the heterogeneous OFDM networks, where a library of files available at the macro base station (MBS) can be distributively cached in multiple serving nodes (SNs). SNs are capable of both receiving unstored files from MBS and transmitting files to the associated users. For a given group of file downloading requests, the user scheduling scheme is jointly designed with the content caching scheme so that the number of served users is maximized for a given amount of spectrum and time. First, the corresponding downlink throughput maximization problem is shown to be NP-hard. Then, for the system with one MBS and one SN, the design of the joint user scheduling and caching scheme is transformed into a binary linear programming problem. For the system with one MBS and two SNs, the joint scheduling and caching (JSC) algorithm has been proposed to tap on the potential of the coded multicasting scheme between MBS and SNs. The proposed algorithm can be extended to networks with arbitrary number of SNs. Simulation results demonstrate that the JSC algorithm provides a significant sum throughput gain.
UR - http://www.scopus.com/inward/record.url?scp=85015364472&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015364472&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2016.7841688
DO - 10.1109/GLOCOM.2016.7841688
M3 - Conference contribution
AN - SCOPUS:85015364472
T3 - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
BT - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 59th IEEE Global Communications Conference, GLOBECOM 2016
Y2 - 4 December 2016 through 8 December 2016
ER -