TY - GEN
T1 - Network-Coded Content Delivery in Femtocaching-Assisted Cellular Networks
AU - Shnaiwer, Yousef N.
AU - Sorour, Sameh
AU - Aboutorab, Neda
AU - Sadeghi, Parastoo
AU - Al-Naffouri, Tareq Y.
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/3/28
Y1 - 2016/3/28
N2 - Next-generation cellular networks are expected to be assisted by femtocaches (FCs), which collectively store the most popular files for the clients. Given any arbitrary non-fragmented placement of such files, a strict no-latency constraint, and clients' prior knowledge, new file download requests could be efficiently handled by both the FCs and the macrocell base station (MBS) using opportunistic network coding (ONC). In this paper, we aim to find the best allocation of coded file downloads to the FCs so as to minimize the MBS involvement in this download process. We first formulate this optimization problem over an ONC graph, and show that it is NP-hard. We then propose a greedy approach that maximizes the number of files downloaded by the FCs, with the goal to reduce the download share of the MBS. This allocation is performed using a dual conflict ONC graph to avoid conflicts among the FC downloads. Simulations show that our proposed scheme almost achieves the optimal performance and significantly saves on the MBS bandwidth.
AB - Next-generation cellular networks are expected to be assisted by femtocaches (FCs), which collectively store the most popular files for the clients. Given any arbitrary non-fragmented placement of such files, a strict no-latency constraint, and clients' prior knowledge, new file download requests could be efficiently handled by both the FCs and the macrocell base station (MBS) using opportunistic network coding (ONC). In this paper, we aim to find the best allocation of coded file downloads to the FCs so as to minimize the MBS involvement in this download process. We first formulate this optimization problem over an ONC graph, and show that it is NP-hard. We then propose a greedy approach that maximizes the number of files downloaded by the FCs, with the goal to reduce the download share of the MBS. This allocation is performed using a dual conflict ONC graph to avoid conflicts among the FC downloads. Simulations show that our proposed scheme almost achieves the optimal performance and significantly saves on the MBS bandwidth.
UR - http://hdl.handle.net/10754/605654
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7417276
U2 - 10.1109/GLOCOM.2015.7417276
DO - 10.1109/GLOCOM.2015.7417276
M3 - Conference contribution
SN - 9781479959525
BT - 2015 IEEE Global Communications Conference (GLOBECOM)
PB - IEEE
ER -